Efficient simulatability of continuous-variable circuits with large Wigner negativity

• URL: http://arxiv.org/abs/2005.12026v2
• Date: Mon, 22 Mar 2021 12:57:39 GMT
• Title: Efficient simulatability of continuous-variable circuits with large Wigner negativity
• Authors: Laura Garc\'ia-\'Alvarez, Cameron Calcluth, Alessandro Ferraro, Giulia Ferrini
• Abstract summary: 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.
• Score: 62.997667081978825
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Discriminating between quantum computing architectures that can provide quantum advantage from those that cannot is of crucial importance. From the fundamental point of view, establishing such a boundary is akin to pinpointing the resources for quantum advantage; from the technological point of view, it is essential for the design of non-trivial quantum computing architectures. Wigner negativity is known to be a necessary resource for computational advantage in several quantum-computing architectures, including those based on continuous variables (CVs). However, it is not a sufficient resource, and it is an open question under which conditions CV circuits displaying Wigner negativity offer the potential for quantum advantage. In this work we identify vast families of circuits that display large, possibly unbounded, Wigner negativity, and yet are classically efficiently simulatable, although they are not recognized as such by previously available theorems. These families of circuits employ bosonic codes based on either translational or rotational symmetries (e.g., Gottesman-Kitaev-Preskill or cat codes), and can include both Gaussian and non-Gaussian gates and measurements. Crucially, within these encodings, the computational basis states are described by intrinsically negative Wigner functions, even though they are stabilizer states if considered as codewords belonging to a finite-dimensional Hilbert space. We derive our results by establishing a link between the simulatability of high-dimensional discrete-variable quantum circuits and bosonic codes.

Related papers

• Simulability of non-classical continuous-variable quantum circuits [0.0]
  In continuous-variable quantum computation, identifying key elements that enable a quantum computational advantage is a long-standing issue. We develop a comprehensive and versatile framework that enables the identification of a potential quantum computational advantage. It can be straightforwardly applied to current continuous-variables quantum circuits, while also constraining the amount of losses above which any potential quantum advantage can be ruled out.
  arXiv  Detail & Related papers  (2024-10-11T20:03:53Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Identifying quantum resources in encoded computations [0.6144680854063939]
  We introduce a general framework which allows us to correctly identify quantum resources in encoded computations. We illustrate our general construction with the Gottesman--Kitaev--Preskill encoding of qudits with odd dimension. The resulting Wigner function, which we call the Zak-Gross Wigner function, is shown to correctly identify quantum resources through its phase-space negativity.
  arXiv  Detail & Related papers  (2024-07-25T21:01:18Z)
• 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 quasi-probability distributions as an essential resource in quantum machine learning.
  arXiv  Detail & Related papers  (2024-05-20T21:18:53Z)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application. We analyse the generation of random states in PQCs under restrictions on the qubits connectivities. We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• Sufficient condition for universal quantum computation using bosonic circuits [44.99833362998488]
  We focus on promoting circuits that are otherwise simulatable to computational universality. We first introduce a general framework for mapping a continuous-variable state into a qubit state. We then cast existing maps into this framework, including the modular and stabilizer subsystem decompositions.
  arXiv  Detail & Related papers  (2023-09-14T16:15:14Z)
• Minimizing the negativity of quantum circuits in overcomplete quasiprobability representations [0.6428333375712125]
  We develop an approach for minimizing the total negativity of a given quantum circuit with respect to quasiprobability representations, that are overcomplete. Our approach includes both optimization over equivalent quasistochastic vectors and matrices, which appear due to the overcompleteness. We also study the negativity minimization of noisy brick-wall random circuits via a combination of increasing frame dimension and applying gate merging technique.
  arXiv  Detail & Related papers  (2023-06-19T08:02:00Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• A Hybrid Quantum-Classical Algorithm for Robust Fitting [47.42391857319388]
  We propose a hybrid quantum-classical algorithm for robust fitting. Our core contribution is a novel robust fitting formulation that solves a sequence of integer programs. We present results obtained using an actual quantum computer.
  arXiv  Detail & Related papers  (2022-01-25T05:59:24Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)

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.