Related papers: General impossible operations in quantum informati…
Consider the problem: Alice wishes to send the same key to $n-1$ users (Bob, Carol,. . . , Nathan), while preventing eavesdropper Eve from acquiring information without being detected. The problem has no solution in the classical…
Quantum theory is notoriously counterintuitive, and yet remains entirely self-consistent when applied universally. Here we uncover a new manifestation of its unusual consequences. We demonstrate, theoretically and experimentally (by means…
This study presents a roadmap towards utilizing a single arbitrary gate for universal quantum computing. Since two decades ago, it has been widely accepted that almost any single arbitrary gate with qubit number $>2$ is universal. Utilizing…
It is usually assumed that a quantum computation is performed by applying gates in a specific order. One can relax this assumption by allowing a control quantum system to switch the order in which the gates are applied. This provides a more…
We propose a Lyapunov control design to achieve specific (or a family of) unitary time-evolution operators, i.e., quantum gates in the Schr\"{o}dinger picture by tracking control. Two examples are presented. In the first, we illustrate how…
An intense effort is being made today to build a quantum computer. Instead of presenting what has been achieved, I invoke here analogies from the history of science in an attempt to glimpse what the future might hold. Quantum computing is…
The principle of superposition is an intriguing feature of Quantum Mechanics, which is regularly exploited at various instances. A recent work [PRL \textbf{116}, 110403 (2016)] shows that the fundamentals of Quantum Mechanics restrict the…
Recently, universally valid uncertainty relations have been established to set a precision limit for any instruments given a disturbance constraint in a form more general than the one originally proposed by Heisenberg. One of them leads to…
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…
We examine the effect of previous history on starting a computation on a quantum computer. Specifically, we assume that the quantum register has some unknown state on it, and it is required that this state be cleared and replaced by a…
We characterise a model of universal quantum computation where the register (computational) qubits are controlled by ancillary qubits, using only a single fixed interaction between register and ancillary qubits. No additional access is…
In a recent work, authors prove a yet another no-go theorem that forbids the existence of a universal probabilistic quantum protocol producing a superposition of two unknown quantum states. In this short note, we show that in the presence…
Unambiguous discrimination and exact cloning reduce the square-overlap between quantum states, exemplifying the more general type of procedure we term state separation. We obtain the maximum probability with which two equiprobable quantum…
We analyze a new scheme for quantum information processing, with superconducting charge qubits coupled through a cavity mode, in which quantum manipulations are insensitive to the state of the cavity. We illustrate how to physically…
Optimal implementation of quantum gates is crucial for designing a quantum computer. The necessary condition for optimal construction of a two-qubit unitary operation is obtained. It can be proved that the B gate is the unique gate that can…
Today's devices for quantum computing are still far from implementing useful and powerful quantum algorithms. Decoherence and the wish to resist the effects of errors in a system of quantum bits incurs a lot of overhead in the number of…
Quantum theory imposes fundamental limitations to the amount of information that can be carried by any quantum system. On the one hand, Holevo bound rules out the possibility to encode more information in a quantum system than in its…
Quantum gates are the building blocks of quantum circuits, which in turn are the cornerstones of quantum information processing. In this work, we theoretically investigate a single-step implementation of both a universal two- (CNOT) and…
We supply a rigorous proof that an open dense set of all possible 2-qubit gates G has the property that if the quantum circuit model is restricted to only permit swap of qubits lines and the application of G to pairs of lines, then the…
While the no-cloning theorem, which forbids the perfect copying of quantum states, is well-known as one of the defining features of quantum mechanics, the question of how well the theory allows a state to be cloned is yet to be completely…