Hunting for quantum-classical crossover in condensed matter problems

Abstract

The intensive pursuit for quantum advantage in terms of computational complexity has further led to a modernized crucial question: {\it When and how will quantum computers outperform classical computers?} The next milestone is undoubtedly the realization of quantum acceleration in practical problems. Here we provide a clear evidence and arguments that the primary target is likely to be condensed matter physics. Our primary contributions are summarized as follows: 1) Proposal of systematic error/runtime analysis on state-of-the-art classical algorithm based on tensor networks; 2) Dedicated and high-resolution analysis on quantum resource performed at the level of executable logical instructions; 3) Clarification of quantum-classical crosspoint for ground-state simulation to be within runtime of hours using only a few hundreds of thousand physical qubits for 2d Heisenberg and 2d Fermi-Hubbard models, assuming that logical qubits are encoded via the surface code with the physical error rate of $p=10^{-3}$. To our knowledge, we argue that condensed matter problems offer the earliest platform for demonstration of practical quantum advantage that is order-of-magnitude more feasible than ever known candidates, in terms of both qubit counts and total runtime.

14+41 pages, 8+24 figures

References in corpus (10)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Surface codes: Towards practical large-scale quantum computation
• Quantum computational advantage using photons
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Criticality, the area law, and the computational power of PEPS
• Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light
• High-threshold and low-overhead fault-tolerant quantum memory
• The Density Matrix Renormalization Group in Chemistry and Molecular Physics: Recent Developments and New Challenges
• The density matrix renormalization group for ab initio quantum chemistry
• Assessing requirements to scale to practical quantum advantage

Cited by in corpus (26)

• Handbook for Quantifying Robustness of Magic
• Fault-tolerant quantum algorithms for quantum molecular systems: A survey
• Quantum Computing and Neuromorphic Computing for Safe, Reliable, and explainable Multi-Agent Reinforcement Learning: Optimal Control in Autonomous Robotics
• End-to-end complexity for simulating the Schwinger model on quantum computers
• Ab initio extended Hubbard model of short polyenes for efficient quantum computing
• Plane-selective manipulations of nuclear spin qubits in a three-dimensional optical tweezer array
• Computing n-time correlation functions without ancilla qubits
• Resource-optimized fault-tolerant simulation of the Fermi-Hubbard model and high-temperature superconductor models
• Encoded probabilistic imaginary-time evolution on a trapped-ion quantum computer for ground and excited states of spin qubits
• Classical variational optimization of PREPARE circuit for quantum phase estimation of quantum chemistry Hamiltonians
• LSQCA: Resource-Efficient Load/Store Architecture for Limited-Scale Fault-Tolerant Quantum Computing
• C3-VQA: Cryogenic Counter-based Co-processor for Variational Quantum Algorithms
• Faster computation of nonstabilizerness
• Heisenberg-limited adaptive gradient estimation for multiple observables
• Improved quantum algorithm for calculating eigenvalues of differential operators and its application to estimating the decay rate of the perturbation distribution tail in stochastic inflation
• Logical entanglement distribution between distant 2D array qubits
• Fault-tolerant quantum simulation of generalized Hubbard models
• Bridging Quantum Computing and Nuclear Structure: Atomic Nuclei on a Trapped-Ion Quantum Computer
• Multiplexed Quantum Communication with Surface and Hypergraph Product Codes
• Averaging gate approximation error and performance of Unitary Coupled Cluster ansatz in Pre-FTQC Era
• Online Job Scheduler for Fault-tolerant Quantum Multiprogramming
• Symmetric channel verification for purifying noisy quantum channels
• Error Crafting in Mixed Quantum Gate Synthesis
• Faster Quantum Algorithm for Multiple Observables Estimation in Fermionic Problems
• Accelerated spin-adapted ground state preparation with non-variational quantum algorithms
• Nontrivial multi-product commutation relation toward reducing T-count in sequential Pauli-based computation