Efficient classical simulation of quantum computation beyond Wigner positivity
- URL: http://arxiv.org/abs/2407.10349v1
- Date: Sun, 14 Jul 2024 22:25:13 GMT
- Title: Efficient classical simulation of quantum computation beyond Wigner positivity
- Authors: Michael Zurel, Arne Heimendahl,
- Abstract summary: We present the generalization of the CNC formalism, based on closed and noncontextual sets of Pauli observables, to the setting of odd-prime-dimensional qudits.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We present the generalization of the CNC formalism, based on closed and noncontextual sets of Pauli observables, to the setting of odd-prime-dimensional qudits. By introducing new CNC-type phase space point operators, we construct a quasiprobability representation for quantum computation which is covariant with respect to the Clifford group and positivity preserving under Pauli measurements, and whose nonnegative sector strictly contains the subtheory of quantum theory described by nonnegative Wigner functions. This allows for a broader class of magic state quantum circuits to be efficiently classically simulated than those covered by the stabilizer formalism and Wigner function methods.
Related papers
- 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 Adjoint Convolutional Layers for Effective Data Representation [21.755109562063282]
This paper lays the foundation for the development of efficient and interpretable quantum convolutional networks.
It also advances the field of quantum machine vision.
arXiv Detail & Related papers (2024-04-26T12:52:45Z) - Locally purified density operators for noisy quantum circuits [17.38734393793605]
We show that mixed states generated from noisy quantum circuits can be efficiently represented by locally purified density operators (LPDOs)
We present a mapping from LPDOs of $N$ qubits to projected entangled-pair states of size $2times N$ and introduce a unified method for managing virtual and Kraus bonds.
arXiv Detail & Related papers (2023-12-05T16:10:30Z) - Limitations of Classically-Simulable Measurements for Quantum State
Discrimination [7.749391145337816]
We investigate the limitations of classically-simulable measurements, specifically POVMs with positive discrete Wigner functions.
Our results reveal similarities and distinctions between the quantum resource theory of magic states and entanglement in quantum state discrimination.
arXiv Detail & Related papers (2023-10-17T15:01:54Z) - Numerical Simulation of Large-Scale Nonlinear Open Quantum Mechanics [0.0]
We introduce a numerical method to simulate nonlinear open quantum dynamics of a particle in situations where its state undergoes significant expansion in phase space.
To demonstrate the capabilities of our method, we examine the open quantum dynamics of a particle evolving in a one-dimensional weak quartic potential after initially being ground-state cooled in a tight harmonic potential.
arXiv Detail & Related papers (2023-06-15T12:26:35Z) - Universality of critical dynamics with finite entanglement [68.8204255655161]
We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement.
Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
arXiv Detail & Related papers (2023-01-23T19:23:54Z) - Efficient classical computation of expectation values in a class of
quantum circuits with an epistemically restricted phase space representation [0.0]
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.
arXiv Detail & Related papers (2021-06-21T06:43:34Z) - Error mitigation and quantum-assisted simulation in the error corrected
regime [77.34726150561087]
A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations.
We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
arXiv Detail & Related papers (2021-03-12T20:58:41Z) - Quantum Simulation of Light-Front Parton Correlators [0.0]
The physics of high-energy colliders relies on the knowledge of non-perturbative parton correlators.
We propose a quantum algorithm to perform a quantum simulation of these type of correlators.
arXiv Detail & Related papers (2020-11-02T19:38:33Z) - Efficient simulatability of continuous-variable circuits with large
Wigner negativity [62.997667081978825]
Wigner negativity is known to be a necessary resource for computational advantage in several quantum-computing architectures.
We identify vast families of circuits that display large, possibly unbounded, Wigner negativity, and yet are classically efficiently simulatable.
We derive our results by establishing a link between the simulatability of high-dimensional discrete-variable quantum circuits and bosonic codes.
arXiv Detail & Related papers (2020-05-25T11:03:42Z) - Using Quantum Metrological Bounds in Quantum Error Correction: A Simple
Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates.
Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
arXiv Detail & Related papers (2020-04-24T17:58:10Z)
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.