Learning Gaussian optical states with quantum computers

• URL: http://arxiv.org/abs/2605.05325v1
• Date: Wed, 06 May 2026 18:01:04 GMT
• Title: Learning Gaussian optical states with quantum computers
• Abstract summary: Recent results have established dramatic advantages in learning properties of quantum states when a quantum computer is available.<n>These results motivate the application of quantum computers to imaging and sensing of weak electromagnetic fields.
• Score: 1.2366208723499548
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recent results have established dramatic advantages in learning properties of quantum states when a quantum computer is available to process or jointly measure multiple copies of the unknown quantum state. Learning tasks can be accomplished with exponentially fewer copies of the state when compared to optimized classical learning strategies that are restricted to measuring one copy of the state at a time. While these results were established in abstract settings and for artificial learning tasks, they motivate the application of quantum computers to imaging and sensing of weak electromagnetic fields since these settings are ultimately concerned with the learning of unknown quantum states. In this work we apply these new results in quantum learning to the problem of learning Gaussian states of the electromagnetic field, which are germane since they describe most fields used in imaging and sensing. In order to connect with quantum learning theory, we consider the transduction of an $n$-mode Gaussian state into a register of qubits on a quantum computer followed by optimized measurements on these qubits to extract the parameters defining the original Gaussian state. We rigorously bound the number of copies of the Gaussian state required to achieve worst-case additive error in parameter estimates. The scaling of this bound with $n$ is exponentially better than naïve strategies for characterizing Gaussian states and matches recently derived bounds for characterization of Gaussian states using continuous-variable (CV) classical shadows. In addition, our bound has a polynomially better dependence on the energy of the multimode Gaussian state compared to the CV shadows protocol.

Related papers

• Optimal tomography of bosonic and fermionic Gaussian states [9.874317705613292]
  We show that both bosonic and fermionic Gaussian states can be learned using a number of copies that scales quadratically in the number of modes.<n>We derive these results by using the representation theory of Gaussian unitaries and by putting forth a generalization of the random purification channel to this setting and beyond.
  arXiv  Detail & Related papers  (2026-07-13T17:37:46Z)
• Automatic De-Quantization of Quantum Programs Using Constant Propagation [42.89658025409898]
  Every quantum operation is costly, making it crucial to minimize quantum resource usage in near-term algorithms.<n>In this work, we focus on de-quantizing quantum operations to classical computation whenever possible.<n>We formalize a hybrid state model for quantum-classical constant propagation, implement our optimizations in the open-source MQT Core tool, and evaluate them on benchmark circuits.
  arXiv  Detail & Related papers  (2026-05-21T19:21:11Z)
• Is it Gaussian? Testing bosonic quantum states [1.7340190329759613]
  We show that a constant number of copies is sufficient to decide whether a state is exactly Gaussian.<n>We also establish that testing Gaussianity of general mixed states necessarily requires exponentially many copies.<n>Our approach relies on rotation-invariant symmetries of Gaussian states together with the recently introduced toolbox of CV trace-distance bounds.
  arXiv  Detail & Related papers  (2025-10-08T17:56:34Z)
• Efficient Gaussian State Preparation in Quantum Circuits [4.930778301847907]
  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.
  arXiv  Detail & Related papers  (2025-07-27T15:15:20Z)
• Correlating noise floor with magic and entanglement in Pauli product states [37.69303106863453]
  We show the ability to recover resources specific to quantum computing from noisy states generated by Pauli product formulas.<n>The fidelity of purified states represents the noise floor of a given computation.<n>We experimentally validate these findings by collecting classical shadow data for a range of small circuits.
  arXiv  Detail & Related papers  (2025-05-07T19:24:00Z)
• Exponential learning advantages with conjugate states and minimal quantum memory [0.0]
  We investigate a new learning resource which could be available to quantum computers in the future. For a certain shadow tomography task, we find that measurements on only copies of $rho otimes rhoast$ can be exponentially more powerful than measurements on $rhootimes K$. We believe the advantage may find applications in improving quantum simulation, learning from quantum sensors, and uncovering new physical phenomena.
  arXiv  Detail & Related papers  (2024-03-06T05:04:45Z)
• Hybrid quantum transfer learning for crack image classification on NISQ hardware [62.997667081978825]
  We present an application of quantum transfer learning for detecting cracks in gray value images. We compare the performance and training time of PennyLane's standard qubits with IBM's qasm_simulator and real backends.
  arXiv  Detail & Related papers  (2023-07-31T14:45:29Z)
• Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
  We explore the applicability of quantum-data learning to practical problems in high-energy physics. We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states. The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
  arXiv  Detail & Related papers  (2023-06-29T18:00:01Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• QuGIT: a numerical toolbox for Gaussian quantum states [0.0]
  QuGIT is a python numerical toolbox based on symplectic methods specialized in efficiently simulating multimode Gaussian states and operations. It provides a wide range of Gaussian operations on arbitrary Gaussian states, including unitaries, partial traces, tensor products, general-dyne measurements, conditional and unconditional dynamics.
  arXiv  Detail & Related papers  (2022-01-17T11:58:14Z)
• Quantum Non-Gaussianity From An Indefinite Causal Order of Gaussian Operations [0.0]
  Quantum Non-Gaussian states are considered as a useful resource for many tasks in quantum information processing. We are addressing to be very useful to engineer highly non-Gaussian states from operations whose order is controlled by degrees of freedom of a control qubit.
  arXiv  Detail & Related papers  (2021-08-30T09:20:17Z)
• 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)
• Quantum Gram-Schmidt Processes and Their Application to Efficient State Read-out for Quantum Algorithms [87.04438831673063]
  We present an efficient read-out protocol that yields the classical vector form of the generated state. Our protocol suits the case that the output state lies in the row space of the input matrix. One of our technical tools is an efficient quantum algorithm for performing the Gram-Schmidt orthonormal procedure.
  arXiv  Detail & Related papers  (2020-04-14T11:05:26Z)

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.