Quasi-Shor Algorithms for Global Benchmarking of Universal Quantum Processors
Open Access
- 22 December 2022
- journal article
- research article
- Published by MDPI AG in Applied Sciences
- Vol. 13 (1) , 139
Abstract
This work generalizes Shor’s algorithm into quasi-Shor algorithms by replacing the modular exponentiation with alternative unitary operations. By using the quantum circuits to generate Bell states as the unitary operations, a specific example called the Bell–Shor algorithm was constructed. The system density matrices in the quantum circuits with four distinct input states were calculated in ideal conditions and illustrated through chromatic graphs to witness the evolution of quantum states in the quantum circuits. For the real part of the density matrices, it was revealed that the number of zero elements dramatically declined to only a few points after the operation of the inverse quantum Fourier transformation. Based on this property, a protocol constituting a pair of error metrics and is proposed for the global benchmarking of universal quantum processors by looking at the locations of the zero entries and normalized average values of non-zero entries. The protocol has polynomial resource requirements with the scale of the quantum processor. The Bell–Shor algorithm is capable of being a feasible setting for the global benchmarking of universal quantum processors.
Keywords
Funding Information
- National Natural Science Foundation of China (60836001, 20161361354)
- Ministry of Science and Technology of the People’s Republic of China (MOST) (2011CBA00304)
This publication has 62 references indexed in Scilit:
- Quantum Algorithm for Linear Systems of EquationsPhysical Review Letters, 2009
- Demonstration of two-qubit algorithms with a superconducting quantum processorNature, 2009
- Randomized benchmarking of quantum gatesPhysical Review A, 2008
- Universal entanglement transformations without communicationPhysical Review A, 2003
- Quantum Computation and Quantum InformationAmerican Journal of Physics, 2002
- Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonanceNature, 2001
- Benchmarking Quantum Computers: The Five-Qubit Error Correcting CodePhysical Review Letters, 2001
- Quantifying EntanglementPhysical Review Letters, 1997
- Concentrating partial entanglement by local operationsPhysical Review A, 1996
- Quantum theory, the Church–Turing principle and the universal quantum computerProceedings of the Royal Society of London. A. Mathematical and Physical Sciences, 1985