npj Quantum Information · 2021 · 80 citations · 44 references
ComputingComputer SciencePhysicsCircuit TheoryQuantum ComputingQuantum MechanicsApproximation MethodsQuantum CircuitsQuantum ComputationQuantum Hardware ArchitecturesCircuit Depth OptimizationLocality ConditionsLocality ConstraintsMany-body Quantum MechanicsMany-body Quantum SystemsQuantum Circuit Depth ReductionQuantum Many-body SystemsQuantum Nonlocality
Abstract The imaginary-time evolution method is a well-known approach used for obtaining the ground state in quantum many-body problems on a classical computer. A recently proposed quantum imaginary-time evolution method (QITE) faces problems of deep circuit depth and difficulty in the implementation on noisy intermediate-scale quantum (NISQ) devices. In this study, a nonlocal approximation is developed to tackle this difficulty. We found that by removing the locality condition or local approximation (LA), which was imposed when the imaginary-time evolution operator is converted to a unitary operator, the quantum circuit depth is significantly reduced. We propose two-step approximation methods based on a nonlocality condition: extended LA (eLA) and nonlocal approximation (NLA). To confirm the validity of eLA and NLA, we apply them to the max-cut problem of an unweighted 3-regular graph and a weighted fully connected graph; we comparatively evaluate the performances of LA, eLA, and NLA. The eLA and NLA methods require far fewer circuit depths than LA to maintain the same level of computational accuracy. Further, we developed a “compression” method of the quantum circuit for the imaginary-time steps to further reduce the circuit depth in the QITE method. The eLA, NLA, and compression methods introduced in this study allow us to reduce the circuit depth and the accumulation of error caused by the gate operation significantly and pave the way for implementing the QITE method on NISQ devices.
44
A fast quantum mechanical algorithm for database search
Lov K. Grover · 1996 · 8.6K citations · Full text
Quantum Computing in the NISQ era and beyond
John Preskill · Quantum · 2018 · 8.2K citations · Full text
Computing, Computer Science, Physics +17
Algorithms for Clustering Data
Warren S. Sarle, Anil K. Jain, Richard C. Dubes · Technometrics · 1990 · 7.8K citations
Simulating physics with computers
Richard P. Feynman · International Journal of Theoretical Physics · 1982 · 7.5K citations
Quantum supremacy using a programmable superconducting processor
Nature · 2019 · 7K citations · Full text
Computing, Computer Science, Physics +14