Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage

Abstract

While recent breakthroughs have proven the ability of noisy intermediate-scale quantum (NISQ) devices to achieve quantum advantage in classically-intractable sampling tasks, the use of these devices for solving more practically relevant computational problems remains a challenge. Proposals for attaining practical quantum advantage typically involve parametrized quantum circuits (PQCs), whose parameters can be optimized to find solutions to diverse problems throughout quantum simulation and machine learning. However, training PQCs for real-world problems remains a significant practical challenge, largely due to the phenomenon of barren plateaus in the optimization landscapes of randomly-initialized quantum circuits. In this work, we introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for PQCs, which we show significantly improves the trainability and performance of PQCs on a variety of problems. Given a specific optimization task, this method first utilizes tensor network (TN) simulations to identify a promising quantum state, which is then converted into gate parameters of a PQC by means of a high-performance decomposition procedure. We show that this learned initialization avoids barren plateaus, and effectively translates increases in classical resources to enhanced performance and speed in training quantum circuits. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing, and opens up new avenues to harness the power of modern quantum hardware for realizing practical quantum advantage.

15 pages, 7 figures

References in corpus (4)

• Efficient quantum state tomography
• Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps
• Molecular Quantum Circuit Design: A Graph-Based Approach
• Simulating Large PEPs Tensor Networks on Small Quantum Devices

Cited by in corpus (41)

• Barren Plateaus in Variational Quantum Computing
• Quantum Computing for High-Energy Physics: State of the Art and Challenges. Summary of the QC4HEP Working Group
• Does provable absence of barren plateaus imply classical simulability?
• Hamiltonian variational ansatz without barren plateaus
• Constant-depth preparation of matrix product states with adaptive quantum circuits
• Towards large-scale quantum optimization solvers with few qubits
• Trainability barriers and opportunities in quantum generative modeling
• A Framework for Demonstrating Practical Quantum Advantage: Racing Quantum against Classical Generative Models
• Variational quantum simulation: a case study for understanding warm starts
• Engineered dissipation to mitigate barren plateaus
• Tight and Efficient Gradient Bounds for Parameterized Quantum Circuits
• Quantum Convolutional Neural Networks are Effectively Classically Simulable
• Lie-algebraic classical simulations for quantum computing
• Isometric tensor network optimization for extensive Hamiltonians is free of barren plateaus
• Combining Matrix Product States and Noisy Quantum Computers for Quantum Simulation
• Bias-Field Digitized Counterdiabatic Quantum Algorithm for Higher-Order Binary Optimization
• Measurement-based infused circuits for variational quantum eigensolvers
• Hybrid Tree Tensor Networks for quantum simulation
• Barren plateaus are swamped with traps
• Approximate Quantum Compiling for Quantum Simulation: A Tensor Network based approach
• Beyond Quantum Annealing: Optimal control solutions to MaxCut problems
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits
• Deep Circuit Compression for Quantum Dynamics via Tensor Networks
• The Role of Quantum Computing in Advancing Scientific High-Performance Computing: A perspective from the ADAC Institute
• High-fidelity dimer excitations using quantum hardware
• Continuous optimization by quantum adaptive distribution search
• Tensor tree learns hidden relational structures in data to construct generative models
• Dual-VQE: A quantum algorithm to lower bound the ground-state energy
• A quantum computing approach to fixed-node Monte Carlo using classical shadows
• VQE-generated quantum circuit dataset for machine learning
• Typical Machine Learning Datasets as Low-Depth Quantum Circuits
• Tensor Network for Anomaly Detection in the Latent Space of Proton Collision Events at the LHC
• Simulating Quantum Turbulence with Matrix Product States
• Expressivity of deterministic quantum computation with one qubit
• Analysis of Quantum Image Representations for Supervised Classification
• A coherent approach to quantum-classical optimization
• Transfer entropy and O-information to detect grokking in tensor network multi-class classification problems
• Learning complexity gradually in quantum machine learning models
• Quantum Encoding of Structured Data with Matrix Product States
• Trainable Quantum Neural Network for Multiclass Image Classification with the Power of Pre-trained Tree Tensor Networks
• A quantum eigenvalue solver based on tensor networks