Related papers: Quantum circuits of CNOT gates
Diagonal quantum circuits are quantum circuits comprising only diagonal gates in the computational basis. In spite of a classical feature of diagonal quantum circuits in the sense of commutativity of all gates, their computational power is…
We define and construct efficient depth-universal and almost-size-universal quantum circuits. Such circuits can be viewed as general-purpose simulators for central classes of quantum circuits and can be used to capture the computational…
Numerical simulation is an important method for verifying the quantum circuits used to simulate low-energy nuclear states. However, real-world applications of quantum computing for nuclear theory often generate deep quantum circuits that…
We apply numerical optimization and linear algebra algorithms for classical computers to the problem of automatically synthesizing algorithms for quantum computers. Using our framework, we apply several common techniques from these…
We investigate the question if quantum algorithms exist that compute the maximum of a set of conjugated elements of a given number field in quantum polynomial time. We will relate the existence of these algorithms for a certain family of…
Systems of linear equations are used to model a wide array of problems in all fields of science and engineering. Recently, it has been shown that quantum computers could solve linear systems exponentially faster than classical computers,…
While mapping a quantum circuit to the physical layer one has to consider the numerous constraints imposed by the underlying hardware architecture. Connectivity of the physical qubits is one such constraint that restricts two-qubit…
In the paper, we consider quantum circuits for Quantum fingerprinting (quantum hashing) and quantum Fourier transform (QFT) algorithms. Quantum fingerprinting (quantum hashing) is a well-known technique for comparing large objects using…
Universal quantum computation may be realized based on quantum walk, by formulating it as a scattering problem on a graph. In this paper, we simulate quantum gates through electric circuits, following a recent report that a one-dimensional…
For years, the quantum/reversible circuit community has been convinced that: a) the addition of auxiliary qubits is instrumental in constructing a smaller quantum circuit; and, b) the introduction of quantum gates inside reversible circuits…
Controlled-NOT (CNOT) gates are commonly included in the standard gate set of quantum processors and provide an important way to entangle qubits. For fixed-frequency qubits using the cross-resonance entangling technique, using the…
A large-scale quantum circuit can be partitioned into multiple subcircuits through circuit cutting, where each subcircuit is executed multiple times and the expectation value of the original circuit is reconstructed by classical…
Crosstalk and several sources of operational interference are invisible when qubit or a gate is calibrated or benchmarked in isolation. These are unlocked during the execution of full quantum circuit applying entangling gates to several…
We present a monotonic numerical algorithm including time optimization for generating quantum gates for open systems. Such systems are assumed to be governed by Lindblad master equations for the density operators on a large Hilbert-space…
In recent years, we have witnessed an explosion of experimental tools by which quantum systems can be manipulated in a controlled and coherent way. One of the most important goals now is to build quantum simulators, which would open up the…
In this work we propose a novel numerical approach to decompose general quantum programs in terms of single- and two-qubit quantum gates with a $CNOT$ gate count very close to the current theoretical lower bounds. In particular, it turns…
We propose a quantum circuit composed of $cNOT$ gates and four single-qubit gates to generate a $W$ state of three qubits. This circuit was then enhanced by integrating two-qubit gates to create a $W$ state of four and five qubits. After a…
We propose an experimentally feasible scheme to achieve quantum computation based on a pair of orthogonal cyclic states. In this scheme, quantum gates can be implemented based on the total phase accumulated in cyclic evolutions. In…
Since quantum computing is currently in the NISQ-Era, compilation strategies to reduce the number of gates executed on specific hardware are required. In this work, we utilize the concept of synthesis of a data structure called Clifford…
We demonstrate a native $\mathrm{CNOT}$ gate between two individually addressed neutral atoms based on electromagnetically induced transparency (EIT). This protocol utilizes the strong long-range interactions of Rydberg states to enable…