相关论文: Geometric Phase Based Quantum Computation Applied …
Nonadiabatic holonomic quantum computation (NHQC) has been developed to shorten the construction times of geometric quantum gates. However, previous NHQC gates require the driving Hamiltonian to satisfy a set of rather restrictive…
We present a quantum adiabatic algorithm for a set of quantum 2-satisfiability (Q2SAT) problem, which is a generalization of 2-satisfiability (2SAT) problem. For a Q2SAT problem, we construct the Hamiltonian which is similar to that of a…
The problem Hamiltonian of the adiabatic quantum algorithm for the maximum-weight independent set problem (MIS) that is based on the reduction to the Ising problem (as described in [Choi08]) has flexible parameters. We show that by choosing…
Based on the adiabatic geometric phase concerning with density matrix[1] , we extend it to the sub-geometric phase in the non-adiabatic case. It is found that whatever the real part or imaginary part of the sub-geometric phase can play an…
The nonadiabatic geometric quantum computation is promising as it is robust against certain types of local noises. However, its experimental implementation is challenging due to the need of complex control on multi-level and/or multiple…
In the circuit model of quantum computing, amplitude amplification techniques can be used to find solutions to NP-hard problems defined on $n$-bits in time $\text{poly}(n) 2^{n/2}$. In this work, we investigate whether such general…
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…
The level crossing problem and associated geometric terms are neatly formulated by the second quantized formulation. This formulation exhibits a hidden local gauge symmetry related to the arbitrariness of the phase choice of the complete…
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…
We present a multi-step quantum algorithm for solving the $3$-bit exact cover problem, which is one of the NP-complete problems. Unlike the brute force methods have been tried before, in this algorithm, we showed that by applying the…
At present, several models for quantum computation have been proposed. Adiabatic quantum computation scheme particularly offers this possibility and is based on a slow enough time evolution of the system, where no transitions take place. In…
Adiabatic limit is the presumption of the adiabatic geometric quantum computation and of the adiabatic quantum algorithm. But in reality, the variation speed of the Hamiltonian is finite. Here we develop a general formulation of adiabatic…
A new quantum algorithm is proposed to solve Satisfiability(SAT) problems by taking advantage of non-unitary transformation in ground state quantum computer. The energy gap scale of the ground state quantum computer is analyzed for 3-bit…
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…
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…
When a quantum system is driven adiabatically through a parametric cycle in a degenerate Hilbert space, the state would acquire a non-Abelian geometric phase, which is stable and forms the foundation for holonomic quantum computation (HQC).…
Geometric phase is an indispensable element for achieving robust and high-fidelity quantum gates due to its built-in noise-resilience feature. However, due to the complexity of manipulation and the intrinsic leakage of the encoded quantum…
Geometric quantum computation relies on the geometric phase that arises in adiabatic cyclic evolutions of non-degenerate quantum systems, enabling the design of robust quantum gates. However, the adiabatic condition requires long evolution…
Nonadiabatic holonomic quantum gates are high-speed and robust. Nevertheless, they were found to be more fragile than the adiabatic gates when systematic errors become dominant. Inspired by the dark-path scheme that was used to partially…
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…