Gaining confidence on the correct realization of arbitrary quantum computations

Abstract

We present verification protocols to gain confidence in the correct performance of the realization of an arbitrary universal quantum computation. The derivation of the protocols is based on the fact that matchgate computations, which are classically efficiently simulable, become universal if supplemented with additional resources. We combine tools from weak simulation, randomized compiling, and classical statistics to derive verification circuits. These circuits have the property that (i) they strongly resemble the original circuit and (ii) cannot only be classically efficiently simulated in the ideal, i.e. error free, scenario, but also in the realistic situation where errors are present. In fact, in one of the protocols we apply exactly the same circuit as in the original computation, however, to a slightly modified input state.

16 pages, 8 figures

References in corpus (21)

• SciPy 1.0--Fundamental Algorithms for Scientific Computing in Python
• Randomized Benchmarking of Quantum Gates
• Noise tailoring for scalable quantum computation via randomized compiling
• Efficient measurement of quantum gate error by interleaved randomized benchmarking
• Quantum certification and benchmarking
• Classical simulation of noninteracting-fermion quantum circuits
• Matchgates and classical simulation of quantum circuits
• Cross-Platform Verification of Intermediate Scale Quantum Devices
• On entropy growth and the hardness of simulating time evolution
• Scalable randomized benchmarking of quantum computers using mirror circuits
• Experimental Estimation of Average Fidelity of a Clifford Gate on a 7-qubit Quantum Processor
• Efficient classical simulation of matchgate circuits with generalized inputs and measurements
• All pure fermionic non-Gaussian states are magic states for matchgate computations
• Randomized benchmarking for individual quantum gates
• Accrediting outputs of noisy intermediate-scale quantum computing devices
• Matchgate and space-bounded quantum computations are equivalent
• Extending matchgates into universal quantum computation
• Strategies for practical advantage of fault-tolerant circuit design in noisy trapped-ion quantum computers
• Mode-entanglement of Gaussian fermionic states
• Computational power of matchgates with supplementary resources
• Two-party LOCC convertibility of quadpartite states and Kraus-Cirac number of two-qubit unitaries