Related papers: Preparation of 3-qubit states
Singlet-triplet states in double quantum dots are promising realizations of qubits, and capacitive coupling can be used to create entanglement between these qubits. We propose an entangling three-qubit gate of singlet-triplet qubits in a…
Preparing quantum states is a fundamental task in various quantum algorithms. In particular, state preparation in quantum harmonic oscillators (HOs) is crucial for the creation of qudits and the implementation of high-dimensional…
Quantum bits, or qubits, are the fundamental building blocks of present quantum computers. Hence, it is important to be able to characterize the state of a qubit as accurately as possible. By evaluating the qubit characterization problem…
This paper considers a class of qubit channels for which three states are always sufficient to achieve the Holevo capacity. For these channels it is known that there are cases where two orthogonal states are sufficient, two non-orthogonal…
Quantum circuits currently constitute a dominant model for quantum computation. Our work addresses the problem of constructing quantum circuits to implement an arbitrary given quantum computation, in the special case of two qubits. We…
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…
It is shown that generic N-party pure quantum states (with equidimensional subsystems) are uniquely determined by their reduced states of just over half the parties; in other words, all the information in almost all N-party pure states is…
While the question ``how many CNOT gates are needed to simulate an arbitrary two-qubit operator'' has been conclusively answered -- three are necessary and sufficient -- previous work on this topic assumes that one wants to simulate a given…
A specific class of partially entangled states known as Knill-Laflamme-Milburn states (or KLM states) has been proved to be useful in relation to quantum information processing [Knill et al., Nature 409, 46 (2001)]. Although the usage of…
We present a one-shot method for preparing pure entangled states between a sender and a receiver at a minimal cost of entanglement and quantum communication. In the case of preparing unentangled states, an earlier paper showed that a…
We describe a mechanism for realizing a controlled phase gate for solid-state charge qubits. By augmenting the positionally defined qubit with an auxiliary state, and changing the charge distribution in the three-dot system, we are able to…
We give a pair of algorithms that efficiently learn a quantum state prepared by Clifford gates and $O(\log n)$ non-Clifford gates. Specifically, for an $n$-qubit state $|\psi\rangle$ prepared with at most $t$ non-Clifford gates, our…
We address the issue of improving the quality of the joint remote preparation of an arbitrary two-qubit in case four qubits of the quantum channel which consists of a GHZ state and a GHZ-like one are subjected to noises. Two controlling…
Quantum state preparation is an important subroutine in many quantum algorithms. The goal is to encode classical information directly to the quantum state so that it is possible to leverage quantum algorithms for data processing. However,…
We show that it is possible to reduce the number of two-qubit gates needed for the construction of an arbitrary controlled-unitary transformation by up to two times using a tunable controlled-phase gate. On the platform of linear optics,…
We present a detailed, realistic analysis of the implementation of a proposal for a quantum phase gate based on atomic vibrational states, specializing it to neutral rubidium atoms on atom chips. We show how to create a double--well…
For a tripartite pure state of three qubits, it is well known that there are two inequivalent classes of genuine tripartite entanglement, namely the GHZ-class and the W-class. Any two states within the same class can be transformed into…
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…
As the field of quantum computing grows, novel algorithms which take advantage of quantum phenomena need to be developed. As we are currently in the NISQ (noisy intermediate scale quantum) era, quantum algorithm researchers cannot reliably…
Gate model quantum computers promise to solve currently intractable computational problems if they can be operated at scale with long coherence times and high fidelity logic. Neutral atom hyperfine qubits provide inherent scalability due to…