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

• URL: http://arxiv.org/abs/2311.17798v2
• Date: Thu, 04 Sep 2025 21:02:34 GMT
• Title: Adaptive Circuit Learning of Born Machine: Towards Realization of Amplitude Embedding and Quantum Data Loading
• Authors: Chun-Tse Li, Hao-Chung Cheng,
• Abstract summary: We propose a framework called Adaptive Circuit Learning of Born Machine, which dynamically expands the ansatz circuit.<n>Our algorithm is designed to selectively integrate two-qubit entangled gates that best capture the intricate entanglement present within the target state.
• Score: 14.015610256155602
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Investigating Quantum Circuit Designs Using Neuro-Evolution [2.9631016562930537]
  We propose an evolutionary approach to the automated design and training of quantum circuits.<n>The proposed method searches over gate types, qubit connectivity, parameterization, and circuit depth while respecting hardware and noise constraints.<n>Preliminary results demonstrate that circuits evolved on classification tasks are able to achieve over 90% accuracy.
  arXiv  Detail & Related papers  (2026-02-03T18:57:39Z)
• Provably Robust Training of Quantum Circuit Classifiers Against Parameter Noise [49.97673761305336]
  Noise remains a major obstacle to achieving reliable quantum algorithms.<n>We present a provably noise-resilient training theory and algorithm to enhance the robustness of parameterized quantum circuit classifiers.
  arXiv  Detail & Related papers  (2025-05-24T02:51:34Z)
• Quantum Algorithms Without Coherent Quantum Access [0.0]
  Most quantum speedups rely on a subroutine in which classical information can be accessed in a coherent quantum manner.<n>It has been shown that without such an access, the quantum computer cannot be stronger than the classical counterparts.<n>In this work, we develop several variants of quantum algorithms.
  arXiv  Detail & Related papers  (2025-03-04T11:24:28Z)
• Efficient Quantum Circuit Compilation for Near-Term Quantum Advantage [17.38734393793605]
  We propose an approximate method for compiling target quantum circuits into brick-wall layouts.<n>This new circuit design consists of two-qubit CNOT gates that can be directly implemented on real quantum computers.
  arXiv  Detail & Related papers  (2025-01-13T15:04:39Z)
• Circuit Folding: Modular and Qubit-Level Workload Management in Quantum-Classical Systems [5.6744988702710835]
  Circuit knitting is a technique that offloads some of the computational burden from quantum circuits. We propose CiFold, a novel graph-based system that identifies and leverages repeated structures within quantum circuits. Our system has been extensively evaluated across various quantum algorithms, achieving up to 799.2% reduction in quantum resource usage.
  arXiv  Detail & Related papers  (2024-12-24T23:34:17Z)
• AC/DC: Automated Compilation for Dynamic Circuits [0.41356970190072423]
  We present a novel framework for generating dynamic quantum circuits that automatically prepare any state or unitary operator. We demonstrate the generation of dynamic circuits for state preparation, long-range entangling gates, circuit optimization, and the application of dynamic circuits to lattice simulations.
  arXiv  Detail & Related papers  (2024-12-10T23:14:42Z)
• QCircuitBench: A Large-Scale Dataset for Benchmarking Quantum Algorithm Design [63.02824918725805]
  Quantum computing is recognized for the significant speedup it offers over classical computing through quantum algorithms.<n>QCircuitBench is the first benchmark dataset designed to evaluate AI's capability in designing and implementing quantum algorithms.
  arXiv  Detail & Related papers  (2024-10-10T14:24:30Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Quantum Circuit Synthesis and Compilation Optimization: Overview and Prospects [59.07692103357675]
  This survey explores the feasibility of an integrated design and optimization scheme that spans from the algorithmic level to quantum hardware.<n>It becomes more possible to reduce manual design costs, enhance the precision and efficiency of execution, and facilitate the implementation and validation of the superiority of quantum algorithms on hardware.
  arXiv  Detail & Related papers  (2024-06-30T15:50:10Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Testing and Debugging Quantum Circuits [0.65268245109828]
  This paper focuses on three types of circuit blocks: Amplitude Permutation, Phase Modulation, and Amplitude Redistribution circuit blocks. We present a comprehensive unit testing tool (Cirquo) and debug approaches tailored to the unique demands of quantum computing.
  arXiv  Detail & Related papers  (2023-11-30T02:42:58Z)
• Predicting RNA Secondary Structure on Universal Quantum Computer [2.277461161767121]
  It is the first step for understanding how RNA structure folds from base sequences that to know how its secondary structure is formed. Traditional energy-based algorithms are short of precision, particularly for non-nested sequences. Gate model algorithms for universal quantum computing are not available.
  arXiv  Detail & Related papers  (2023-05-16T15:57:38Z)
• Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• Parametric Synthesis of Computational Circuits for Complex Quantum Algorithms [0.0]
  The purpose of our quantum synthesizer is enabling users to implement quantum algorithms using higher-level commands. The proposed approach for implementing quantum algorithms has a potential application in the field of machine learning.
  arXiv  Detail & Related papers  (2022-09-20T06:25:47Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• Quantum amplitude damping for solving homogeneous linear differential equations: A noninterferometric algorithm [0.0]
  This work proposes a novel approach by using the Quantum Amplitude Damping operation as a resource, in order to construct an efficient quantum algorithm for solving homogeneous LDEs. We show that such an open quantum system-inspired circuitry allows for constructing the real exponential terms in the solution in a non-interferometric.
  arXiv  Detail & Related papers  (2021-11-10T11:25:32Z)
• Efficient realization of quantum algorithms with qudits [0.70224924046445]
  We propose a technique for an efficient implementation of quantum algorithms with multilevel quantum systems (qudits) Our method uses a transpilation of a circuit in the standard qubit form, which depends on the parameters of a qudit-based processor. We provide an explicit scheme of transpiling qubit circuits into sequences of single-qudit and two-qudit gates taken from a particular universal set.
  arXiv  Detail & Related papers  (2021-11-08T11:09:37Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Quantum Gate Pattern Recognition and Circuit Optimization for Scientific Applications [1.6329956884407544]
  We introduce two ideas for circuit optimization and combine them in a multi-tiered quantum circuit optimization protocol called AQCEL. AQCEL is deployed on an iterative and efficient quantum algorithm designed to model final state radiation in high energy physics. Our technique is generic and can be useful for a wide variety of quantum algorithms.
  arXiv  Detail & Related papers  (2021-02-19T16:20:31Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.