Related papers: Time Independent Universal Computing with Spin Cha…
We present a garbling scheme for quantum circuits, thus achieving a decomposable randomized encoding scheme for quantum computation. Specifically, we show how to compute an encoding of a given quantum circuit and quantum input, from which…
We propose a platform for implementing a universal, globally driven quantum computer based on a 2D ladder hosting three different species of superconducting qubits. In stark contrast with the existing literature, our scheme exploits the…
Both discrete and continuous systems can be used to encode quantum information. Most quantum computation schemes propose encoding qubits in two-level systems, such as a two-level atom or an electron spin. Others exploit the use of an…
Holonomic Quantum Computation (HQC) is an all-geometrical approach to quantum information processing. In the HQC strategy information is encoded in degenerate eigen-spaces of a parametric family of Hamiltonians. The computational network of…
We present a novel scheme for universal quantum computation based on spinless interacting bosonic quantum walkers on a piecewise-constant graph, described by the two-dimensional Bose-Hubbard model. Arbitrary X and Z rotations are…
Collective spins of large atomic samples trapped inside optical resonators can carry quantum information that can be processed in a way similar to quantum computation with continuous variables. It is shown here that by combining the…
We show, within the circuit model, how any quantum computation can be efficiently performed using states with only real amplitudes (a result known within the Quantum Turing Machine model). This allows us to identify a 2-qubit (in fact…
Implementation of quantum information processing faces the contradicting requirements of combining excellent isolation to avoid decoherence with the ability to control coherent interactions in a many-body quantum system. For example, spin…
In this paper we examine the use of an adiabatic quantum data transfer protocol to build a universal quantum computer. Single qubit gates are realized by using a bus protocol to transfer qubits of information down a spin chain with a…
We describe a quantum information processor (quantum computer) based on the hyperfine interactions between the conduction electrons and nuclear spins embedded in a two-dimensional electron system in the quantum-Hall regime. Nuclear spins…
Cluster algorithms are developed for simulating quantum spin systems like the one- and two-dimensional Heisenberg ferro- and anti-ferromagnets. The corresponding two- and three-dimensional classical spin models with four-spin couplings are…
Cluster algorithms are developed for simulating quantum spin systems like the one- and two-dimensional Heisenberg ferro- and anti-ferromagnets. The corresponding two- and three-dimensional classical spin models with four-spin couplings are…
In topological quantum computation the geometric details of a particle trajectory are irrelevant; only the topology matters. Taking this one step further, we consider a model of computation that disregards even the topology of the particle…
A bit-quantum map relates probabilistic information for Ising spins or classical bits to quantum spins or qubits. Quantum systems are subsystems of classical statistical systems. The Ising spins can represent macroscopic two-level…
The nonadiabatic holonomic quantum computation based on the geometric phase is robust against the built-in noise and decoherence. In this work, we theoretically propose a scheme to realize nonadiabatic holonomic quantum gates in a surface…
This work proposes a scalable framework for topological quantum computing using Matryoshka-type Sine-Cosine chains. These chains support high-dimensional qudit encoding within single systems, reducing the physical resource overhead compared…
We propose a scheme for quantum information processing based on donor electron spins in semiconductors, with an architecture complementary to the original Kane proposal. We show that a naive implementation of electron spin qubits provides…
Continuous-time quantum walk is one of the alternative approaches to quantum computation, where a universal set of quantum gates can be achieved by scattering a quantum walker on some specially-designed structures embedded in a sparse graph…
We compare four different encoding schemes for the quantum computing of spin chains with a spin quantum number $S>1/2$: a compact mapping, a direct (or one-hot) mapping, a Dicke mapping, and a qudit mapping. The three different qubit…
Frequency-bin encoding offers tremendous potential in quantum photonic information processing, in which a single waveguide can support hundreds of lightpaths in a naturally phase-stable fashion. This stability, however, comes at a cost:…