相关论文: Geometric Phase Based Quantum Computation Applied …
The superadiabatic quantum driving, producing a perfect adiabatic transfer on a given Hamitonian by introducing an additional Hamiltonian, is theoretically analysed for transfers within a three-level system. Our starting point is the…
High-fidelity quantum gates are essential for large-scale quantum computation, which can naturally be realized in a noise-resilient way. Geometric manipulation and decoherence-free subspace encoding are promising ways toward robust quantum…
Qubit-based variational quantum algorithms have undergone rapid development in recent years but still face several challenges. In this context, we propose a symmetry-enhanced digitized counterdiabatic quantum algorithm utilizing qudits…
The main challenges in achieving high-fidelity quantum gates are to reduce the influence of control errors caused by imperfect Hamiltonians and the influence of decoherence caused by environment noise. To overcome control errors, a…
Geometric Phase in Quantum Mechanics is generally formulated entirely in terms of geometric structure of the Complex Hilbert Space. We will exploit this fact in case of mixed states for three level open systems undergoing depolarization…
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…
In Amin and Choi \cite{AC09}, we show that an adiabatic quantum algorithm for the NP-hard maximum independent set (MIS) problem on a set of special family of graphs in which there are exponentially many local maxima would have the…
The connection between the geometric phase and quantum phase transition has been discussed extensively in the two-band model. By introducing the twist operator, the geometric phase can be defined by calculating its ground-state expectation…
Universal speeded-up adiabatic geometric quantum computation~(SAGQC) is studied in $\Lambda$-type three-level system with different coupling cases, i.e., time-dependent detuning, large detuning and one-photon resonance couplings,…
The Quantum Satisfiability problem (QSAT) is the generalization of the canonical NP-complete problem - Boolean Satisfiability. (k,s)-QSAT is the following variant of the problem: given a set of projectors of rank 1, acting non-trivially on…
Nonadiabatic holonomic quantum computation provides the means to perform fast and robust quantum gates by utilizing the resilience of non-Abelian geometric phases to fluctuations of the path in state space. While the original scheme [New J.…
Matching problems on 3D shapes and images are challenging as they are frequently formulated as combinatorial quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard. In this work, we address such problems…
In this paper we study the implementation of non-adiabatic geometrical quantum gates with in semiconductor quantum dots. Different quantum information enconding/manipulation schemes exploiting excitonic degrees of freedom are discussed. By…
Despite the fundamental role the Quantum Satisfiability (QSAT) problem has played in quantum complexity theory, a central question remains open: At which local dimension does the complexity of QSAT transition from "easy" to "hard"? Here, we…
Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. [Suba\c{s}i et al., Phys. Rev. Lett.…
Experimental realization of a universal set of quantum logic gates is the central requirement for implementation of a quantum computer. An all-geometric approach to quantum computation offered a paradigm for implementation where all the…
We consider stimulated Raman adiabatic passage (STIRAP) processes in tripod systems and show how to generate purely geometric phase changes of the quantum states involved. The geometric phases are controlled by three laser fields where…
The 3-Satisfiability Problem (3-SAT) is a demanding combinatorial problem, of central importance among the non-deterministic polynomial (NP) complete problems, with applications in circuit design, artificial intelligence and logistics. Even…
We show that universal holonomic quantum computation (HQC) can be achieved fault-tolerantly by adiabatically deforming the gapped stabilizer Hamiltonian of the surface code, where quantum information is encoded in the degenerate ground…
We show that geometric phases may be generated in a quantum system subject to noise by adiabatic manipulations of the fluctuating fields, e.g., by variation of the system-environment coupling. For a two-state quantum system we express this…