10 research outputs found

    Optimizing Rydberg Gates for Logical Qubit Performance

    Full text link
    Robust gate sequences are widely used to reduce the sensitivity of gate operations to experimental imperfections. Typically, the optimization minimizes the average gate error, however, recent work in quantum error correction has demonstrated that the performance of encoded logical qubits is sensitive to not only the average error rate, but also the type of errors that occur. Here, we present a family of Rydberg blockade gates for neutral atom qubits that are robust against two common, major imperfections: intensity inhomogeneity and Doppler shifts. These gates outperform existing gates for moderate or large imperfections. We also consider the logical performance of these gates in the context of an erasure-biased qubit based on metastable  171~^{171}Yb. In this case, we observe that the robust gates outperform existing gates for even very small values of the imperfections, because they maintain the native large bias towards erasure errors for these qubits. These results significantly reduce the laser stability and atomic temperature requirements to achieve fault-tolerant quantum computing with neutral atoms. The approach of optimizing gates for logical qubit performance may be applied to other qubit platforms.Comment: v3: Added discussion of AC-Stark shifts; v2: Updated reference

    De Finetti Theorems for Quantum Conditional Probability Distributions with Symmetry

    Full text link
    The aim of device-independent quantum key distribution (DIQKD) is to study protocols that allow the generation of a secret shared key between two parties under minimal assumptions on the devices that produce the key. These devices are merely modeled as black boxes and mathematically described as conditional probability distributions. A major obstacle in the analysis of DIQKD protocols is the huge space of possible black box behaviors. De Finetti theorems can help to overcome this problem by reducing the analysis to black boxes that have an iid structure. Here we show two new de Finetti theorems that relate conditional probability distributions in the quantum set to de Finetti distributions (convex combinations of iid distributions), that are themselves in the quantum set. We also show how one of these de Finetti theorems can be used to enforce some restrictions onto the attacker of a DIQKD protocol. Finally we observe that some desirable strengthenings of this restriction, for instance to collective attacks only, are not straightforwardly possible.Comment: v2: Published version; v1: 30 pages. Ann. Henri Poincar\'e (2023

    Quantum trimer models and topological SU(3) spin liquids on the kagome lattice

    Get PDF
    We construct and study quantum trimer models and resonating SU(3)-singlet models on the kagome lattice, which generalize quantum dimer models and the Resonating Valence Bond wavefunctions to a trimer and SU(3) setting. We demonstrate that these models carry a Z_3 symmetry which originates in the structure of trimers and the SU(3) representation theory, and which becomes the only symmetry under renormalization. Based on this, we construct simple and exact parent Hamiltonians for the model which exhibit a topological 9-fold degenerate ground space. A combination of analytical reasoning and numerical analysis reveals that the quantum order ultimately displayed by the model depends on the relative weight assigned to different types of trimers -- it can display either Z_3 topological order or form a symmetry-broken trimer crystal, and in addition possesses a point with an enhanced U(1) symmetry and critical behavior. Our results accordingly hold for the SU(3) model, where the two natural choices for trimer weights give rise to either a topological spin liquid or a system with symmetry-broken order, respectively. Our work thus demonstrates the suitability of resonating trimer and SU(3)-singlet ansatzes to model SU(3) topological spin liquids on the kagome lattice

    Non-Local Multi-Qubit Quantum Gates via a Driven Cavity

    Full text link
    We present two protocols for implementing deterministic non-local multi-qubit quantum gates on qubits coupled to a common cavity mode. The protocols rely only on a classical drive of the cavity modes, while no external drive of the qubits is required. In the first protocol, the state of the cavity follows a closed trajectory in phase space and accumulates a geometric phase depending on the state of the qubits. The second protocol uses an adiabatic evolution of the combined qubit-cavity system to accumulate a dynamical phase. Repeated applications of this protocol allow for the realization of phase gates with arbitrary phases, e.g. phase-rotation gates and multi-controlled-Z gates. For both protocols, we provide analytic solutions for the error rates, which scale as N/C\sim N/\sqrt{C}, with CC the cooperativity and NN the qubit number. Our protocols are applicable to a variety of systems and can be generalized by replacing the cavity by a different bosonic mode, such as a phononic mode. We provide estimates of gate fidelities and durations for atomic and molecular qubits coupled to an optical and a microwave cavity, respectively, and describe some applications for error correction.Comment: 7 pages + 7 pages supplementary information, 3 figure

    Time-Optimal Two- and Three-Qubit Gates for Rydberg Atoms

    No full text
    International audienceWe identify time-optimal laser pulses to implement the controlled-Z gate and its three qubit generalization, the C2_2Z gate, for Rydberg atoms in the blockade regime. Pulses are optimized using a combination of numerical and semi-analytical quantum optimal control techniques that result in smooth Ansätze with just a few variational parameters. For the CZ gate, the time-optimal implementation corresponds to a global laser pulse that does not require single site addressability of the atoms, simplifying experimental implementation of the gate. We employ quantum optimal control techniques to mitigate errors arising due to the finite lifetime of Rydberg states and finite blockade strengths, while several other types of errors affecting the gates are directly mitigated by the short gate duration. For the considered error sources, we achieve theoretical gate fidelities compatible with error correction using reasonable experimental parameters for CZ and C2_2Z gates

    De Finetti Theorems for Quantum Conditional Probability Distributions with Symmetry

    No full text
    The aim of device-independent quantum key distribution (DIQKD) is to study protocols that allow the generation of a secret shared key between two parties under minimal assumptions on the devices that produce the key. These devices are merely modeled as black boxes and mathematically described as conditional probability distributions. A major obstacle in the analysis of DIQKD protocols is the huge space of possible black box behaviors. De Finetti theorems can help to overcome this problem by reducing the analysis to black boxes that have an iid structure. Here we show two new de Finetti theorems that relate conditional probability distributions in the quantum set to de Finetti distributions (convex combinations of iid distributions) that are themselves in the quantum set. We also show how one of these de Finetti theorems can be used to enforce some restrictions onto the attacker of a DIQKD protocol. Finally we observe that some desirable strengthenings of this restriction, for instance to collective attacks only, are not straightforwardly possible.ISSN:1424-0661ISSN:1424-063

    De Finetti Theorems for Quantum Conditional Probability Distributions with Symmetry

    No full text
    The aim of device-independent quantum key distribution (DIQKD) is to study protocols that allow the generation of a secret shared key between two parties under minimal assumptions on the devices that produce the key. These devices are merely modeled as black boxes and mathematically described as conditional probability distributions. A major obstacle in the analysis of DIQKD protocols is the huge space of possible black box behaviors. De Finetti theorems can help to overcome this problem by reducing the analysis to black boxes that have an iid structure. Here we show two new de Finetti theorems that relate conditional probability distributions in the quantum set to de Finetti distributions (convex combinations of iid distributions), that are themselves in the quantum set. We also show how one of these de Finetti theorems can be used to enforce some restrictions onto the attacker of a DIQKD protocol. Finally we observe that some desirable strengthenings of this restriction, for instance to collective attacks only, are not straightforwardly possible

    Quantum algorithms for grid-based variational time evolution

    Full text link
    The simulation of quantum dynamics calls for quantum algorithms working in first quantized grid encodings. Here, we propose a variational quantum algorithm for performing quantum dynamics in first quantization. In addition to the usual reduction in circuit depth conferred by variational approaches, this algorithm also enjoys several advantages compared to previously proposed ones. For instance, variational approaches suffer from the need for a large number of measurements. However, the grid encoding of first quantized Hamiltonians only requires measuring in position and momentum bases, irrespective of the system size. Their combination with variational approaches is therefore particularly attractive. Moreover, heuristic variational forms can be employed to overcome the limitation of the hard decomposition of Trotterized first quantized Hamiltonians into quantum gates. We apply this quantum algorithm to the dynamics of several systems in one and two dimensions. Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches. We show how they can be significantly attenuated through subspace diagonalization at a cost of an additional O(MN2)\mathcal{O}(MN^2) 2-qubit gates where MM is the number of dimensions and NMN^M is the total number of grid points
    corecore