Efficient learning of bosonic Gaussian unitaries

• URL: http://arxiv.org/abs/2510.05531v1
• Date: Tue, 07 Oct 2025 02:42:40 GMT
• Title: Efficient learning of bosonic Gaussian unitaries
• Authors: Marco Fanizza, Vishnu Iyer, Junseo Lee, Antonio A. Mele, Francesco A. Mele,
• Abstract summary: We present the first time-efficient for learning bosonic Gaussian unitaries with a rigorous analysis.<n>Our algorithm produces an estimate of the unknown unitary that is accurate to small worst-case error.
• Score: 3.1022255067547877
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Bosonic Gaussian unitaries are fundamental building blocks of central continuous-variable quantum technologies such as quantum-optic interferometry and bosonic error-correction schemes. In this work, we present the first time-efficient algorithm for learning bosonic Gaussian unitaries with a rigorous analysis. Our algorithm produces an estimate of the unknown unitary that is accurate to small worst-case error, measured by the physically motivated energy-constrained diamond distance. Its runtime and query complexity scale polynomially with the number of modes, the inverse target accuracy, and natural energy parameters quantifying the allowed input energy and the unitary's output-energy growth. The protocol uses only experimentally friendly photonic resources: coherent and squeezed probes, passive linear optics, and heterodyne/homodyne detection. We then employ an efficient classical post-processing routine that leverages a symplectic regularization step to project matrix estimates onto the symplectic group. In the limit of unbounded input energy, our procedure attains arbitrarily high precision using only $2m+2$ queries, where $m$ is the number of modes. To our knowledge, this is the first provably efficient learning algorithm for a multiparameter family of continuous-variable unitaries.

Related papers

• Classical algorithms for measurement-adaptive Gaussian circuits [0.1909808926064466]
  We study the quantum mean-value problem, estimating observable expectation values that underpin simulation and variational algorithms.<n>We analyze bosonic circuits with adaptivity and prove that when the number of adaptive measurements is small, the mean-value problem admits efficient classical algorithms.
  arXiv  Detail & Related papers  (2025-08-31T08:39:58Z)
• Energy-independent tomography of Gaussian states [0.29998889086656577]
  We present an efficient and experimentally feasible Gaussian state tomography algorithm with provable recovery trace-distance guarantees.<n>Our algorithm is particularly well-suited for applications in quantum metrology and sensing.
  arXiv  Detail & Related papers  (2025-08-20T18:03:33Z)
• Efficient Hamiltonian, structure and trace distance learning of Gaussian states [2.949446809950691]
  We study the quantum generalization of the widely studied problem of learning Gaussian graphical models.<n>We obtain efficient protocols for the task of inferring parameters of their underlying quadratic Hamiltonian.<n>We show that it is possible to learn the underlying interaction graph in a similar setting and sample complexity.
  arXiv  Detail & Related papers  (2024-11-05T15:07:20Z)
• High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization [0.8341988468339112]
  Resource-efficient and high-precision approximate synthesis of quantum circuits expressed in the Clifford+T gate set is vital for Fault-Tolerant quantum computing.<n>We leverage search-based methods to first approximately diagonalize a unitary, then perform the inversion analytically.<n>Our approach improves both the implementation precision and run time of synthesis algorithms by orders of magnitude when evaluated on unitaries from real quantum algorithms.
  arXiv  Detail & Related papers  (2024-08-31T12:10:32Z)
• Neural Pfaffians: Solving Many Many-Electron Schrödinger Equations [58.130170155147205]
  Neural wave functions accomplished unprecedented accuracies in approximating the ground state of many-electron systems, though at a high computational cost. Recent works proposed amortizing the cost by learning generalized wave functions across different structures and compounds instead of solving each problem independently. This work tackles the problem by defining overparametrized, fully learnable neural wave functions suitable for generalization across molecules.
  arXiv  Detail & Related papers  (2024-05-23T16:30:51Z)
• Efficient Quantum Circuits for Non-Unitary and Unitary Diagonal Operators with Space-Time-Accuracy trade-offs [1.0749601922718608]
  Unitary and non-unitary diagonal operators are fundamental building blocks in quantum algorithms.<n>We introduce a general approach to implement unitary and non-unitary diagonal operators with efficient-adjustable-depth quantum circuits.
  arXiv  Detail & Related papers  (2024-04-03T15:42:25Z)
• Solving the Lipkin model using quantum computers with two qubits only with a hybrid quantum-classical technique based on the Generator Coordinate Method [0.0]
  We discuss the possibility of using the generator coordinate method (GCM) using hybrid quantum-classical algorithms with reduced quantum resources. We show that, ultimately, only two qubits is enough to solve the problem regardless of the particle number. As an alternative to this technique, we also explored how the quantum state deflation method can be adapted to the GCM problem.
  arXiv  Detail & Related papers  (2023-12-07T21:18:27Z)
• Exploring the role of parameters in variational quantum algorithms [59.20947681019466]
  We introduce a quantum-control-inspired method for the characterization of variational quantum circuits using the rank of the dynamical Lie algebra. A promising connection is found between the Lie rank, the accuracy of calculated energies, and the requisite depth to attain target states via a given circuit architecture.
  arXiv  Detail & Related papers  (2022-09-28T20:24:53Z)
• Automatic and effective discovery of quantum kernels [41.61572387137452]
  Quantum computing can empower machine learning models by enabling kernel machines to leverage quantum kernels for representing similarity measures between data.<n>We present an approach to this problem, which employs optimization techniques, similar to those used in neural architecture search and AutoML.<n>The results obtained by testing our approach on a high-energy physics problem demonstrate that, in the best-case scenario, we can either match or improve testing accuracy with respect to the manual design approach.
  arXiv  Detail & Related papers  (2022-09-22T16:42:14Z)
• Quantum Goemans-Williamson Algorithm with the Hadamard Test and Approximate Amplitude Constraints [62.72309460291971]
  We introduce a variational quantum algorithm for Goemans-Williamson algorithm that uses only $n+1$ qubits. Efficient optimization is achieved by encoding the objective matrix as a properly parameterized unitary conditioned on an auxilary qubit. We demonstrate the effectiveness of our protocol by devising an efficient quantum implementation of the Goemans-Williamson algorithm for various NP-hard problems.
  arXiv  Detail & Related papers  (2022-06-30T03:15:23Z)
• 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)
• Efficient and robust certification of genuine multipartite entanglement in noisy quantum error correction circuits [58.720142291102135]
  We introduce a conditional witnessing technique to certify genuine multipartite entanglement (GME) We prove that the detection of entanglement in a linear number of bipartitions by a number of measurements scales linearly, suffices to certify GME. We apply our method to the noisy readout of stabilizer operators of the distance-three topological color code and its flag-based fault-tolerant version.
  arXiv  Detail & Related papers  (2020-10-06T18:00:07Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)

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.