Idioma:

Verification of Quantum Computation: An Overview of Existing Approaches

Gheorghiu, Alexandru ; Kapourniotis, Theodoros ; Kashefi, Elham

Theory of computing systems, 2019-05, Vol.63 (4), p.715-808 [Periódico revisado por pares]

Texto completo disponível

Citações Citado por

Título:
Verification of Quantum Computation: An Overview of Existing Approaches
Autor: Gheorghiu, Alexandru ; Kapourniotis, Theodoros ; Kashefi, Elham
Assuntos: Computational Complexity ; Computer Science ; Computer Science Symposium in Russia ; Computers ; Cryptography ; Cryptography and Security ; Fault tolerance ; Physics ; Program verification (computers) ; Quantum computers ; Quantum computing ; Quantum Physics ; Theory of Computation
É parte de: Theory of computing systems, 2019-05, Vol.63 (4), p.715-808
Descrição: Quantum computers promise to efficiently solve not only problems believed to be intractable for classical computers, but also problems for which verifying the solution is also considered intractable. This raises the question of how one can check whether quantum computers are indeed producing correct results. This task, known as quantum verification , has been highlighted as a significant challenge on the road to scalable quantum computing technology. We review the most significant approaches to quantum verification and compare them in terms of structure, complexity and required resources. We also comment on the use of cryptographic techniques which, for many of the presented protocols, has proven extremely useful in performing verification. Finally, we discuss issues related to fault tolerance, experimental implementations and the outlook for future protocols.
Editor: New York: Springer US
Idioma: Inglês

Links

Voltar para lista de resultados