Related papers: Advantages and limitations of quantum routing
A quantum walk places a traverser into a superposition of both graph location and traversal "spin." The walk is defined by an initial condition, an evolution determined by a unitary coin/shift-operator, and a measurement based on the…
By analyzing the key properties of black holes from the point of view of quantum information, we derive a model-independent picture of black hole quantum computing. It has been noticed that this picture exhibits striking similarities with…
Accurate, nontrivial quantum operations on many qubits are experimentally challenging. As opposed to the standard approach of compiling larger unitaries into sequences of 2-qubit gates, we propose a protocol on Hamiltonian control fields…
Quantum teleportation allows one to transmit an arbitrary qubit from point A to point B using a pair of (pre-shared) entangled qubits and classical bits of information. The conventional protocol for teleportation uses two bits of classical…
We have previously discussed the design of a neutral atom quantum computer with an on-demand interaction [E. Hosseini Lapasar, et al., J. Phys. Soc. Jpn. 80, 114003 (2011)]. In this contribution, we propose an experimental method to…
Quantum computing is an emerging technology that has the potential to revolutionize fields such as cryptography, machine learning, optimization, and quantum simulation. However, a major challenge in the realization of quantum algorithms on…
High-connectivity circuits are a major roadblock for current quantum hardware. We propose a hybrid classical-quantum algorithm to simulate such circuits without swap-gate ladders. As main technical tool, we introduce…
In an ordinary quantum algorithm the gates are applied in a fixed order on the systems. The introduction of indefinite causal structures allows to relax this constraint and control the order of the gates with an additional quantum state. It…
Quantum simulators, machines that can replicate the dynamics of quantum systems, are being built as useful devices and are seen as a stepping stone to universal quantum computers. A key difference between the two is that computers have the…
Classical communication is the basis for many of our current and future technologies, such as mobile phones, video conferences, autonomous vehicles and particularly the internet. In contrast, quantum communication is governed by the laws of…
We analyze in detail the proposal for a two-qubit gate for travelling single-photon qubits recently presented by C. Ottaviani \emph{et al}. [Phys. Rev. A \textbf{73}, 010301(R) (2006)]. The scheme is based on an ensemble of five-level atoms…
Single qubit rotation gate and the controlled-NOT (CNOT) gate constitute a complete set of gates for universal quantum computation. In general the CNOT gate are only for two nearby qubits. For two qubits which are remote from each other, we…
In circuit-based quantum computing, the available gate set typically consists of single-qubit gates acting on each individual qubit and at least one entangling gate between pairs of qubits. In certain physical architectures, however, some…
A crucial step towards the 6th generation (6G) of networks would be a shift in communication paradigm beyond the limits of Shannon's theory. In both classical and quantum Shannon's information theory, communication channels are generally…
We address routing of classical and quantum information over quantum network, and show how to exploit chirality to achieve nearly optimal and robust transport. In particular, we prove how continuous time chiral quantum walks over a minimal…
With unprecedented increases in traffic load in today's wireless networks, design challenges shift from the wireless network itself to the computational support behind the wireless network. In this vein, there is new interest in…
Models for quantum computation with circuit connections subject to the quantum superposition principle have been recently proposed. There, a control quantum system can coherently determine the order in which a target quantum system…
Any single-qubit unitary operation or quantum gate can be considered a rotation. Typical experimental implementations of single-qubit gates involve two or three fixed rotation axes, and up to three rotation steps. Here we show that, if the…
We investigate the amount of noise required to turn a universal quantum gate set into one that can be efficiently modelled classically. This question is useful for providing upper bounds on fault tolerant thresholds, and for understanding…
A universal quantum computing scheme, with a universal set of logical gates, is proposed based on networks of 1D quantum systems. The encoding of information is in terms of universal features of gapped phases, for which effective field…