Related papers: Quantum algorithms for Josephson networks
We investigate the design and functionality of a network of loop-shaped charge qubits with switchable nearest-neighbor coupling. The qubit coupling is achieved by placing large Josephson junctions at the intersections of the qubit loops and…
Quantum algorithms require a universal set of gates that can be implemented in a physical system. For these, an optimal decomposition into a sequence of available operations is desired. Here, we present a method to find such sequences for a…
Realistic physical implementations of quantum computers can entail tradeoffs which depart from the ideal model of quantum computation. Although these tradeoffs have allowed successful demonstration of certain quantum algorithms, a crucial…
Several physical realizations of quantum bits have been proposed. Of those, nano-electronic devices appear most suitable for large-scale integration and potential applications. We suggest to use low-capacitance Josephson junctions,…
We discuss three applications of efficient quantum algorithms to determining properties of permutations and group automorphisms. The first uses the Bernstein-Vazirani algorithm to determine an unknown homomorphism from $Z_{p-1}^{m}$ to…
Measurement-based quantum computing (MBQC), an alternate paradigm for formulating quantum algorithms, can lead to potentially more flexible and efficient implementations as well as to theoretical insights on the role of entanglement in a…
Gate model quantum computers with too many qubits to be simulated by available classical computers are about to arrive. We present a strategy for programming these devices without error correction or compilation. This means that the number…
Low-capacitance Josephson junctions, where Cooper pairs tunnel coherently while Coulomb blockade effects allow the control of the total charge, provide physical realizations of quantum bits (qubits), with logical states differing by one…
An NMR realization of a two-qubit quantum gate which processes quantum information indirectly via couplings to a spectator qubit is presented in the context of the Deutsch-Jozsa algorithm. This enables a successful comprehensive NMR…
We propose an effective scheme for manipulating quantum information stored in a superconducting nanocircuit. The Josephson qubits are coupled via their separate interactions with an information bus, a large current-biased Josephson junction…
A process tomography based optimization scheme for open quantum systems is used to determine the performance limits of Josephson charge qubits within current experimental means. The qubit is modeled microscopically as an open quantum system…
Gate model quantum computers promise to solve currently intractable computational problems if they can be operated at scale with long coherence times and high fidelity logic. Neutral atom hyperfine qubits provide inherent scalability due to…
Near-term quantum computers are limited by the decoherence of qubits to only being able to run low-depth quantum circuits with acceptable fidelity. This severely restricts what quantum algorithms can be compiled and implemented on such…
Quantum algorithms could efficiently solve certain classically intractable problems by exploiting quantum parallelism. To date, whether the quantum entanglement is useful or not for quantum computing is still a question of debate. Here, we…
A scheme for the generation of the cluster states based on the Josephson charge qubit is proposed. The two-qubit generating case is first introduced, and then generalized to multi-qubit case. The scheme is simple and easily manipulated,…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
We analyze the operation of quantum gates for neutral atoms with qubits that are delocalized in space, i.e., the computational basis states are defined by the presence of a neutral atom in the ground state of one out of two trapping…
While quantum computers promise significant advantages, the complexity of quantum algorithms remains a major technological obstacle. We have developed and demonstrated an architecture-independent technique that simplifies adding control…
Bernstein and Varizani have given the first quantum algorithm to solve parity problem in which a strong violation of the classical imformation theoritic bound comes about. In this paper, we refine this algorithm with fewer resource and…
We report the first experimental demonstration of an all-optical one-way implementation of Deutsch's quantum algorithm on a four-qubit cluster state. All the possible configurations of a balanced or constant function acting on a two-qubit…