Abstract
We prove that a quantum circuit together with measurement apparatuses and EPR sources can be self-tested, i.e. fully verified without any reference to some trusted set of quantum devices.
To achieve our goal we define the notions of simulation and equivalence. Using these two concepts, we construct sets of simulation conditions which imply that the physical device of interest is equivalent to the one it is supposed to implement. Another benefit of our formalism is that our statements can be proved to be robust.
Finally, we design a test for quantum circuits whose complexity is polynomial in the number of gates and qubits, and the required precision.
Supported by QAIP, AlgoQP, NSERC, ARDA, ORDCF, CFI, CIAR, ResQuant.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Blum, M., Kannan, S.: Designing programs that check their work. J. ACM 42(1), 269–291 (1995)
Blum, M., Luby, M., Rubinfeld, R.: Self-testing/correcting with applications to numerical problems. J. Computer and System Sciences 47(3), 549–595 (1993)
Mayers, D., Yao, A.: Quantum cryptography with imperfect apparatus. In: Proceedings of 39th IEEE FOCS, pp. 503–509 (1998)
Dam, W., Magniez, F., Mosca, M., Santha, M.: Self-testing of universal and fault-tolerant sets of quantum gates. In: Proc. of 32nd ACM STOC, pp. 688–696 (2000)
Buhrman, H., Fortnow, L., Newman, I., Röhrig, H.: Quantum property testing. In: Proc. of 14th ACM-SIAM SODA, pp. 480–488 (2003)
Friedl, K., Magniez, F., Santha, M., Sen, P.: Quantum testers for hidden group properties. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 419–428. Springer, Heidelberg (2003)
Rudolph, T., Grover, L.: A 2–rebit gate universal for quantum computing (2002)
Rubinfeld, R., Sudan, M.: Robust characterizations of polynomials with applications to program testing. SIAM J. Computing 25(2), 23–32 (1996)
Rubinfeld, R.: On the robustness of functional equations. SIAM J. Computing 28, 1972–1997 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Magniez, F., Mayers, D., Mosca, M., Ollivier, H. (2006). Self-testing of Quantum Circuits. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds) Automata, Languages and Programming. ICALP 2006. Lecture Notes in Computer Science, vol 4051. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11786986_8
Download citation
DOI: https://doi.org/10.1007/11786986_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35904-3
Online ISBN: 978-3-540-35905-0
eBook Packages: Computer ScienceComputer Science (R0)