Cubic phase gates are not suitable for non-Clifford operations on GKP
states
- URL: http://arxiv.org/abs/2009.05309v2
- Date: Tue, 15 Sep 2020 13:36:08 GMT
- Title: Cubic phase gates are not suitable for non-Clifford operations on GKP
states
- Authors: Jacob Hastrup, Mikkel V. Larsen, Jonas S. Neergaard-Nielsen, Nicolas
C. Menicucci and Ulrik L. Andersen
- Abstract summary: With the Gottesman-Kitaev-Preskill (GKP) encoding, Clifford gates and error correction can be carried out using simple Gaussian operations.
In their original proposal, GKP suggested a particularly simple method of using a single application of the cubic phase gate to perform the logical non-Clifford T-gate.
Here we show that this cubic phase gate approach performs extraordinarily poorly, even for arbitrarily large amounts of squeezing in the GKP state.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: With the Gottesman-Kitaev-Preskill (GKP) encoding, Clifford gates and error
correction can be carried out using simple Gaussian operations. Still,
non-Clifford gates, required for universality, require non-Gaussian elements.
In their original proposal, GKP suggested a particularly simple method of using
a single application of the cubic phase gate to perform the logical
non-Clifford T-gate. Here we show that this cubic phase gate approach performs
extraordinarily poorly, even for arbitrarily large amounts of squeezing in the
GKP state. Thus, contrary to common belief, the cubic phase gate is not
suitable for achieving universal fault-tolerant quantum computation with GKP
states.
Related papers
- Fiber Bundle Fault Tolerance of GKP Codes [0.0]
We investigate multi-mode GKP quantum error-correcting codes from a geometric perspective.
First, we construct their moduli space as a quotient of groups and exhibit it as a fiber bundle over the moduli space of symplectically integral lattices.
We then establish the Gottesman--Zhang conjecture for logical GKP Clifford operations, showing that all such gates arise from parallel transport with respect to a flat connection on this space.
arXiv Detail & Related papers (2024-10-09T18:00:07Z) - Logical Gates and Read-Out of Superconducting Gottesman-Kitaev-Preskill Qubits [0.0]
In superconducting circuits, all the required two-qubit gates can be implemented with a single piece of hardware.
We analyze the error-spreading properties of GKP Clifford gates and describe how a modification in the decoder can reduce the gate infidelity by multiple orders of magnitude.
arXiv Detail & Related papers (2024-03-04T19:00:04Z) - 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) - Transversal Injection: A method for direct encoding of ancilla states
for non-Clifford gates using stabiliser codes [55.90903601048249]
We introduce a protocol to potentially reduce this overhead for non-Clifford gates.
Preliminary results hint at high quality fidelities at larger distances.
arXiv Detail & Related papers (2022-11-18T06:03:10Z) - Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete.
We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes.
Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
arXiv Detail & Related papers (2021-08-10T15:00:20Z) - Composably secure data processing for Gaussian-modulated continuous
variable quantum key distribution [58.720142291102135]
Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties.
We consider a protocol with homodyne detection in the general setting of composable finite-size security.
In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
arXiv Detail & Related papers (2021-03-30T18:02:55Z) - Non-Clifford gate on optical qubits by nonlinear feedforward [0.8126281861908967]
We show that we can achieve linear optical implementation of non-Clifford operations on GKP qubits with high fidelity.
Our work shows the versatility of nonlinear feedforward technique important for optical implementation of the fault-tolerant continuous-variable quantum computation.
arXiv Detail & Related papers (2021-03-19T05:53:06Z) - Low overhead fault-tolerant quantum error correction with the
surface-GKP code [60.44022726730614]
We propose a highly effective use of the surface-GKP code, i.e., the surface code consisting of bosonic GKP qubits instead of bare two-dimensional qubits.
We show that a low logical failure rate $p_L 10-7$ can be achieved with moderate hardware requirements.
arXiv Detail & Related papers (2021-03-11T23:07:52Z) - Error mitigation for universal gates on encoded qubits [5.774786149181392]
We show how to implement Clifford+T circuits with a number of T-gates inversely proportional to the physical noise rate.
We argue that such circuits can be out of reach for state-of-the-art classical simulation algorithms.
arXiv Detail & Related papers (2021-03-08T17:27:04Z) - Gaussian conversion protocols for cubic phase state generation [104.23865519192793]
Universal quantum computing with continuous variables requires non-Gaussian resources.
The cubic phase state is a non-Gaussian state whose experimental implementation has so far remained elusive.
We introduce two protocols that allow for the conversion of a non-Gaussian state to a cubic phase state.
arXiv Detail & Related papers (2020-07-07T09:19:49Z)
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.