Related papers: Recent Advances on Nonadiabatic Geometric Quantum …
One of the outstanding challenges in contemporary science and technology is building a quantum computer that is useful in applications. By starting from an estimate of the algorithm success rate, we can explicitly connect gate fidelity to…
Quantum technologies based on adiabatic techniques can be highly effective, but often at the cost of being very slow. Here we introduce a set of experimentally realistic, non-adiabatic protocols for spatial state preparation, which yield…
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…
Electronic wave-functions in the adiabatic representation acquire nontrivial geometric phases (GPs) when corresponding potential energy surfaces undergo conical intersection (CI). These GPs have profound effects on the nuclear quantum…
Noncyclic geometric gates aim to overcome the stringent constraints of conventional cyclic conditions and enhance the flexibility in evolution choice. Conceptually, they can also avoid the error problems arising from the violation of…
Holonomic quantum computation uses non-Abelian geometric phases to realize error resilient quantum gates. Nonadiabatic holonomic gates are particularly suitable to avoid unwanted decoherence effects, as they can be performed at high speed.…
We describe in detail a general strategy for implementing a conditional geometric phase between two spins. Combined with single-spin operations, this simple operation is a universal gate for quantum computation, in that any unitary…
We propose a general framework of the geometric-phase interpretation for counting statistics. Counting statistics is a scheme to count the number of specific transitions in a stochastic process. The cumulant generating function for the…
Geometric phases are well known to be noise-resilient in quantum evolutions/operations. Holonomic quantum gates provide us with a robust way towards universal quantum computation, as these quantum gates are actually induced by nonabelian…
Nonadiabatic holonomic quantum computation (NHQC) offers intrinsic resilience to certain control imperfections. However, conventional nonadiabatic holonomic protocols are constrained by the fixed-pulse-area condition, which limits…
We propose a non-adiabatic scheme for geometric quantum computation with trapped ions. By making use of the Aharonov-Anandan phase, the proposed scheme not only preserves the globally geometric nature in quantum computation, but also…
When a quantum mechanical system undergoes an adiabatic cyclic evolution it acquires a geometrical phase factor in addition to the dynamical one. This effect has been demonstrated in a variety of microscopic systems. Advances in…
We discuss the presence of a geometrical phase in the evolution of a qubit state and its gauge structure. The time evolution operator is found to be the free energy operator, rather than the Hamiltonian operator.
We give a simple way to detect the geometric phase shift and the conditional geometric phase shift with Josephson junction system. Comparing with the previous work(Falcl G, Fazio R, Palma G.M., Siewert J and Verdal V, {\it Nature} {\bf…
Geometric manipulation of a quantum system offers a method for fast, universal, and robust quantum information processing. Here, we propose a scheme for universal all-geometric quantum computation using non-adiabatic quantum holonomies. We…
Geometric quantum computation offers a potential route to fault-tolerant quantum information processing by exploiting the global nature of geometric phases. However, achieving controlled high-order suppression of multiple error sources…
We introduce a class of quantum adiabatic evolutions that we claim may be interpreted as the equivalents of the unitary gates of the quantum gate model. We argue that these gates form a universal set and may therefore be used as building…
The implementation of holonomic quantum computation on superconducting quantum circuits is challenging due to the general requirement of controllable complicated coupling between multilevel systems. Here we solve this problem by proposing a…
We interpret quantum computing as a geometric evolution process by reformulating finite quantum systems via Connes' noncommutative geometry. In this formulation, quantum states are represented as noncommutative connections, while gauge…
Adiabatic quantum computation is based on the adiabatic evolution of quantum systems. We analyse a particular class of qauntum adiabatic evolutions where either the initial or final Hamiltonian is a one-dimensional projector Hamiltonian on…