Can effective descriptions of bosonic systems be considered complete?

• URL: http://arxiv.org/abs/2501.13857v1
• Date: Thu, 23 Jan 2025 17:27:54 GMT
• Title: Can effective descriptions of bosonic systems be considered complete?
• Authors: Francesco Arzani, Robert I. Booth, Ulysse Chabaud,
• Abstract summary: We show that descriptions of bosonic Hamiltonians do in fact capture the relevant physics of bosonic systems. Our results have implications for classical and quantum simulations of bosonic systems.
• Score: 0.0
• License:
• Abstract: Bosonic statistics give rise to remarkable phenomena, from the Hong-Ou-Mandel effect to Bose-Einstein condensation, with applications spanning fundamental science to quantum technologies. Modeling bosonic systems relies heavily on effective descriptions: typical examples include truncating their infinite-dimensional state space and restricting their dynamics to a simple class of Hamiltonians, such as polynomials of canonical operators, which are used to define quantum computing over bosonic modes. However, many natural bosonic Hamiltonians do not belong to this simple class, and some quantum effects harnessed by bosonic computers inherently require infinite-dimensional spaces, questioning the validity of such effective descriptions of bosonic systems. How can we trust results obtained with such simplifying assumptions to capture real effects? Driven by the increasing importance of bosonic systems for quantum technologies, we solve this outstanding problem by showing that these effective descriptions do in fact capture the relevant physics of bosonic systems. Our technical contribution is twofold: firstly, we prove that any physical, bosonic unitary evolution can be strongly approximated by a finite-dimensional unitary evolution; secondly, we show that any finite-dimensional unitary evolution can be generated exactly by a bosonic Hamiltonian that is a polynomial of canonical operators. Beyond their fundamental significance, our results have implications for classical and quantum simulations of bosonic systems, they provide universal methods for engineering bosonic quantum states and Hamiltonians, they show that polynomial Hamiltonians do generate universal gate sets for quantum computing over bosonic modes, and they lead to an infinite-dimensional Solovay--Kitaev theorem.

Related papers

• The multimode conditional quantum Entropy Power Inequality and the squashed entanglement of the extreme multimode bosonic Gaussian channels [53.253900735220796]
  Inequality determines the minimum conditional von Neumann entropy of the output of the most general linear mixing of bosonic quantum modes. Bosonic quantum systems constitute the mathematical model for the electromagnetic radiation in the quantum regime.
  arXiv  Detail & Related papers  (2024-10-18T13:59:50Z)
• Efficient Quantum Pseudorandomness from Hamiltonian Phase States [41.94295877935867]
  We introduce a quantum hardness assumption called the Hamiltonian Phase State (HPS) problem. We show that our assumption is plausibly fully quantum; meaning, it cannot be used to construct one-way functions. We show that our assumption and its variants allow us to efficiently construct many pseudorandom quantum primitives.
  arXiv  Detail & Related papers  (2024-10-10T16:10:10Z)
• Quantum dynamics of a fully-blockaded Rydberg atom ensemble [0.0]
  We study an ensemble of strongly interacting atoms with permutation symmetry. We apply this formalism to derive efficient pulse sequences to prepare arbitrary permutation-invariant quantum states. Our results create new opportunities for the experimental and theoretical study of large interacting and nonintegrable quantum systems.
  arXiv  Detail & Related papers  (2023-11-30T15:15:46Z)
• Shaping photons: quantum computation with bosonic cQED [41.94295877935867]
  We discuss the progress, challenges, and future directions in building a bosonic cQED quantum computer. We conclude with our views of the key challenges that lie on the horizon, as well as scientific and cultural strategies for overcoming them.
  arXiv  Detail & Related papers  (2023-11-07T09:59:57Z)
• Quantum Simulation of Boson-Related Hamiltonians: Techniques, Effective Hamiltonian Construction, and Error Analysis [6.8063130539569]
  We discuss the incorporation of bosonic degrees of freedom into optimized fermion algorithms for near-future quantum simulations. troublesome factors such as the magnitude of the bosonic degrees of freedom typically complicate the direct quantum simulation of these interacting models. This strategy should specifically include a suitable fermion/boson-to-qubit mapping scheme to encode sufficiently large yet manageable bosonic modes.
  arXiv  Detail & Related papers  (2023-07-13T06:46:25Z)
• 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)
• Coarse-grained effective Hamiltonian via the Magnus Expansion for a three-level system [0.0]
  We use the Magnus expansion as a systematic tool to derive ambiguity-free effective Hamiltonians. We validate the accuracy of the obtained effective Hamiltonians with suitably tailored fidelities of quantum operations.
  arXiv  Detail & Related papers  (2022-12-16T14:41:10Z)
• Revealing the finite-frequency response of a bosonic quantum impurity [0.15729203067736902]
  Quantum impurities are ubiquitous in condensed matter physics and constitute the most stripped-down realization of many-body problems. We build a quantum simulator of the boundary sine-Gordon model, a non-trivial bosonic impurity problem. This work opens exciting perspectives for the future such as quantifying quantum entanglement in the vicinity of a quantum critical point.
  arXiv  Detail & Related papers  (2022-08-05T09:13:33Z)
• Noisy Quantum Kernel Machines [58.09028887465797]
  An emerging class of quantum learning machines is that based on the paradigm of quantum kernels. We study how dissipation and decoherence affect their performance. We show that decoherence and dissipation can be seen as an implicit regularization for the quantum kernel machines.
  arXiv  Detail & Related papers  (2022-04-26T09:52:02Z)
• Fast-forwarding quantum evolution [0.2621730497733946]
  We show that certain quantum systems can be simulated with gate complexity that is sublinear in the evolution time. We provide a definition of fast-forwarding that considers the model of quantum computation, the Hamiltonians that induce the evolution, and the properties of the initial states.
  arXiv  Detail & Related papers  (2021-05-15T22:41:28Z)
• The Hintons in your Neural Network: a Quantum Field Theory View of Deep Learning [84.33745072274942]
  We show how to represent linear and non-linear layers as unitary quantum gates, and interpret the fundamental excitations of the quantum model as particles. On top of opening a new perspective and techniques for studying neural networks, the quantum formulation is well suited for optical quantum computing.
  arXiv  Detail & Related papers  (2021-03-08T17:24:29Z)

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.