Related papers: Universal Manipulation of a Single Qubit
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…
Methods of optimal control are applied to a model system of interacting two-level particles (e.g., spin-half atomic nuclei or electrons or two-level atoms) to produce high-fidelity quantum gates while simultaneously negating the detrimental…
We demonstrate universal quantum control over chains of ions in a surface-electrode ion trap, including all the fundamental operations necessary to perform algorithms in a one-dimensional, nearest-neighbor quantum computing architecture. We…
Phase estimation is used in many quantum algorithms, particularly in order to estimate energy eigenvalues for quantum systems. When using a single qubit as the probe (used to control the unitary we wish to estimate the eigenvalue of), it is…
We show that the minimum experimental effort to characterize the proper functioning of a quantum device scales as 2^n for n qubits and requires classical computational resources ~ n^2 2^{3n}. This represents an exponential reduction…
There is currently a significant need for robust and efficient methods for characterizing quantum devices. While there has been significant progress in this direction, there remains a crucial need to precisely determine the strength and…
We prove that universal quantum computation is possible using only (i) the physically natural measurement on two qubits which distinguishes the singlet from the triplet subspace, and (ii) qubits prepared in almost any three different…
We demonstrate how insights gained from reformulating the problem of quantum teleportation into one of reversing quantum operations, and designing optimum completely positive maps for teleportation, can enable one to explore optimal…
We study optimal perfect distinguishability between a unitary and a general quantum operation. In 2-dimensional case we provide a simple sufficient and necessary condition for sequential perfect distinguishability and an analytical formula…
The recently demonstrated trapping and laser cooling of $^{133}$Ba$^+$ has opened the door to the use of this nearly ideal atom for quantum information processing. However, before high fidelity qubit operations can be performed, a number of…
Two level quantum mechanical systems like spin 1/2 particles lend themselves as a natural qubit implementation. However, encoding a single qubit in several spins reduces the resources necessary for qubit control and can protect from…
We show that optimizing a quantum gate for an open quantum system requires the time evolution of only three states irrespective of the dimension of Hilbert space. This represents a significant reduction in computational resources compared…
Contemporary quantum computers encode and process quantum information in binary qubits (d = 2). However, many architectures include higher energy levels that are left as unused computational resources. We demonstrate a superconducting…
In this paper, we study the optimal simulation of three-qubit unitary by using two-qubit gates. First, we give a lower bound on the two-qubit gates cost of simulating a multi-qubit gate. Secondly, we completely characterize the two-qubit…
Quantum states can be used to encode the information contained in a direction, i.e., in a unit vector. We present the best encoding procedure when the quantum state is made up of $N$ spins (qubits). We find that the quality of this optimal…
We establish the best possible approximation to a perfect quantum cloning machine which produces two clones out of a single input. We analyze both universal and state-dependent cloners. The maximal fidelity of cloning is shown to be 5/6 for…
After the appearance of the no-cloning theorem, approximate quantum cloning machines (QCMs) have become one of the most well-studied subject in quantum information theory. Among several measures to quantify the performance of a QCM,…
Optimal quantum machines can be implemented by linear projective operations. In the present work a general qubit symmetrization theory is presented by investigating the close links to the qubit purification process and to the programmable…
We study fidelity susceptibility in one-dimensional asymmetric Hubbard model, and show that the fidelity susceptibility can be used to identify the universality class of the quantum phase transitions in this model. The critical exponents…
We give quantum circuits that simulate an arbitrary two-qubit unitary operator up to global phase. For several quantum gate libraries we prove that gate counts are optimal in worst and average cases. Our lower and upper bounds compare…