Related papers: Optimal quantum circuit synthesis from Controlled-…
Besides noticeable challenges in implementing low-error single- and two-qubit quantum gates in superconducting quantum processors, the readout technique and analysis are a key factor in determining the efficiency and performance of quantum…
High-fidelity entangling gates are essential for quantum computation. Currently, most approaches to designing such gates are based either on simple, analytical pulse waveforms or on ones obtained from numerical optimization techniques. In…
Quantum algorithms may be described by sequences of unitary transformations called quantum gates and measurements applied to the quantum register of n quantum bits, qubits. A collection of quantum gates is called universal if it can be used…
Numerical optimization is used to design linear-optical devices that implement a desired quantum gate with perfect fidelity, while maximizing the success rate. For the 2-qubit CS (or CNOT) gate, we provide numerical evidence that the…
When the gate set has continuous parameters, synthesizing a unitary operator as a quantum circuit is always possible using exact methods, but finding minimal circuits efficiently remains a challenging problem. The landscape is very…
We propose an effective set of elementary quantum gates which provide an encoded universality and demonstrate the physical feasibility of these gates for the solid-state quantum computer based on the multi-atomic systems in the QED cavity.…
We study the problem of compilation of quantum algorithms into optimized physical-level circuits executable in a quantum information processing (QIP) experiment based on trapped atomic ions. We report a complete strategy: starting with an…
Quantum circuit synthesis describes the process of converting arbitrary unitary operations into a gate sequence of a fixed universal gate set, usually defined by the operations native to a given hardware platform. Most current synthesis…
We consider the optimal control problem in a two-qubit system with bounded amplitude. Two cases are studied: quantum state preparation and entanglement creation. Cost functions, fidelity and concurrence, are optimized over bang-off controls…
While the ability to build quantum computers is improving dramatically, developing quantum algorithms is limited and relies on human insight and ingenuity. Although a number of quantum programming languages have been developed, it is…
How to implement a computation task efficiently is the central problem in quantum computation science. For a quantum circuit, the multi-control unitary operations are the very important components. We present an extremely efficient approach…
The number of measurements necessary to perform the quantum state reconstruction of a system of qubits grows exponentially with the number of constituents, creating a major obstacle for the design of scalable tomographic schemes. We work…
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 channels can describe all transformations allowed by quantum mechanics. We provide an explicit universal protocol to construct all possible quantum channels, using a single qubit ancilla with quantum non-demolition readout and…
A possibility of performing the C-NOT gate operation at the ground and the first excited states of two harmonic oscillators interacting via a two-level system subject to complete control is demonstrated. The system resembles Turing machine,…
The implementation of fault-tolerant quantum gates on encoded logic qubits is considered. It is shown that transversal implementation of logic gates based on simple geometric control ideas is problematic for realistic physical systems…
Although many of works have been done in multivalued quantum logic synthesis, the question whether multivalued quantum circuits are more efficient than the conventional binary quantum circuits is still open. In this article we devote to the…
The design and optimization of quantum circuits is central to quantum computation. This paper presents new algorithms for compiling arbitrary 2^n x 2^n unitary matrices into efficient circuits of (n-1)-controlled single-qubit and…
Quantum computing has shown tremendous promise in addressing complex computational problems, yet its practical realization is hindered by the limited availability of qubits for computation. Recent advancements in quantum hardware have…
An algorithm is proposed to convert arbitrary unitary matrix to a sequence of $X$ gates and fully controlled $R_y, R_z$ and $R_1$ gates. This algorithm is used to generate Q# implementation for arbitrary unitary matrix. Some optimizations…