We show how to fully characterize a quantum process in an open quantum system. We particularize the procedure to the case of a universal two-qubit gate in a quantum computer. We illustrate the method with a numerical simulation of a quantum gate in the ion trap quantum computer.
CALA-$n$: A Quantum Library for Realizing Cost-Effective 2-, 3-, 4-, and 5-bit Gates on IBM Quantum Computers using Bloch Sphere Approach, Clifford+T Gates, and Layouts
We give three new algorithms for efficient in-place estimation, without using ancilla qubits, of average fidelity of a quantum logic gate acting on a d-dimensional system using much fewer random bits than what was known so far. Previous approaches for efficient estimation of average gate fidelity replaced Haar random unitaries in the naive estimation algorithm by approximate unitary 2-designs, and sampled them uniformly and independently. In contrast, in our first algorithm we sample the unitaries of the approximate unitary 2-design uniformly using a limited independence pseudorandom generator…
Near-term quantum computers are primarily limited by errors in quantum operations (or gates) between two quantum bits (or qubits). A physical machine typically provides a set of basis gates that include primitive 2-qubit (2Q) and 1-qubit (1Q) gates that can be implemented in a given technology. 2Q entangling gates, coupled with some 1Q gates, allow for universal quantum computation. In superconducting technologies, the current state of the art is to implement the same 2Q gate between every pair of qubits (typically an XX- or XY-type gate). This strict hardware uniformity requirement for 2Q gat…
Conditional multi-qubit gates are a key component for elaborate quantum algorithms. In a recent work, Rasmussen et al. (Phys. Rev. A 101, 022308) proposed an efficient single-step method for a prototypical multi-qubit gate, a Toffoli gate, based on a combination of Ising interactions between control qubits and an appropriate driving field on a target qubit. Trapped ions are a natural platform to implement this method, since Ising interactions mediated by phonons have been demonstrated in increasingly large ion crystals. However, the simultaneous application of these interactions and the drivin…
The family of $n$-bit Toffoli gates, with the two-bit Toffoli gate as the figurehead, are of great interest in quantum information as they can be used as universal gates and in quantum error correction, among other things. We present a single-step implementation of arbitrary $n$-bit Toffoli gates (up to a local change of basis), based on resonantly driving a single qubit that has a strong Ising coupling to $n$ other qubits. The setup in the two-qubit case turns out to be identical to the universal Barenco gate. The gate time and error are, in theory, independent of the number of control qubits…
Reversible logic gates were previously implemented in superconducting circuits as adiabatic-reversible gates, which are powered with a sufficiently slow clock. In contrast, we are studying ballistic-reversible gates, where fluxons serve to both encode the information and power the gates. No power is applied to the gate apart from the energy of the input fluxons, and the two possible flux polarities represent the bit states. Undamped long Josephson junctions (LJJs), where fluxons move at practically constant speed from inertia, form the input and output channels of the gates. LJJs are connected…
Although qubit coherence times and gate fidelities are continuously improving, logical encoding is essential to achieve fault tolerance in quantum computing. In most encoding schemes, correcting or tracking errors throughout the computation is necessary to implement a universal gate set without adding significant delays in the processor. Here we realize a classical control architecture for the fast extraction of errors based on multiple cycles of stabilizer measurements and subsequent correction. We demonstrate its application on a minimal bit-flip code with five transmon qubits, showing that …
In this paper, we study the effect of various transmitter and receiver parameters on the quantum bit error rate (QBER) performance of underwater quantum key distribution. We utilize a Monte Carlo approach to simulate the trajectories of emitted photons transmitting in the water from the transmitter towards receiver. Based on propagation delay results, we first determine a proper value for bit period to avoid the intersymbol interference as a result of possible multiple scattering events. Then, based on the angle of arrival of the received photons, we determine a proper field-of-view to limit t…
We improve the number of T gates needed to perform an n-bit adder from 8n + O(1) to 4n + O(1). We do so via a "temporary logical-AND" construction which uses four T gates to store the logical-AND of two qubits into an ancilla and zero T gates to later erase the ancilla. This construction is equivalent to one by Jones, except that our framing makes it clear that the technique is far more widely applicable than previously realized. Temporary logical-ANDs can be applied to integer arithmetic, modular arithmetic, rotation synthesis, the quantum Fourier transform, Shor's algorithm, Grover oracles, …
To overcome the difficulty of realizing large-scale quantum Fourier transform (QFT) within existing technology, this paper presents a resource-saving method, namely t-bit semiclassical QFT over (Z_(2^n)), which could realize large-scale QFT using arbitrary-scale quantum register. Using our method, the scale of quantum register can be determined flexibility according to the scale of quantum system, enabling the quantum resource and speed of realizing QFT to be optimal. By developing a feasible method to realize the control quantum gate R_k, we experimentally demonstrate the 2-bit semiclassical …
