Optimally robust shortcuts to population inversion in cat-state qubits
- URL: http://arxiv.org/abs/2408.00464v1
- Date: Thu, 1 Aug 2024 11:08:39 GMT
- Title: Optimally robust shortcuts to population inversion in cat-state qubits
- Authors: Shao-Wei Xu, Zhong-Zheng Zhang, Yue-Ying Guo, Ye-Hong Chen, Yan Xia,
- Abstract summary: Cat-state qubits have a biased noise channel that the bit-flip error dominates over all the other errors.
We propose an optimally robust protocol using the control method of shortcuts to adiabaticity to realize a nearly perfect population inversion in a cat-state qubit.
- Score: 2.676650600233442
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Cat-state qubits formed by photonic coherent states are a promising candidate for realizing fault-tolerant quantum computing. Such logic qubits have a biased noise channel that the bit-flip error dominates over all the other errors. In this manuscript, we propose an optimally robust protocol using the control method of shortcuts to adiabaticity to realize a nearly perfect population inversion in a cat-state qubit. We construct a shortcut based on the Lewis-Riesenfeld invariant and examine the stability versus different types of perturbations for the fast and robust population inversion. Numerical simulations demonstrate that the population inversion can be mostly insensitive to systematic errors in our protocol. Even when the parameter imperfection rate for bit-flip control is $20\%$, the final population of the target state can still reach $\geq 99\%$. The optimally robust control provides a feasible method for fault-tolerant and scalable quantum computation.
Related papers
- Non-local resources for error correction in quantum LDPC codes [0.0]
Surface code suffers from a low encoding rate, requiring a vast number of physical qubits for large-scale quantum computation.
hypergraph product codes present a promising alternative, as both their encoding rate and distance scale with block size.
Recent advancements have shown how to deterministically perform high-fidelity cavity enabled non-local many-body gates.
arXiv Detail & Related papers (2024-09-09T17:28:41Z) - 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) - Quantum error correction with dissipatively stabilized squeezed cat
qubits [68.8204255655161]
We propose and analyze the error correction performance of a dissipatively stabilized squeezed cat qubit.
We find that for moderate squeezing the bit-flip error rate gets significantly reduced in comparison with the ordinary cat qubit while leaving the phase flip rate unchanged.
arXiv Detail & Related papers (2022-10-24T16:02:20Z) - Erasure conversion for fault-tolerant quantum computing in alkaline
earth Rydberg atom arrays [3.575043595126111]
We propose a qubit encoding and gate protocol for $171$Yb neutral atom qubits that converts the dominant physical errors into erasures.
We estimate that 98% of errors can be converted into erasures.
arXiv Detail & Related papers (2022-01-10T18:56:31Z) - Realizing Repeated Quantum Error Correction in a Distance-Three Surface
Code [42.394110572265376]
We demonstrate quantum error correction using the surface code, which is known for its exceptionally high tolerance to errors.
In an error correction cycle taking only $1.1,mu$s, we demonstrate the preservation of four cardinal states of the logical qubit.
arXiv Detail & Related papers (2021-12-07T13:58:44Z) - Fault-tolerant multiqubit geometric entangling gates using photonic
cat-state qubits [0.8024702830680637]
We propose a theoretical protocol to implement multiqubit geometric gates using photonic cat-state qubits.
These cat-state qubits are promising for hardware-efficient universal quantum computing.
arXiv Detail & Related papers (2021-09-10T03:04:32Z) - Fault-tolerant parity readout on a shuttling-based trapped-ion quantum
computer [64.47265213752996]
We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme.
We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%.
The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
arXiv Detail & Related papers (2021-07-13T20:08:04Z) - Building a fault-tolerant quantum computer using concatenated cat codes [44.03171880260564]
We present a proposed fault-tolerant quantum computer based on cat codes with outer quantum error-correcting codes.
We numerically simulate quantum error correction when the outer code is either a repetition code or a thin rectangular surface code.
We find that with around 1,000 superconducting circuit components, one could construct a fault-tolerant quantum computer.
arXiv Detail & Related papers (2020-12-07T23:22:40Z) - Error Rates and Resource Overheads of Repetition Cat Qubits [0.0]
We analyze the error rates and the resource overheads of the repetition cat qubit approach to universal and fault-tolerant quantum computation.
Using only bias-preserving gates on the cat-qubits, it is possible to build a universal set of fault-tolerant logical gates.
arXiv Detail & Related papers (2020-09-22T18:33:23Z) - Neural Control Variates [71.42768823631918]
We show that a set of neural networks can face the challenge of finding a good approximation of the integrand.
We derive a theoretically optimal, variance-minimizing loss function, and propose an alternative, composite loss for stable online training in practice.
Specifically, we show that the learned light-field approximation is of sufficient quality for high-order bounces, allowing us to omit the error correction and thereby dramatically reduce the noise at the cost of negligible visible bias.
arXiv Detail & Related papers (2020-06-02T11:17:55Z)
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.