Related papers: Geometric Phase Based Quantum Computation Applied …
This thesis consists of several studies performed over different few-dof quantum systems exposed to the effect of an uncontrolled environment. The primary focus of the work is to explore the relation between decoherence and…
Exploiting the similarity between adiabatic quantum algorithms and quantum phase transitions, we argue that second-order transitions -- typically associated with broken or restored symmetries -- should be advantageous in comparison to…
We construct a set of instances of 3SAT which are not solved efficiently using the simplest quantum adiabatic algorithm. These instances are obtained by picking random clauses all consistent with two disparate planted solutions and then…
The NP-complete problem of the travelling salesman (TSP) is considered in the framework of quantum adiabatic computation (QAC). We first derive a remarkable lower bound for the computation time for adiabatic algorithms in general as a…
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…
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…
Geometric phases accompanying adiabatic quantum evolutions can be used to construct robust quantum control for quantum information processing due to their noise-resilient feature. A significant development along this line is to construct…
The rise of quantum information science has opened up a new venue for applications of the geometric phase (GP), as well as triggered new insights into its physical, mathematical, and conceptual nature. Here, we review this development by…
We derive an elegant solution for a two-level system evolving adiabatically under the influence of a driving field with a time-dependent phase, which includes open system effects such as dephasing and spontaneous emission. This solution,…
Appearance of adiabatic geometric phase shift in the context of noncommutative quantum mechanics is studied using an exactly solvable model of 2D simple harmonic oscilator in Moyal plane, where momentum non-commutativity are also considered…
Adiabatic quantum control is a powerful tool for quantum engineering and a key component in some quantum computation models, where accurate control over the timing of the involved pulses is not needed. However, the adiabatic condition…
Quantum operations by utilizing the underlying geometric phases produced in physical systems are favoured due to its potential robustness. When a system in a non-degenerate eigenstate undergoes an adiabatically cyclic evolution dominated by…
We analyze the influence of a dissipative environment on geometric phases in a quantum system subject to non-adiabatic evolution. We find dissipative contributions to the acquired phase and modification of dephasing, considering the cases…
We present an approach for eliminating the gauge freedom for derivative couplings in nonadiabatic dynamics in the presence of geometric phase effects. This approach relies on a bottom-up construction of a parametric quantum Hamiltonian in…
Geometric phase (GP) independent of energy and time rely only on the geometry of state space. It has been argued to have potential fault tolerance and plays an important role in quantum information and quantum computation. We present the…
Quantum computation based on geometric phase is generally believed to be more robust against certain errors or noises than the conventional dynamical strategy. However, the gate error caused by the decoherence effect is inevitable, and thus…
A quantum algorithm is proposed to solve the Satisfiability problems by the ground-state quantum computer. The scale of the energy gap of the ground-state quantum computer is analyzed for the 3-bit Exact Cover problem. The time cost of this…
Quantum computation with quantum gates induced by geometric phases is regarded as a promising strategy in fault tolerant quantum computation, due to its robustness against operational noises. However, because of the parametric restriction…
The quantum geometric tensor has established itself as a general framework for the analysis and detection of equilibrium phase transitions in isolated quantum systems. We propose a novel generalization of the quantum geometric tensor, which…
The Boolean constraint satisfaction problem 3-SAT is arguably the canonical NP-complete problem. In contrast, 2-SAT can not only be decided in polynomial time, but in fact in deterministic linear time. In 2006, Bravyi proposed a physically…