相关论文: Geometric Quantum Computation on Solid-State Qubit…
We propose an all-geometric implementation of quantum computation using neutral atoms in cavity QED. We show how to perform generic single- and two-qubit gates, the latter by encoding a two-atom state onto a single, many-level atom. We…
We illustrate how geometric gauge forces and topological phase effects emerge in quantum systems without employing assumptions that rely on adiabaticity. We show how geometric magnetism may be harnessed to engineer novel quantum devices…
Computational complexity is a new quantum information concept that may play an important role in holography and in understanding the physics of the black hole interior. We consider quantum computational complexity for $n$ qubits using…
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…
In the last decade, the development of new ideas in quantum theory, including geometric and deformation quantization, the non-Abelian Berry factor, super- and BRST symmetries, non-commutativity, has called into play the geometric techniques…
Quantum Hamiltonian Computing is a recent approach that uses quantum systems, in particular a single molecule, to perform computational tasks. Within this approach, we present explicit methods to construct logic gates using two different…
The holonomic approach to controlling (nitrogen-vacancy) NV-center qubits provides an elegant way of theoretically devising universal quantum gates that operate on qubits via calculable microwave pulses. There is, however, a lack of…
Using a quantumlike description for light propagation in nonhomogeneous optical fibers, quantum information processing can be implemented by optical means. Quantum-like bits (qulbits) are associated to light modes in the optical fiber and…
Holonomic quantum computation exploits a quantum state's non-trivial, matrix-valued geometric phase (holonomy) to perform fault-tolerant computation. Holonomies arising from systems where the Hamiltonian traces a continuous path through…
Low-capacitance Josephson junction arrays in the parameter range where single charges can be controlled are suggested as possible physical realizations of the elements which have been considered in the context of quantum computers. We…
The second quantized approach to geometric phases is reviewed. The second quantization generally induces a hidden local (time-dependent) gauge symmetry. This gauge symmetry defines the parallel transport and holonomy, and thus it controls…
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…
We elaborate the idea of quantum computation through measuring the correlation of a gapped ground state, while the bulk Hamiltonian is utilized to stabilize the resource. A simple computational primitive, by pulling out a single spin…
Quantum computation has revolutionary potential for speeding algorithms and for simulating quantum systems such as molecules. We report here a quantum computer design that performs universal quantum computation within a single…
Adiabatic $U(2)$ geometric phases are studied for arbitrary quantum systems with a three-dimensional Hilbert space. Necessary and sufficient conditions for the occurrence of the non-Abelian geometrical phases are obtained without actually…
In a recent Letter [Phys. Rev. Lett. {\bf 95}, 080502 (2005)], an interesting scheme was proposed to implement a type of conditional quantum phase gates with built-in fault-tolerant feature via adiabatic evolution of dark eigenstates. 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.
Determining the quantum circuit complexity of a unitary operation is closely related to the problem of finding minimal length paths in a particular curved geometry [Nielsen et al, Science 311, 1133-1135 (2006)]. This paper investigates many…
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…
The method of geometric quantization is applied to a particle moving on an arbitrary Riemannian manifold $Q$ in an external gauge field, that is a connection on a principal $H$-bundle $N$ over $Q$. The phase space of the particle is a…