Related papers: Gate errors in solid state quantum computation
Quantum manipulation based on geometric phases provides a promising way towards robust quantum gates. However, in the current implementation of nonadiabatic geometric phases, operational and/or random errors tend to destruct the conditions…
Reliable quantum information processing requires high-fidelity universal manipulation of quantum systems within the characteristic coherence times. Non-adiabatic holonomic quantum computation offers a promising approach to implement fast,…
Matrix product states provide a natural entanglement basis to represent a quantum register and operate quantum gates on it. This scheme can be materialized to simulate a quantum adiabatic algorithm solving hard instances of a NP-Complete…
Standard adiabatic protocols for superconducting qubits often face a trade-off between gate speed and decoherence. In this work, using IBM Quantum 127-qubit processors (ibm_fez and ibm_kingston), we report the discovery of a fundamental…
Quantum computation in solid state quantum dots faces two significant challenges: Decoherence from interactions with the environment and the difficulty of generating local magnetic fields for the single qubit rotations. This paper presents…
Many physically interesting models show a quantum phase transition when a single parameter is varied through a critical point, where the ground state and the first excited state become degenerate. When this parameter appears as a coupling…
In the quantum-computation scenario, geometric phase-gates are becoming increasingly attractive for their intrinsic fault tolerance to disturbance. With an adiabatic cyclic evolution, Berry phase appears to realize a geometric…
The realization of a scalable quantum information processor has emerged over the past decade as one of the central challenges at the interface of fundamental science and engineering. Much progress has been made towards this goal. Indeed,…
The observation that concepts from quantum information has generated many alternative indicators of quantum phase transitions hints that quantum phase transitions possess operational significance with respect to the processing of quantum…
In adiabatic Cooper pair pumps, operated by means of gate voltage modulation only, the quantization of the pumped charge during a cycle is limited due to the quantum coherence of the macroscopic superconducting wave function. In this work…
We consider quantum computer architectures where interactions are mediated between hot qubits that are not in their mechanical ground state. Such situations occur, e.g., when not cooling ideally, or when moving ions or atoms around. We…
In quantum adiabatic algorithm, as the adiabatic parameter $s(t)$ changes slowly from zero to one with finite rate, a transition to excited states inevitably occurs and this induces an intrinsic computational error. We show that this…
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quantum state generation'. This approach provides intriguing links…
Nonadiabatic holonomic quantum computation has robust feature in suppressing control errors because of its holonomic feature. However, this kind of robust feature is challenged since the usual way of realizing nonadiabatic holonomic gates…
We explore the relationship between two figures of merit for an adiabatic quantum computation process: the success probability $P$ and the minimum gap $\Delta_{min}$ between the ground and first excited states, investigating to what extent…
Recently, nonadiabatic geometric quantum computation has been received great attentions, due to its fast operation and intrinsic error resilience. However, compared with the corresponding dynamical gates, the robustness of implemented…
We present a strategy for producing multi-qubit gates that promise high fidelity with minimal tuning requirements. Our strategy combines gap protection from the adiabatic theorem with dynamical decoupling in a complementary manner. To avoid…
We describe a new and consistent perturbation theory for solid-state quantum computation with many qubits. The errors in the implementation of simple quantum logic operations caused by non-resonant transitions are estimated. We verify our…
We prove the equivalence between adiabatic quantum computation and quantum computation in the circuit model. An explicit adiabatic computation procedure is given that generates a ground state from which the answer can be extracted. The…
Stabilized cat codes can provide a biased noise channel with a set of bias-preserving (BP) gates, which can significantly reduce the resource overhead for fault-tolerant quantum computing. All existing schemes of BP gates, however, require…