Your browser doesn't support javascript.
loading
Mostrar: 20 | 50 | 100
Resultados 1 - 7 de 7
Filtrar
Mais filtros










Base de dados
Intervalo de ano de publicação
1.
Phys Rev Lett ; 130(25): 250602, 2023 Jun 23.
Artigo em Inglês | MEDLINE | ID: mdl-37418741

RESUMO

Minimizing leakage from computational states is a challenge when using many-level systems like superconducting quantum circuits as qubits. We realize and extend the quantum-hardware-efficient, all-microwave leakage reduction unit (LRU) for transmons in a circuit QED architecture proposed by Battistel et al. This LRU effectively reduces leakage in the second- and third-excited transmon states with up to 99% efficacy in 220 ns, with minimum impact on the qubit subspace. As a first application in the context of quantum error correction, we show how multiple simultaneous LRUs can reduce the error detection rate and suppress leakage buildup within 1% in data and ancilla qubits over 50 cycles of a weight-2 stabilizer measurement.

2.
Nature ; 606(7916): 884-889, 2022 06.
Artigo em Inglês | MEDLINE | ID: mdl-35512730

RESUMO

Solid-state spin qubits is a promising platform for quantum computation and quantum networks1,2. Recent experiments have demonstrated high-quality control over multi-qubit systems3-8, elementary quantum algorithms8-11 and non-fault-tolerant error correction12-14. Large-scale systems will require using error-corrected logical qubits that are operated fault tolerantly, so that reliable computation becomes possible despite noisy operations15-18. Overcoming imperfections in this way remains an important outstanding challenge for quantum science15,19-27. Here, we demonstrate fault-tolerant operations on a logical qubit using spin qubits in diamond. Our approach is based on the five-qubit code with a recently discovered flag protocol that enables fault tolerance using a total of seven qubits28-30. We encode the logical qubit using a new protocol based on repeated multi-qubit measurements and show that it outperforms non-fault-tolerant encoding schemes. We then fault-tolerantly manipulate the logical qubit through a complete set of single-qubit Clifford gates. Finally, we demonstrate flagged stabilizer measurements with real-time processing of the outcomes. Such measurements are a primitive for fault-tolerant quantum error correction. Although future improvements in fidelity and the number of qubits will be required to suppress logical error rates below the physical error rates, our realization of fault-tolerant protocols on the logical-qubit level is a key step towards quantum information processing based on solid-state spins.

3.
Phys Rev Lett ; 123(12): 120502, 2019 Sep 20.
Artigo em Inglês | MEDLINE | ID: mdl-31633950

RESUMO

Conditional-phase (cz) gates in transmons can be realized by flux pulsing computational states towards resonance with noncomputational ones. We present a 40 ns cz gate based on a bipolar flux pulse suppressing leakage (0.1%) by interference and approaching the speed limit set by exchange coupling. This pulse harnesses a built-in echo to enhance fidelity (99.1%) and is robust to long-timescale distortion in the flux-control line, ensuring repeatability. Numerical simulations matching experiment show that fidelity is limited by high-frequency dephasing and leakage by short-timescale distortion.

4.
Philos Trans A Math Phys Eng Sci ; 376(2123)2018 Jul 13.
Artigo em Inglês | MEDLINE | ID: mdl-29807900

RESUMO

We explore a distance-3 homological CSS quantum code, namely the small stellated dodecahedron code, for dense storage of quantum information and we compare its performance with the distance-3 surface code. The data and ancilla qubits of the small stellated dodecahedron code can be located on the edges respectively vertices of a small stellated dodecahedron, making this code suitable for three-dimensional connectivity. This code encodes eight logical qubits into 30 physical qubits (plus 22 ancilla qubits for parity check measurements) in contrast with one logical qubit into nine physical qubits (plus eight ancilla qubits) for the surface code. We develop fault-tolerant parity check circuits and a decoder for this code, allowing us to numerically assess the circuit-based pseudo-threshold.This article is part of a discussion meeting issue 'Foundations of quantum mechanics and their impact on contemporary society'.

5.
Phys Rev Lett ; 87(7): 077902, 2001 Aug 13.
Artigo em Inglês | MEDLINE | ID: mdl-11497918

RESUMO

Quantum teleportation uses prior entanglement and forward classical communication to transmit one instance of an unknown quantum state. Remote state preparation (RSP) has the same goal, but the sender knows classically what state is to be transmitted. We show that the asymptotic classical communication cost of RSP is one bit per qubit--half that of teleportation--and even less when transmitting part of a known entangled state. We explore the tradeoff between entanglement and classical communication required for RSP, and discuss RSP capacities of general quantum channels.

6.
Phys Rev Lett ; 86(25): 5807-10, 2001 Jun 18.
Artigo em Inglês | MEDLINE | ID: mdl-11415363

RESUMO

We present a scheme for hiding bits in Bell states that is secure even when the sharers, Alice and Bob, are allowed to carry out local quantum operations and classical communication. We prove that the information that Alice and Bob can gain about a hidden bit is exponentially small in n, the number of qubits in each share, and can be made arbitrarily small for hiding multiple bits. We indicate an alternative efficient low-entanglement method for preparing the shared quantum states. We discuss how our scheme can be implemented using present-day quantum optics.

7.
Phys Rev Lett ; 86(12): 2681-4, 2001 Mar 19.
Artigo em Inglês | MEDLINE | ID: mdl-11290010

RESUMO

Assuming the validity of a conjecture given by DiVincenzo et al. [Phys. Rev. A 61, 062312 (2000)] and by Dür et al. [Phys. Rev. A 61, 062313 (2000)], we show that the distillable entanglement for two bipartite states, each of which individually has zero distillable entanglement, can be nonzero. We show that this also implies that the distillable entanglement is not a convex function. Our example consists of the tensor product of a bound entangled state based on an unextendible product basis with an entangled Werner state which lies in the class of conjectured undistillable states.

SELEÇÃO DE REFERÊNCIAS
DETALHE DA PESQUISA
...