Simulability of non-classical continuous-variable quantum circuits
- URL: http://arxiv.org/abs/2410.09226v1
- Date: Fri, 11 Oct 2024 20:03:53 GMT
- Title: Simulability of non-classical continuous-variable quantum circuits
- Authors: Massimo Frigerio, Antoine Debray, Nicolas Treps, Mattia Walschaers,
- Abstract summary: 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.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: In continuous-variable quantum computation, identifying key elements that enable a quantum computational advantage is a long-standing issue. Starting from the standard results on the necessity of Wigner negativity, we develop a comprehensive and versatile framework that not only enables the identification of a potential quantum computational advantage, but also allows to pinpoint the contribution of each quantum gate in achieving this objective. As such, it can be straightforwardly applied to current continuous-variables quantum circuits, while also constraining the tolerable amount of losses above which any potential quantum advantage can be ruled out. We use $(s)$-ordered quasiprobability distributions on phase-space to capture the non-classical features in the protocol, and focus our model entirely on the ordering parameter $s$. This allows us to highlight the resourcefulness and robustness to loss of a universal set of unitary gates comprising three distinct Gaussian gates, and a fourth one, the cubic gate, providing important insight on the role of non-Gaussianity.
Related papers
- Universal quantum computation using atoms in cross-cavity systems [0.0]
We theoretically investigate a single-step implementation of both a universal two- (CNOT) and three-qubit (quantum Fredkin) gates in a cross-cavity setup.
Within a high-cooper regime, the system exhibits an atomic-state-dependent $pi$-phase gate involving the two-mode single-photon bright and dark states.
arXiv Detail & Related papers (2023-08-28T20:09:54Z) - Quantum process tomography of continuous-variable gates using coherent
states [49.299443295581064]
We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit.
We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
arXiv Detail & Related papers (2023-03-02T18:08:08Z) - SAT-Based Quantum Circuit Adaptation [0.9784637657097822]
Adapting a quantum circuit from a universal quantum gate set to the quantum gate set of a target hardware modality has a crucial impact on the fidelity and duration of the intended quantum computation.
We develop a satisfiability modulo theories model that determines an optimized quantum circuit adaptation given a set of allowed substitutions and decompositions.
arXiv Detail & Related papers (2023-01-27T14:09:29Z) - Theory of Quantum Generative Learning Models with Maximum Mean
Discrepancy [67.02951777522547]
We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs)
We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution.
Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
arXiv Detail & Related papers (2022-05-10T08:05:59Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z) - Universal quantum computation with symmetric qubit clusters coupled to
an environment [0.3670422696827526]
We propose a scalable scheme for universal quantum computation where cores play the role of quantum-computational transistors, quansistors.
We include quantum errors as a main source of decoherence, and show that symmetry makes logical operations particularly resilient to untimely anisotropic qubit rotations.
Many of our results can be generalized to higher-level omega-rotation-invariant systems, or adapted to clusters with other symmetries.
arXiv Detail & Related papers (2021-06-01T19:59:41Z) - Noncyclic nonadiabatic holonomic quantum gates via shortcuts to
adiabaticity [5.666193021459319]
We propose a fast and robust scheme to construct high-fidelity holonomic quantum gates for universal quantum systems via shortcuts to adiabaticity.
Our scheme is readily realizable in physical system currently pursued for implementation of quantum computation.
arXiv Detail & Related papers (2021-05-28T15:23:24Z) - QUANTIFY: A framework for resource analysis and design verification of
quantum circuits [69.43216268165402]
QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits.
It is based on Google Cirq and is developed with Clifford+T circuits in mind.
For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
arXiv Detail & Related papers (2020-07-21T15:36:25Z) - 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) - 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.