Efficient classical computation of expectation values in a class of quantum circuits with an epistemically restricted phase space representation

• URL: http://arxiv.org/abs/2106.10881v1
• Date: Mon, 21 Jun 2021 06:43:34 GMT
• Title: Efficient classical computation of expectation values in a class of quantum circuits with an epistemically restricted phase space representation
• Authors: Agung Budiyono and Hermawan K. Dipojono
• Abstract summary: We devise a classical algorithm which efficiently computes the quantum expectation values arising in a class of continuous variable quantum circuits. The classical computational algorithm exploits a specific restriction in classical phase space which directly captures the quantum uncertainty relation.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We devise a classical algorithm which efficiently computes the quantum expectation values arising in a class of continuous variable quantum circuits wherein the final quantum observable | after the Heisenberg evolution associated with the circuits | is at most second order in momentum. The classical computational algorithm exploits a specific epistemic restriction in classical phase space which directly captures the quantum uncertainty relation, to transform the quantum circuits in the complex Hilbert space into classical albeit unconventional stochastic processes in the phase space. The resulting multidimensional integral is then evaluated using the Monte Carlo sampling method. The work shows that for the specific class of computational schemes, Wigner negativity is not a sufficient resource for quantum speedup. It highlights the potential role of the epistemic restriction as an intuitive conceptual tool which may be used to study the boundary between quantum and classical computations.

Related papers

• Evaluation of phase shifts for non-relativistic elastic scattering using quantum computers [39.58317527488534]
  This work reports the development of an algorithm that makes it possible to obtain phase shifts for generic non-relativistic elastic scattering processes on a quantum computer.
  arXiv  Detail & Related papers  (2024-07-04T21:11:05Z)
• Phase-space negativity as a computational resource for quantum kernel methods [2.5499055723658097]
  Quantum kernel methods are a proposal for achieving quantum computational advantage in machine learning. We provide sufficient conditions for the efficient classical estimation of quantum kernel functions for bosonic systems. Our results underpin the role of the negativity in phase-space-probability distributions as an essential resource in quantum machine learning.
  arXiv  Detail & Related papers  (2024-05-20T21:18:53Z)
• 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)
• The Quantum Path Kernel: a Generalized Quantum Neural Tangent Kernel for Deep Quantum Machine Learning [52.77024349608834]
  Building a quantum analog of classical deep neural networks represents a fundamental challenge in quantum computing. Key issue is how to address the inherent non-linearity of classical deep learning. We introduce the Quantum Path Kernel, a formulation of quantum machine learning capable of replicating those aspects of deep machine learning.
  arXiv  Detail & Related papers  (2022-12-22T16:06:24Z)
• Quantum advantage in temporally flat measurement-based quantum computation [0.0]
  We study the efficiency of measurement-based quantum computation with a completely flat temporal ordering of measurements. We identify a family of Boolean functions for which deterministic evaluation using non-adaptive MBQC is possible.
  arXiv  Detail & Related papers  (2022-12-07T14:34:56Z)
• Self-protected quantum simulation and quantum phase estimation in the presence of classical noise [0.0]
  We propose self-protected quantum simulations immune to a large class of classical noise. For readout we generalize the conventional quantum phase estimation to its upgraded version in the presence of classical noise.
  arXiv  Detail & Related papers  (2022-12-07T14:30:47Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Fundamental limitations on optimization in variational quantum algorithms [7.165356904023871]
  A leading paradigm to establish such near-term quantum applications is variational quantum algorithms (VQAs) We prove that for a broad class of such random circuits, the variation range of the cost function vanishes exponentially in the number of qubits with a high probability. This result can unify the restrictions on gradient-based and gradient-free optimizations in a natural manner and reveal extra harsh constraints on the training landscapes of VQAs.
  arXiv  Detail & Related papers  (2022-05-10T17:14:57Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Classical and statistical limits of the quantum singular oscillator [0.0]
  Weyl-Wigner phase-space and Bohmian mechanics frameworks are used. Two inequivalent quantum systems are shown to be statistically equivalent at thermal equilibrium.
  arXiv  Detail & Related papers  (2020-07-10T19:07:33Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)

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.