Verifying BQP Computations on Noisy Devices with Minimal Overhead Dominik Leichtle, Luka Music, Elham Kashefi, and Harold Ollivier PRX Quantum 2, 040302 – Published 4 October 2021
With the development of delegated quantum computation, clients will want to ensure confidentiality of their data and algorithms and the integrity of their computations. While protocols for blind and verifiable quantum computation exist, they suffer from high overheads and from oversensitivity: when running on noisy devices, imperfections trigger the same detection mechanisms as malicious attacks, resulting in perpetually aborted computations. We introduce the first blind and verifiable protocol for delegating bounded-error quantum polynomial (BQP) computations to a powerful server, with repetition as the only overhead. It is composable and statistically secure with exponentially low bounds and can tolerate a constant amount of global noise.
To initiate the process of developing the protocol into a code, this repository was created. The code developement here acts as a loose framework to construct each element of the protocol. As of 21/02/2023 no quantum simulator or computer has been developed or attached. This will be updated as the code develops.
I have not set up the automatic docs yet.
But here is the link to the current incomplete set of docs.
This package has not been added to the general registry yet.
Add package by
] add https://github.com/fieldofnodes/RobustVerificationSimulator.jlAs per usual add this to your script.
using RobustVerificationSimulator