Adaptive Circuit Learning of Born Machine: Towards Realization of Amplitude Embedding and Quantum Data Loading

Abstract

Quantum data loading plays a central role in quantum algorithms and quantum information processing. Many quantum algorithms hinge on the ability to prepare arbitrary superposition states as a subroutine, with claims of exponential speedups often predicated on access to an efficient data-loading oracle. In practice, constructing a circuit to prepare a generic $n$-qubit quantum state typically demands computational efforts scaling as $\mathcal{O}(2^n)$, posing a significant challenge for quantum algorithms to outperform their classical counterparts. To address this critical issue, various hybrid quantum-classical approaches have been proposed. However, many of these solutions favor simplistic circuit architectures, which are susceptible to substantial optimization challenges. In this study, we harness quantum circuits as Born machines to generate probability distributions. Drawing inspiration from methods used to investigate electronic structures in quantum chemistry and condensed matter physics, we propose a framework called Adaptive Circuit Learning of Born Machine, which dynamically expands the ansatz circuit. Our algorithm is designed to selectively integrate two-qubit entangled gates that best capture the intricate entanglement present within the target state. Empirical experiments underscore the efficacy of our approach in encoding real-world data through amplitude embedding, demonstrating not only compliance with but also enhancement over the performance benchmarks set by prior research.

arXiv comment25 pages, 17 figures, 3 tables

References in corpus (36)

• Entanglement of Formation of an Arbitrary State of Two Qubits
• Elementary gates for quantum computation
• Quantum algorithm for solving linear systems of equations
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Quantum metrology
• Barren plateaus in quantum neural network training landscapes
• Quantum support vector machine for big data classification
• Quantum Circuit Learning
• Quantum Amplitude Amplification and Estimation
• Quantum principal component analysis
• Evaluating analytic gradients on quantum hardware
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Hamiltonian Simulation by Qubitization
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Simulating Hamiltonian dynamics with a truncated Taylor series
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
• Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
• Quantum computing for finance: overview and prospects
• Quantum generative adversarial learning
• Quantum generative adversarial networks
• Quantum Generative Adversarial Networks for Learning and Loading Random Distributions
• Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
• A geometric theory of non-local two-qubit operations
• qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
• A generative modeling approach for benchmarking and training shallow quantum circuits
• Quantum-state preparation with universal gate decompositions
• Preconditioned quantum linear system algorithm
• Differentiable Learning of Quantum Circuit Born Machine
• Unsupervised Generative Modeling Using Matrix Product States
• Learning the quantum algorithm for state overlap
• Amplitude estimation without phase estimation
• Efficient decomposition of quantum gates
• Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications
• Machine learning of noise-resilient quantum circuits
• Quantum-inspired algorithms for multivariate analysis: from interpolation to partial differential equations
• Quantum State Preparation of Normal Distributions using Matrix Product States