Bargmann representation of quantum absorption refrigerators

• URL: http://arxiv.org/abs/2105.02581v7
• Date: Wed, 28 Dec 2022 18:15:39 GMT
• Title: Bargmann representation of quantum absorption refrigerators
• Authors: M. W. AlMasri, M. R. B. Wahiddin
• Abstract summary: We solve the quantum absorption refrigerator analytically in the space of holomorphic functions with Gaussian measure. Our approach simplifies the calculations since for a given quantum system the coordinate representation of any quantum state is always more complicated than its corresponding expression.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: In this work, we solve the quantum absorption refrigerator analytically in the space of holomorphic functions with Gaussian measure . Our approach simplifies the calculations since for a given quantum system the coordinate representation of any quantum state is always more complicated than its corresponding expression written with respect to the phase-space coordinate $z_{i}$. We finally discuss the computational complexity of the holomorphic representation and compare it with the computational complexity of the standard operator method and prove the efficiency of the holomorphic representation in computing some tasks. Our treatment is applicable to all quantum heat engines and refrigerators.

Related papers

• Quantum Rational Transformation Using Linear Combinations of Hamiltonian Simulations [0.0]
  We introduce effective implementations of rational transformations of a target operator on quantum hardware. We show that rational transformations can be performed efficiently with Hamiltonian simulations using a linear-combination-of-unitaries (LCU)
  arXiv  Detail & Related papers  (2024-08-14T18:00:01Z)
• Solving reaction dynamics with quantum computing algorithms [42.408991654684876]
  We study quantum algorithms for response functions, relevant for describing different reactions governed by linear response. We focus on nuclear-physics applications and consider a qubit-efficient mapping on the lattice, which can efficiently represent the large volumes required for realistic scattering simulations.
  arXiv  Detail & Related papers  (2024-03-30T00:21:46Z)
• Calculating the many-body density of states on a digital quantum computer [58.720142291102135]
  We implement a quantum algorithm to perform an estimation of the density of states on a digital quantum computer. We use our algorithm to estimate the density of states of a non-integrable Hamiltonian on the Quantinuum H1-1 trapped ion chip for a controlled register of 18bits.
  arXiv  Detail & Related papers  (2023-03-23T17:46:28Z)
• The vacuum provides quantum advantage to otherwise simulatable architectures [49.1574468325115]
  We consider a computational model composed of ideal Gottesman-Kitaev-Preskill stabilizer states. We provide an algorithm to calculate the probability density function of the measurement outcomes.
  arXiv  Detail & Related papers  (2022-05-19T18:03:17Z)
• Orders of magnitude reduction in the computational overhead for quantum many-body problems on quantum computers via an exact transcorrelated method [0.0]
  We show that the Hamiltonian becomes non-Hermitian, posing problems for quantum algorithms based on the variational principle. We overcome these limitations with the ansatz-based quantum imaginary time evolution algorithm. Our work paves the way for the use of exact transcorrelated methods for the simulations of ab initio systems on quantum computers.
  arXiv  Detail & Related papers  (2022-01-09T16:37:32Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Holomorphic representation of quantum computations [0.0]
  We study bosonic quantum computations using the Segal-Bargmann representation of quantum states. We argue that this holomorphic representation is a natural one which gives a canonical description of bosonic quantum computing.
  arXiv  Detail & Related papers  (2021-10-29T23:26:51Z)
• Detailed Account of Complexity for Implementation of Some Gate-Based Quantum Algorithms [55.41644538483948]
  In particular, some steps of the implementation, as state preparation and readout processes, can surpass the complexity aspects of the algorithm itself. We present the complexity involved in the full implementation of quantum algorithms for solving linear systems of equations and linear system of differential equations.
  arXiv  Detail & Related papers  (2021-06-23T16:33:33Z)
• Facial Expression Recognition on a Quantum Computer [68.8204255655161]
  We show a possible solution to facial expression recognition using a quantum machine learning approach. We define a quantum circuit that manipulates the graphs adjacency matrices encoded into the amplitudes of some appropriately defined quantum states.
  arXiv  Detail & Related papers  (2021-02-09T13:48:00Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• Deformation quantization and the tomographic representation of quantum fields [0.0]
  The tomographic representation of quantum fields within the deformation quantization formalism is constructed. Some possible applications of the formalism to loop quantum cosmology and loop quantum gravity are briefly discussed.
  arXiv  Detail & Related papers  (2020-06-13T17:43:02Z)
• On the elementary information content of thermodynamic ensembles [0.0]
  We extend the definition of phase-space (Wigner) quantum projectors to thermodynamic ensembles. The tools here introduced extend the role of the partition function in expressing the quantum behavior of thermodynamic ensembles.
  arXiv  Detail & Related papers  (2020-05-28T22:58:18Z)
• Quantum computation of thermal averages in the presence of a sign problem [45.82374977939355]
  We illustrate the application of Quantum Computing techniques to the investigation of the thermodynamical properties of a simple system. We show how quantum algorithms completely solve the problem, and discuss how this can apply to more complex systems of physical interest.
  arXiv  Detail & Related papers  (2020-01-15T14:01:11Z)

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.