Related papers: Distributed Quantum Computation Based-on Small Qua…
In the distributed quantum computing paradigm, well-controlled few-qubit `nodes' are networked together by connections which are relatively noisy and failure prone. A practical scheme must offer high tolerance to errors while requiring only…
We investigate an optically driven quantum computer based on electric dipole transitions within coupled single-electron quantum dots. Our quantum register consists of a freestanding n-type pillar containing a series of pair wise coupled…
We provide algorithms for efficiently addressing quantum memory in parallel. These imply that the standard circuit model can be simulated with low overhead by the more realistic model of a distributed quantum computer. As a result, the…
Creation and manipulation of entanglement with low error is essential in quantum information systems. In practice, two-qubit entangling gates constitute a dominant error source, limiting circuit depths and performance in fault-tolerant…
We introduce a repeater scheme to efficiently distribute multipartite entangled states in a quantum network with optimal scaling. The scheme allows to generate graph states such as 2D and 3D cluster states of growing size or GHZ states over…
We present a detailed rate analysis for a hybrid quantum repeater assuming perfect memories and using optimal probabilistic entanglement generation and deterministic swapping routines. The hybrid quantum repeater protocol is based on atomic…
We introduce a quantum voting protocol that uses superposition and entanglement to enable secure, anonymous voting in both centralized and distributed settings. Votes are encoded via phase-flip operations on entangled candidate states,…
Protocols for distributed quantum systems commonly require the simultaneous availability of $n$ entangled states, each with a fidelity above some fixed minimum $F_{\mathrm{app}}$ relative to the target maximally-entangled state. However,…
Quantum sampling, a fundamental subroutine in numerous quantum algorithms, involves encoding a given probability distribution in the amplitudes of a pure state. Given the hefty cost of large-scale quantum storage, we initiate the study of…
A key requirement for scalable quantum computing is that elementary quantum gates can be implemented with sufficiently low error. One method for determining the error behavior of a gate implementation is to perform process tomography.…
Although the realization of useful quantum computers poses significant challenges, swift progress in emerging quantum technologies is making this goal realistically approachable. In this context, one of the essential resources is quantum…
Rapid advancements in cloud based platforms providing access to quantum computing capabilities have opened up several challenges for efficient usage of these highly delicate and costly devices. Although most of the current systems use a…
The creation of complex entangled states, resources that enable quantum computation, can be achieved via simple 'probabilistic' operations which are individually likely to fail. However, typical proposals exploiting this idea carry a severe…
Quantum computers can solve certain problems more efficiently than any possible conventional computer. Small quantum algorithms have been demonstrated on multiple quantum computing platforms, many specifically tailored in hardware to…
We describe a quantum algorithm to prepare an arbitrary pure state of a register of a quantum computer with fidelity arbitrarily close to 1. Our algorithm is based on Grover's quantum search algorithm. For sequences of states with suitably…
Today's most advanced ion trap quantum computers have significant overhead due to the need for dual-species operation. Looking ahead, logical qubit register sizes will be limited by the encoding rate needed to correct generic Pauli errors.…
We propose and analyze the design of a programmable photonic integrated circuit for high-fidelity quantum computation and simulation. We demonstrate that the reconfigurability of our design allows us to overcome two major impediments to…
We study how entanglement among the register qubits affects the gate fidelity in the one-way quantum computation if a measurement is inaccurate. We derive an inequality which shows that the mean gate fidelity is upper bounded by a…
We propose a realistic protocol to generate entanglement between quantum memories at neighboring nodes in hybrid quantum repeaters. Generated entanglement includes only one type of error, which enables efficient entanglement distillation.…
The simulation of complex quantum systems on a quantum computer is studied, taking the kicked Harper model as an example. This well-studied system has a rich variety of dynamical behavior depending on parameters, displays interesting…