Related papers: Asymmetric two-output quantum processor in any dim…
Superconducting qubits provide a promising approach to large-scale fault-tolerant quantum computing. However, qubit connectivity on a planar surface is typically restricted to only a few neighboring qubits. Achieving longer-range and more…
We propose a universal quantum computing scheme in which the orthogonal qubit states $|0>$ and $|1>$ are identical in their single-particle spin and charge properties. Each qubit is contained in a single quantum dot and gate operations are…
We show that any classical two-way communication protocol with shared randomness that can approximately simulate the result of applying an arbitrary measurement (held by one party) to a quantum state of $n$ qubits (held by another), up to…
We propose an efficient scheme for constructing arbitrary 2-D cluster states using probabilistic entangling quantum gates.In our scheme, the 2-D cluster state is constructed with star-like basic units generated from 1-D cluster chains.By…
We argue that the analog nature of quantum computing makes the usual design approach of constructing complicated logical operations from many simple gates inappropriate. Instead, we propose to design multi-spin quantum gates in which the…
Most quantum computer realizations require the ability to apply local fields and tune the couplings between qubits, in order to realize single bit and two bit gates which are necessary for universal quantum computation. We present a scheme…
The trade-offs among various output fidelities of asymmetric universal cloning machines are investigated. First we find out all the attainable optimal output fidelities for the 1 to 3 asymmetric universal cloning machine and it turns out…
We analyze a reversibility of optimal Gaussian $1\to 2$ quantum cloning of a coherent state using only local operations on the clones and classical communication between them and propose a feasible experimental test of this feature.…
In many practical applications, quantum algorithms require several qubits, significantly more than those available with current noisy intermediate-scale quantum processors. Distributed quantum computing (DQC) is considered a scalable…
Quantum processors which combine the long decoherence times of spin qubits together with fast optical manipulation of excitons have recently been the subject of several proposals. I show here that arbitrary single- and entangling two-qubit…
Optimal construction of quantum operations is a fundamental problem in the realization of quantum computation. We here introduce a newly discovered quantum gate, B, that can implement any arbitrary two-qubit quantum operation with minimal…
According to the statistical interpretation of quantum theory, quantum computers form a distinguished class of probabilistic machines (PMs) by encoding n qubits in 2n pbits (random binary variables). This raises the possibility of a…
Although perfect copying of an unknown quantum state is not possible, approximate cloning is possible in quantum mechanics. Quantum telecloning is a variant of approximate quantum cloning which uses quantum teleportation to allow for the…
In noisy intermediate-scale quantum computing, the limited scalability of a single quantum processing unit (QPU) can be extended through distributed quantum computing (DQC), in which one can implement global operations over two QPUs by…
Recently, the nonlocal optimal probabilistic cloning (NLOPC) of two non-orthogonal qubit states has been proposed [Phys. Rev. A 86, 052332 (2012)] by means of an experimental setup based on a pair of twin photons in a maximally entangled…
A cryptographic algorithm is proposed based on fully quantum mechanical keys and ciphers. Encryption and decryption are carried out via an appropriate measurement process on entangled states as governed by a quantum mechanical, asymmetrical…
While quantum speed-up in solving certain decision problems by a fault-tolerant universal quantum computer has been promised, a timely research interest includes how far one can reduce the resource requirement to demonstrate a provable…
Quantum computing is currently limited by the cost of two-qubit entangling operations. In order to scale up quantum processors and achieve a quantum advantage, it is crucial to economize on the power requirement of two-qubit gates, make…
By using 2-photon 4-qubit cluster states we demonstrate deterministic one-way quantum computation in single qubit rotation algorithm. In this operation feed-forward measurements are automatically implemented by properly choosing the…
We present generalized and improved constructions for simulating quantum computers with a polynomial slowdown on lattices composed of qubits on which certain global versions of one- and two-qubit operations can be performed.