Related papers: Holonomic Quantum Computation
We investigate the influence of random errors in external control parameters on the stability of holonomic quantum computation in the case of arbitrary loops and adiabatic connections. A simple expression is obtained for the case of small…
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…
In this review we consider the performance of the quantum adiabatic algorithm for the solution of decision problems. We divide the possible failure mechanisms into two sets: small gaps due to quantum phase transitions and small gaps due to…
We investigate how to carry out universal quantum computation deterministically with free electrons in decoherence-free subspace by using polarizing beam splitters, charge detectors, and single-spin rotations. Quantum information in our…
Quantum computation can proceed solely through single-qubit measurements on an appropriate quantum state, such as the ground state of an interacting many-body system. We investigate a simple spin-lattice system based on the cluster-state…
We characterise a model of universal quantum computation where the register (computational) qubits are controlled by ancillary qubits, using only a single fixed interaction between register and ancillary qubits. No additional access is…
The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are unitary topological modular functors. They underlie the Jones polynomial and arise in Witten-Chern-Simons…
A universal set of gates for (classical or quantum) computation is a set of gates that can be used to approximate any other operation. It is well known that a universal set for classical computation augmented with the Hadamard gate results…
Previous schemes of nonadiabatic holonomic quantum computation were focused mainly on realizing a universal set of elementary gates. Multiqubit controlled gates could be built by decomposing them into a series of the universal gates. In…
We construct a simple translationally invariant, nearest-neighbor Hamiltonian on a chain of 10-dimensional qudits that makes it possible to realize universal quantum computing without any external control during the computational process.…
The mathematical structure of homogeneous loop quantum cosmology is analyzed, starting with and taking into account the general classification of homogeneous connections not restricted to be Abelian. As a first consequence, it is seen that…
Bosonic quantum conversion systems can be modeled by many-particle single-mode Hamiltonians describing a conversion of $n$ molecules of type A into $m$ molecules of type B and vice versa. These Hamiltonians are analyzed in terms of…
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…
Linear-Optical Passive (LOP) devices and photon counters are sufficient to implement universal quantum computation with single photons, and particular schemes have already been proposed. In this paper we discuss the link between the…
Digital-analog quantum computing is a computational paradigm which employs an analog Hamiltonian resource together with single-qubit gates to reach universality. Here, we design a new scheme which employs an arbitrary two-body source…
Quantum walks are the quantum-mechanical analog of random walks, in which a quantum `walker' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution…
Let ${\cal H}$ be the state-space of a quantum computer coupled with the environment by a set of error operators spanning a Lie algebra ${\cal L}.$ Suppose ${\cal L}$ admits a noiseless quantum code i.e., a subspace ${\cal C}\subset{\cal…
We present an experimentally feasible scheme to implement holonomic quantum computation in the ultrastrong-coupling regime of light-matter interaction. The large anharmonicity and the Z2 symmetry of the quantum Rabi model allow us to build…
A fundamental requirement of quantum information processing is the protection from the adverse effects of decoherence and noise. Decoherence-free subspaces and geometric processing are important steps of quantum information protection.…
Quantum systems with adiabatic classical parameters are widely studied, e.g., in the modern holonomic quantum computation. We here provide complete geometric quantization of a Hamiltonian system with time-dependent parameters, without the…