We present a new approach to quantum computation involving the geometric phase. In this approach, an entire computation is performed by adiabatically evolving a suitably chosen quantum system in a closed circuit in parameter space. The problem solved is the determination of the solubility of a 3-SAT Boolean Satisfiability problem. The problem of non-adiabatic transitions to higher levels is addressed in several ways. The avoided level crossings are well defined and the interpolation can be slowed in this region, the Hamiltonian can be scaled with problem dimension resulting in a constant gap size and location, and the prescription here is sufficiently general as to allow for other suitably chosen Hamiltonians. Finally, we show that with $n$ applications of this approach, the geometric phase based quantum computation method may be used to find the solution to the 3-SAT problem in $n$ variables, a member of the NP-complete complexity class.
We generalize the notion of relative phase to completely positive maps with known unitary representation, based on interferometry. Parallel transport conditions that define the geometric phase for such maps are introduced. The interference effect is embodied in a set of interference patterns defined by flipping the environment state in one of the two paths. We show for the qubit that this structure gives rise to interesting additional information about the geometry of the evolution defined by the CP map.
We propose an experimentally feasible scheme to achieve quantum computation based solely on geometric manipulations of a quantum system. The desired geometric operations are obtained by driving the quantum system to undergo appropriate adiabatic cyclic evolutions. Our implementation of the all-geometric quantum computation is based on laser manipulation of a set of trapped ions. An all-geometric approach, apart from its fundamental interest, promises a possible way for robust quantum computation.
Nodal free geometric phases are the eigenvalues of the final member of a parallel transporting family of unitary operators. These phases are gauge invariant, always well-defined, and can be measured interferometrically. Nodal free geometric phases can be used to construct various types of quantum phase gates.
We propose a new class of unconventional geometric gates involving nonzero dynamic phases, and elucidate that geometric quantum computation can be implemented by using these gates. Comparing with the conventional geometric gate operation, in which the dynamic phase shift must be removed or avoided, the gates proposed here may be operated more simply. We illustrate in detail that unconventional nontrivial two-qubit geometric gates with built-in fault tolerant geometric features can be implemented in real physical systems.
Nonadiabatic geometric quantum computation in decoherence-free subspaces has received increasing attention due to the merits of its high-speed implementation and robustness against both control errors and decoherence. However, all the previous schemes in this direction have been based on the conventional geometric phases, of which the dynamical phases need to be removed. In this paper, we put forward a scheme of nonadiabatic geometric quantum computation in decoherence-free subspaces based on unconventional geometric phases, of which the dynamical phases do not need to be removed. Specifically…
Nonadiabatic geometric quantum computation provides a means to perform fast and robust quantum gates. It has been implemented in various physical systems, such as trapped ions, nuclear magnetic resonance and superconducting circuits. Another system being adequate for implementation of nonadiabatic geometric quantum computation may be Rydberg atoms, since their internal states have very long coherence time and the Rydberg-mediated interaction facilitates the implementation of a two-qubit gate. Here, we propose a scheme of nonadiabatic geometric quantum computation based on Rydberg atoms, which …
We examine the adiabatic dynamics of a quantum system coupled to a noisy classical control field. A stochastic phase shift is shown to arise in the off-diagonal elements of the system's density matrix which can cause decoherence. We derive the condition for onset of decoherence, and identify the noise properties that drive decoherence. We show how this decoherence mechansim causes: (1) a dephasing of the observable consequences of the adiabatic geometric phase; and (2) the loss of computational efficiency of the Shor algorithm when run on a sufficiently noisy geometric quantum computer.
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 transformations on the connections play a role of unitary quantum operations. Thereby, a geometrical model for quantum computation is presented, which is equivalent to the quantum circuit model. This result shows a geometric way of realizing quantum computing and as such, provides an alternative proposal of building a quantum computer.
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 provides the advantage of non-adiabaticity that overcomes the problem of slow evolution in the existing adiabatic schemes. Moreover, the present scheme requires only two atomic levels in each ion, making it an appealing candidate for quantum computation.
Geometric quantum computation is the idea that geometric phases can be used to implement quantum gates, i.e., the basic elements of the Boolean network that forms a quantum computer. Although originally thought to be limited to adiabatic evolution, controlled by slowly changing parameters, this form of quantum computation can as well be realized at high speed by using nonadiabatic schemes. Recent advances in quantum gate technology have allowed for experimental demonstrations of different types of geometric gates in adiabatic and nonadiabatic evolution. Here, we address some conceptual issues …
The applications of geometric control theory methods on Lie groups and homogeneous spaces to the theory of quantum computations are investigated. These methods are shown to be very useful for the problem of constructing an universal set of gates for quantum computations: the well-known result that the set of all one-bit gates together with almost any one two-bit gate is universal is considered from the control theory viewpoint.
The nonadiabatic geometric quantum computation may be achieved using coupled low-capacitance Josephson juctions. We show that the nonadiabtic effects as well as the adiabatic condition are very important for these systems. Moreover, we find that it may be hard to detect the adiabatic Berry's phase in this kind of superconducting nanocircuits; but the nonadiabatic phase may be measurable with current techniques. Our results may provide useful information for the implementation of geometric quantum computation.
Quantum computation based on nonadiabatic geometric phases has attracted a broad range of interests, due to its fast manipulation and inherent noise resistance. However, it is limited to some special evolution paths, and the gate-times are typically longer than conventional dynamical gates, resulting in weakening of robustness and more infidelities of the implemented geometric gates. Here, we propose a path-optimized scheme for geometric quantum computation on superconducting transmon qubits, where high-fidelity and robust universal nonadiabatic geometric gates can be implemented, based on con…
A single-loop scenario is proposed to realize nonadiabatic geometric quantum computation. Conventionally, a so-called multi-loop approach is used to remove the dynamical phase accumulated in the operation process for geometric quantum gates. More intriguingly, we here illustrate in detail how to use a special single-loop method to remove the dynamical phase and thus to construct a set of universal quantum gates based on the nonadiabatic geometric phase shift. The present scheme is applicable to NMR systems and may be feasible in other physical systems.
The possibility of realization of quantum gates by means of the non-adiabatic geometric phase is considered. It is shown that the non-adiabatic phase can be used for quantum gates realization as well as the adiabatic one.
Calculation aspects of holonomic quantum computer (HQC) are considered. Wilczek--Zee potential defining the set of quantum calculations for HQC is explicitly evaluated. Principal possibility of realization of the logical gates for this case is discussed.
Noise-resilient nonadiabatic geometric quantum computation for bosonic binomial codes
Fujian Key Laboratory of Quantum Information and Quantum Optics, College of Physics and Information Engineering, Fuzhou University（福州大学物理与信息工程学院）；School of Physics, Hangzhou Normal University（杭州师范大学物理学院）；Center for Joint Quantum Studies and Department of Physics, School of Science, Tianjin University（天津大学理学院）；Institute of Quantum Science and Technology, Yanbian University（延边大学量子科学与技术研究院）；Quantum Information Physics Theory Research Team, Center for Quantum Computing, RIKEN（理研量子计算中心）
Nonadiabatic geometric quantum computation (NGQC) has been developed to realize fast and robust geometric gate. However, the conventional NGQC is that all of the gates are performed with exactly the sameamount of time, whether the geometric rotation angle is large or small, due to the limitation of cyclic condition. Here, we propose an unconventional scheme, called nonadiabatic noncyclic geometric quantum computation(NNGQC), that arbitrary single- and two-qubit geometric gate can be constructed via noncyclic non-Abeliangeometric phase. Consequently, this scheme makes it possible to accelerate …
This paper presents an alternative approach to geometric phases from the observable point of view. Precisely, we introduce the notion of observable-geometric phases, which is defined as a sequence of phases associated with a complete set of eigenstates of the observable. The observable-geometric phases are shown to be connected with the quantum geometry of the observable space evolving according to the Heisenberg equation. They are indeed distinct from Berry's phase \cite{Berry1984, Simon1983} as the system evolves adiabatically. It is shown that the observable-geometric phases can be used to …
In the first part of this review we introduce the basics theory behind geometric phases and emphasize their importance in quantum theory. The subject is presented in a general way so as to illustrate its wide applicability, but we also introduce a number of examples that will help the reader understand the basic issues involved. In the second part we show how to perform a universal quantum computation using only geometric effects appearing in quantum phases. It is then finally discussed how this geometric way of performing quantum gates can lead to a stable, large scale, intrinsically fault-to…
We introduce the non-adiabatic, or Aharonov-Anandan, geometric phase as a tool for quantum computation and show how it could be implemented with superconducting charge qubits. While it may circumvent many of the drawbacks related to the adiabatic (Berry) version of geometric gates, we show that the effect of fluctuations of the control parameters on non-adiabatic phase gates is more severe than for the standard dynamic gates. Similarly, fluctuations also affect to a greater extent quantum gates that use the Berry phase instead of the dynamic phase.
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 transformation can be implemented with arbitrary precision using only single-spin operations and conditional phase shifts. Thus quantum geometrical phases can form the basis of any quantum computation. Moreover, as the induced conditional phase depends only on the geometry of the paths executed by the spins it is resilient to certain types of errors and offers the p…
Geometric phase, associated with holonomy transformation in quantum state space, is an important quantum-mechanical effect. Besides fundamental interest, this effect has practical applications, among which geometric quantum computation is a paradigm, where quantum logic operations are realized through geometric phase manipulation that has some intrinsic noise-resilient advantages and may enable simplified implementation of multiqubit gates compared to the dynamical approach. Here we report observation of a continuous-variable geometric phase and demonstrate a quantum gate protocol based on thi…
We present a scheme for implementing the unconventional geometric two-qubit phase gate with nonzero dynamical phase by using the two-channel Raman interaction of two atoms in a cavity. We show that the dynamical phase acquired in a cyclic evolution is proportional to the geometric phase acquired in the same cyclic evolution, hence the the total phase possesses the same geometric features as the geometric phase. In our scheme the atomic excited state is adiabatically eliminated and the operation of the proposed logic gate involves only in the metastable states of the atom and hence is not affec…
We propose a feasible scheme to achieve quantum computation based on geometric manipulation of ensembles of atoms, and analyze it for neutral rubidium atoms magnetically trapped in planoconcave microcavities on an atom chip. The geometric operations are accomplished by optical excitation of a single atom into a Rydberg state in a constant electric field. Strong dipole-dipole interactions and incident lasers drive the dark state of the atom ensembles to undergo cyclic evolutions that realize a universal set of quantum gates. Such geometric manipulation turns out naturally to protect the qubits …
Quantum gates, which are the essential building blocks of quantum computers, are very fragile. Thus, to realize robust quantum gates with high fidelity is the ultimate goal of quantum manipulation. Here, we propose a nonadiabatic geometric quantum computation scheme on superconducting circuits to engineer arbitrary quantum gates, which share both the robust merit of geometric phases and the capacity to combine with optimal control technique to further enhance the gate robustness. Specifically, in our proposal, arbitrary geometric single-qubit gates can be realized on a transmon qubit, by a res…
When initially introduced, a Hamiltonian that realises perfect transfer of a quantum state was found to be analogous to an x-rotation of a large spin. In this paper we extend the analogy further to demonstrate geometric effects by performing rotations on the spin. Such effects can be used to determine properties of the chain, such as its length, in a robust manner. Alternatively, they can form the basis of a spin network quantum computer. We demonstrate a universal set of gates in such a system by both dynamical and geometrical means.
Recently, geometric phases, which is fault tolerate to certain errors intrinsically due to its geometric property, are getting considerable attention in quantum computing theoretically. So far, only one experiment about adiabatic geometric gate with NMR through Berry phase has been reported. However, there are two drawbacks in it. First, the adiabatic condition of Berry phase makes such gate very slowly. Second, the extra operation to eliminate the dynamic phase. As we know, geometric phase can exist both adiabatic(Berry phase) and nonadiabatic(Aharonov-Anandan phase). In this letter, we repor…
We propose a geometric phase gate of two ion qubits that are encoded in two levels linked by an optical dipole-forbidden transition. Compared to hyperfine geometric phase gates mediated by electric dipole transitions, the gate has many interesting properties, such as very low spontaneous emission rates, applicability to magnetic field insensitive states, and use of a co-propagating laser beam geometry. We estimate that current technology allows for infidelities of around 10$^{-4}$.
We propose a protocol to realize nonadiabatic geometric quantum computation of small-amplitude Schrödinger cat qubits via invariant-based reverse engineering. We consider a system with a two-photon driven Kerr nonlinearity, which provides a pair of dressed even and odd coherent states, i.e., Schrödinger cat states for fault-tolerant quantum computations. An additional coherent field is applied to linearly drive a cavity mode, to induce oscillations between dressed cat states. By designing this linear drive with invariant-based reverse engineering, nonadiabatic geometric quantum computation wit…
Universal speeded-up adiabatic geometric quantum computation~(SAGQC) is studied in $Λ$-type three-level system with different coupling cases, i.e., time-dependent detuning, large detuning and one-photon resonance couplings, respectively. In these cases, the counterdiabatic driving method is used to speed up the universal quantum computation. These schemes in $Λ$-type three-level system are feasible in experiment because additional unaccessible ground-state-coupling is not needed. Only the shapes and phases of the initial adiabatic classical-field pulse are modified with the aid of effective tw…
Geometric phases arise naturally in a variety of quantum systems with observable consequences. They also arise in quantum computations when dressed states are used in gating operations. Here we show how they arise in these gating operations and how one may take advantage of the dressed states producing them. Specifically, we show that that for a given, but arbitrary Hamiltonian, and at an arbitrary time τ, there always exists a set of dressed states such that a given gate operation can be performed by the Hamiltonian up to a phase ϕ. The phase is a sum of a dynamical phase and a geometric phas…
We analyze a new scheme for quantum information processing, with superconducting charge qubits coupled through a cavity mode, in which quantum manipulations are insensitive to the state of the cavity. We illustrate how to physically implement universal quantum computation as well as multi-qubit entanglement based on unconventional geometric phase shifts in this scalable solid-state system. Some quantum error-correcting codes can also be easily constructed using the same technique. In view of the gate dependence on just global geometric features and the insensitivity to the state of cavity mode…
Because of using geometric phases, nonadiabatic geometric gates have the robustness against control errors. On the other hand, decoherence still affects nonadiabatic geometric gates, which is a key factor in reducing their fidelities. In this paper, we show that based on the system Hamiltonian that realizes a nonadiabatic geometric gate, one may construct a new system Hamiltonian, by using which not only the geometric feature of the nonadiabatic geometric gate is preserved, but also the system's coherence is protected. As a result, a coherence-protected nonadiabatic geometric gate is realized …
We propose a simple unconventional geometric scenario to achieve a kind of nontrivial multi-qubit operations with superconducting charge qubits placed in a microwave cavity. The proposed quantum operations are insensitive not only to the thermal state of cavity mode but also to certain random operation errors, and thus may lead to high-fidelity quantum information processing. Executing the designated quantum operations, a class of highly entangled cluster states may be generated efficiently in the present scalable solid-state system, enabling one to achieve one-way quantum computation.
We present the complete solution of the problem of determination of trace-norm geometric discord for arbitrary two-qubit state. Final answer is achieved due to effective reduction of the problem to the study of critical points of certain mapping depending on projectors. Our results are illustrated on various, also new, families of two-qubit states and compared to already known special solutions.
In these notes we present preliminary results on quantum-like algorithms where tensor product is replaced by geometric product. Such algorithms possess the essential properties typical of quantum computation (entanglement, parallelism) but employ additional algebraic structures typical of geometric algebra -- structures absent in standard quantum computation. As a test we reformulate in Geometric Algebra terms the Deutsch-Jozsa problem.
We define an operational notion of phases in interferometry for a quantum system undergoing a completely positive non-unitary evolution. This definition is based on the concepts of quantum measurement theory. The suitable generalization of the Pancharatnan connection allows us to determine the dynamical and geometrical parts of the total phase between two states linked by a completely positive map. These results reduce to the knonw expressions of total, dynamical and geometrical phases for pure and mixed states evolving unitarily.
Nonadiabatic geometric phases are only dependent on the evolution path of a quantum system but independent of the evolution details, and therefore quantum computation based on nonadiabatic geometric phases is robust against control errors. To realize nonadiabatic geometric quantum computation, it is necessary to ensure that the quantum system undergoes a cyclic evolution and the dynamical phases are removed from the total phases. To satisfy these conditions, the evolution paths in previous schemes are usually restricted to some special forms, e.g, orange-slice-shaped loops, which make the path…
In this paper, we use the Carnot-Caratheodory distance from sub-Riemanian geometry to prove entropy decay estimates for all finite dimensional symmetric quantum Markov semigroups. This estimate is independent of the environment size and hence stable under tensorization. Our approach relies on the transference principle, the existence of $t$-designs, and the sub-Riemannian diameter of compact Lie groups and implies estimates for the spectral gap.
Besides the intrinsic noise resilience property, nonadiabatic geometric phases are of the fast evolution nature, and thus can naturally be used in constructing quantum gates with excellent performance, i.e., the so-called nonadiabatic geometric quantum computation (NGQC). However, previous single-loop NGQC schemes are sensitive to the operational control error, i.e., the $X$ error, due to the limitations of the implementation. Here, we propose a robust scheme for NGQC combining with the dynamical correction technique, which still uses only simplified pulses, and thus being experimental friendl…
The experimental realisation of the basic constituents of quantum information processing devices, namely fault-tolerant quantum logic gates, requires conditional quantum dynamics, in which one subsystem undergoes a coherent evolution that depends on the quantum state of another subsystem. In particular, the subsystem may acquire a conditional phase shift. Here we consider a novel scenario in which this phase is of geometric rather than dynamical origin. As the conditional geometric (Berry) phase depends only on the geometry of the path executed it is resilient to certain types of errors, and o…
Geometric phase that manifests itself in number of optic and nuclear experiments is shown to be a useful tool for realization of quantum computations in so called holonomic quantum computer model (HQCM). This model is considered as an externally driven quantum system with adiabatic evolution law and finite number of the energy levels. The corresponding evolution operators represent quantum gates of HQCM. The explicit expression for the gates is derived both for one-qubit and for multi-qubit quantum gates as Abelian and non-Abelian geometric phases provided the energy levels to be time-independ…
Nonadiabatic geometric quantum computation (NGQC) and nonadiabatic holonomic quantum computation (NHQC) have been proposed to reduce the run time of geometric quantum gates. However, in terms of robustness against experimental control errors, the existing NGQC and NHQC scenarios have no advantage over standard dynamical gates in most cases. Here, we give the reasons why nonadiabatic geometric gates are sensitive to the control errors and, further, we propose a scheme of super-robust nonadiabatic geometric quantum control, in which the super-robust condition can guarantee both high speed and ro…
Conditional geometric phase shift gate, which is fault tolerate to certain errors due to its geometric property, is made by NMR technique recently under adiabatic condition. By the adiabatic requirement, the result is inexact unless the Hamiltonian changes extremely slowly in the process. However, in quantum computation, everything has to be completed within the decoherence time. High running speed of every gate in quantum computation is demanded because the power of quantum computer can be exponentially proportional to the maximum number of logic gate operation that can be taken sequentially …
Recently, nonadiabatic geometric quantum computation has been received much attention, due to its fast manipulation and intrinsic error-resilience characteristics. However, to obtain universal geometric quantum control, only limited and special evolution paths have been proposed, which usually requires longer gate-time and more operational steps, and thus leads to lower quality of the implemented quantum gates. Here, we present an effective scheme to find the shortest geometric path under the conventional conditions of geometric quantum computation, where high-fidelity and robust geometric gat…
A geometrical approach to quantum computation is presented, where a non-abelian connection is introduced in order to rewrite the evolution operator of an energy degenerate system as a holonomic unitary. For a simple geometrical model we present an explicit construction of a universal set of gates, represented by holonomies acting on degenerate states.
An adiabatic cyclic evolution of control parameters of a quantum system ends up with a holonomic operation on the system, determined entirely by the geometry in the parameter space. The operation is given either by a simple phase factor (a Berry phase) or a non-Abelian unitary operator depending on the degeneracy of the eigenspace of the Hamiltonian. Geometric quantum computation is a scheme to use such holonomic operations rather than the conventional dynamic operations to manipulate quantum states for quantum information processing. Here we propose a geometric quantum computation scheme whic…
