Post hoc verification of quantum computation

December 14, 2015 Β· Declared Dead Β· πŸ› Phys. Rev. Lett. 120, 040501 (2018)

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Joseph F. Fitzsimons, Michal HajduΕ‘ek arXiv ID 1512.04375 Category quant-ph: Quantum Computing Cross-listed cs.CC, cs.CR Citations 0 Venue Phys. Rev. Lett. 120, 040501 (2018) Last Checked 5 months ago
Abstract
With recent progress on experimental quantum information processing, an important question has arisen as to whether it is possible to verify arbitrary computation performed on a quantum processor. A number of protocols have been proposed to achieve this goal, however all are interactive in nature, requiring that the computation be performed in an interactive manner with back and forth communication between the verifier and one or more provers. Here we propose two methods for verifying quantum computation in a non-interactive manner based on recent progress in the understanding of the local Hamiltonian problem. Provided that the provers compute certain witnesses for the computation, this allows the result of a quantum computation to be verified after the fact, a property not seen in current verification protocols.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Quantum Computing

Died the same way β€” πŸ‘» Ghosted