Efficient Gaussian State Preparation in Quantum Circuits

• URL: http://arxiv.org/abs/2507.20317v1
• Date: Sun, 27 Jul 2025 15:15:20 GMT
• Title: Efficient Gaussian State Preparation in Quantum Circuits
• Authors: Yichen Xie, Nadav Ben-Ami,
• Abstract summary: We propose and analyze a circuit-based approach that starts with single-qubit rotations to form an exponential amplitude profile.<n>We demonstrate that this procedure achieves high fidelity with the target Gaussian state.<n>We conclude that the proposed technique is a promising route to make Gaussian states accessible on noisy quantum hardware.
• Score: 4.930778301847907
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Gaussian states hold a fundamental place in quantum mechanics, quantum information, and quantum computing. Many subfields, including quantum simulation of continuous-variable systems, quantum chemistry, and quantum machine learning, rely on the ability to accurately and efficiently prepare states that reflect a Gaussian profile in their probability amplitudes. Although Gaussian states are natural in continuous-variable systems, the practical interest in digital, gate-based quantum computers demands discrete approximations of Gaussian distributions over a computational basis of size \(2^n\). Because of the exponential scaling of naive amplitude-encoding approaches and the cost of certain block-encoding or Hamiltonian simulation techniques, a resource-efficient preparation of approximate Gaussian states is required. In this work, we propose and analyze a circuit-based approach that starts with single-qubit rotations to form an exponential amplitude profile and then applies the quantum Fourier transform to map those amplitudes into an approximate Gaussian distribution. We demonstrate that this procedure achieves high fidelity with the target Gaussian state while allowing optional pruning of small controlled-phase angles in the quantum Fourier transform, thus reducing gate complexity to near-linear in \(\mathcal{O}(n)\). We conclude that the proposed technique is a promising route to make Gaussian states accessible on noisy quantum hardware and to pave the way for scalable implementations on future devices. The implementation of this algorithm is available at the Classiq library: https://github.com/classiq/classiq-library.

Related papers

• Quantum-assisted Gaussian process regression using random Fourier features [8.271361104403802]
  We introduce a quantum-assisted algorithm for Gaussian process regression based on the random Fourier feature kernel approximation.<n>We achieve a sparse-order computational speedup relative to the classical method.
  arXiv  Detail & Related papers  (2025-07-30T12:49:53Z)
• Provable Quantum Algorithm Advantage for Gaussian Process Quadrature [8.271361104403802]
  The aim of this paper is to develop novel quantum algorithms for Gaussian process quadrature methods.<n>We propose a quantum low-rank Gaussian process quadrature method based on a Hilbert space approximation of the Gaussian process kernel.<n>We provide a theoretical complexity analysis that shows a quantum computer advantage over classical quadrature methods.
  arXiv  Detail & Related papers  (2025-02-20T11:42:15Z)
• Quantum Algorithms for Stochastic Differential Equations: A Schrödingerisation Approach [29.662683446339194]
  We propose quantum algorithms for linear differential equations.<n>The gate complexity of our algorithms exhibits an $mathcalO(dlog(Nd))$ dependence on the dimensions.<n>The algorithms are numerically verified for the Ornstein-Uhlenbeck processes, Brownian motions, and one-dimensional L'evy flights.
  arXiv  Detail & Related papers  (2024-12-19T14:04:11Z)
• Quantum state preparation for bell-shaped probability distributions using deconvolution methods [0.0]
  We present a hybrid classical-quantum approach to load quantum data. We use the Jensen-Shannon distance as the cost function to quantify the closeness of the outcome from the classical step and the target distribution. The output from the deconvolution step is used to construct the quantum circuit required to load the given probability distribution.
  arXiv  Detail & Related papers  (2023-10-08T06:55:47Z)
• Measuring the Loschmidt amplitude for finite-energy properties of the Fermi-Hubbard model on an ion-trap quantum computer [27.84599956781646]
  We study the operation of a quantum-classical time-series algorithm on a present-day quantum computer. Specifically, we measure the Loschmidt amplitude for the Fermi-Hubbard model on a $16$-site ladder geometry (32 orbitals) on the Quantinuum H2-1 trapped-ion device. We numerically analyze the influence of noise on the full operation of the quantum-classical algorithm by measuring expectation values of local observables at finite energies.
  arXiv  Detail & Related papers  (2023-09-19T11:59:36Z)
• QuEst: Graph Transformer for Quantum Circuit Reliability Estimation [26.963991539714236]
  Python library called TorchQuantum can construct, simulate, and train PQC for machine learning tasks.<n>We propose to leverage a graph transformer model to predict noise impact on circuit fidelity.<n>Compared with circuit simulators, the predictor has over 200X speedup for estimating the fidelity.
  arXiv  Detail & Related papers  (2022-10-30T02:35:31Z)
• Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
  We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages. The computation can then be implemented using a series of non-Pauli measurements on this graph state.
  arXiv  Detail & Related papers  (2022-09-15T14:52:31Z)
• Bosonic field digitization for quantum computers [62.997667081978825]
  We address the representation of lattice bosonic fields in a discretized field amplitude basis. We develop methods to predict error scaling and present efficient qubit implementation strategies.
  arXiv  Detail & Related papers  (2021-08-24T15:30:04Z)
• Properties and Application of Gaussian Quantum Processes [0.0]
  We show that generic coupler characterized by Gaussian unitary process can be transformed into a high-fidelity transducer. We study the quantum noise theory for optical parameter sensing and its potential in providing great measurement precision enhancement. All the analyses originated from the fundamental quantum commutation relations, and therefore are widely applicable.
  arXiv  Detail & Related papers  (2021-07-03T18:01:34Z)
• Efficient construction of tensor-network representations of many-body Gaussian states [59.94347858883343]
  We present a procedure to construct tensor-network representations of many-body Gaussian states efficiently and with a controllable error. These states include the ground and thermal states of bosonic and fermionic quadratic Hamiltonians, which are essential in the study of quantum many-body systems.
  arXiv  Detail & Related papers  (2020-08-12T11:30:23Z)
• Gaussian states of continuous-variable quantum systems provide universal and versatile reservoir computing [0.0]
  We consider reservoir computing, an efficient framework for online time series processing. We find that encoding the input time series into Gaussian states is both a source and a means to tune the nonlinearity of the overall input-output map.
  arXiv  Detail & Related papers  (2020-06-08T18:00:03Z)
• Efficient Quantum Circuits for Accurate State Preparation of Smooth, Differentiable Functions [0.8315657895474382]
  We show that there exist families of quantum states that can be prepared to high precision with circuits of linear size and depth. We further develop an algorithm that requires only linear classical time to generate accurate linear-depth circuits.
  arXiv  Detail & Related papers  (2020-05-09T02:31:44Z)

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.