Related papers: Perfect NOT transformation and conjugate transform…
Quantum states with nonlinear squeezing are a necessary resource for deterministic implementation of high-order quadrature phase gates that are, in turn, sufficient for advanced quantum information processing. We demonstrate that this class…
The universal quantum computer is a device capable of simulating any physical system and represents a major goal for the field of quantum information science. Algorithms performed on such a device are predicted to offer significant gains…
Quantum computing can be realized with numerous different hardware platforms and computational protocols. A highly promising approach to foster scalability is to apply a photonic platform combined with a measurement-induced quantum…
We investigate the probabilistic cloning and purification of quantum states. The performance of these probabilistic operations is quantified by the average fidelity between the ideal and actual output states. We provide a simple formula for…
We consider a model of quantum computation using qubits where it is possible to measure whether a given pair are in a singlet (total spin $0$) or triplet (total spin $1$) state. The physical motivation is that we can do these measurements…
The coherence transformation is pivotal for quantum technologies, which cannot always be accomplished deterministically. We investigate the probabilistic coherence transformation under strictly incoherent operations. To this end, by virtue…
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…
Faults are stochastic by nature while most man-made systems, and especially computers, work deterministically. This necessitates the linking of probability theory with mathematical logics, automata, and switching circuit theory. This paper…
We employ quantum optimal control theory to realize quantum gates for two protected superconducting circuits: the heavy-fluxonium qubit and the 0-$\pi$ qubit. Utilizing automatic differentiation facilitates the simultaneous inclusion of…
Photonic quantum computing has gained significant interest in recent years due to its potential for scaling to large numbers of qubits. A critical requirement for fault-tolerant quantum computation is the reliable generation of non-Gaussian…
State-dependent cloning machines that have so far been considered either deterministically copy a set of states approximately, or probablistically copy them exactly. In considering the case of two equiprobable pure states, we derive the…
Quantum state exclusion is the task of determining which states from a given set a system was not prepared in. We provide a complete solution to optimal quantum state exclusion for arbitrary sets of pure states generated by finite groups,…
We propose a new implementation of a universal set of one- and two-qubit gates for quantum computation using the spin states of coupled single-electron quantum dots. Desired operations are effected by the gating of the tunneling barrier…
In a quantum computer, creating superpositions of quantum bits (qubits) in different states can lead to a speed-up over classical computers [1], but quantum mechanics also allows for the superposition of quantum circuits [2]. In fact, it…
We introduce photonic architectures for universal quantum computation. The first step is to produce a resource state which is a superposition of the first four Fock states with a probability $\geq 10^{-2}$, an increase by a factor of $10^4$…
Port-based teleportation (PBT) is a form of quantum teleportation in which no corrective unitary is required on the part of the receiver. Two primary regimes exist - deterministic PBT in which teleportation is always successful, but is…
Probabilistically creating n perfect clones from m copies for one of N priori known quantum states with minimum failure probability is a long-standing problem. We provide a rigorous proof for the geometric approach to this probabilistic…
It is shown that a family of analytically solvable pulses can be used to obtain high fidelity quantum phase gates with surprising robustness against imperfections in the system or pulse parameters. Phase gates are important because they can…
A key requirement to perform simulations of large quantum systems on near-term quantum hardware is the design of quantum algorithms with short circuit depth that finish within the available coherence time. A way to stay within the limits of…
We propose a method for decomposing continuous-variable operations into a universal gate set, without the use of any approximations. We fully characterize a set of transformations admitting exact decompositions and describe a process for…