Related papers: Operation Time of Quantum Gates
Fault-tolerant quantum computers rely on Quantum Error-Correcting Codes (QECCs) to protect information from noise. However, no single error-correcting code supports a fully transversal and therefore fault-tolerant implementation of all…
This paper is concerned with the phase estimation algorithm in quantum computing algorithms, especially the scenarios where (1) the input vector is not an eigenvector; (2) the unitary operator is not exactly implemented; (3) random…
The quantum Fourier transform (QFT) is a key primitive for quantum computing that is typically used as a subroutine within a larger computation, for instance for phase estimation. As such, we may have little control over the state that is…
We give an explicit construction to perform any $n$-qubit computational basis state transposition using $\Theta(n)$ gates. This nearly coincides with the lower bound $\Omega(n/\log(nd))$ on worst-case and average-case gate complexity to…
Hamiltonian quantum gates controlled by classical electromagnetic fields form the basis of any realistic model of quantum computers. In this letter, we derive a lower bound on the field energy required to implement such gates and relate…
We consider a model of two interacting always-on, exchange-only qubits for which controlled phase ($CPHASE$), controlled NOT ($CNOT$), quantum Fourier transform ($QFT$) and $SWAP$ operations can be implemented only in a few electrical…
Although the quality of quantum bits (qubits) and quantum gates has been steadily improving, the available quantity of qubits has increased quite slowly. To address this important issue in quantum computing, we have demonstrated arbitrary…
A key requirement to perform simulations of large quantum systems on near-term quantum hardware is the design of quantum algorithms with short circuit depth that finish within the available coherence time. A way to stay within the limits of…
In this work we derive a lower bound for the minimum time required to implement a target unitary transformation through a classical time-dependent field in a closed quantum system. The bound depends on the target gate, the strength of the…
Simplest models of two- and three-terminal Quantum Quantum Gates are suggested in form of a quantum ring with few one-dimensional quantum wires attached to it and several point-wise govering electrodes inside the ring which are charged by a…
An enduring challenge in computer science is reducing the runtime required to solve computational problems. Quantum computing has attracted significant attention due to its potential to deliver asymptotically faster solutions to certain…
The simplest decomposition of a Toffoli gate acting on three qubits requires {\em five} 2-qubit gates. If we restrict ourselves to controlled-sign (or controlled-NOT) gates this number climbs to six. We show that the number of…
Finding minimal time and establishing the structure of the corresponding optimal controls which can transfer a given initial state of a quantum system into a given target state is a key problem of quantum control. In this work, this problem…
The minimum time a system needs to change from an initial state to a final orthogonal state is called quantum speed limit time. Quantum speed limit time can be used to quantify the speed of the quantum evolution. The speed of the quantum…
We show that a wide range of spin clusters with antiferromagnetic intracluster exchange interaction allows one to define a qubit. For these spin cluster qubits, initialization, quantum gate operation, and readout are possible using the same…
In this paper we consider a phase space path integral for general time-dependent quantum operations, not necessarily unitary. We obtain the path integral for a completely positive quantum operation satisfied Lindblad equation (quantum…
An important aspect that strongly impacts the experimental feasibility of quantum circuits is the ratio of gate times and typical error time scales. Algorithms with circuit depths that significantly exceed the error time scales will result…
Landauer's principle imposes a fundamental limit on the energy cost to perfectly initialize a classical bit, which is only reached under the ideal operation with infinite-long time. The question on the cost in the practical operation for a…
In this article we use geometric optimal control to completely solve the problem of minimum-time transitions between thermal equilibrium and fixed average energy states of the quantum parametric oscillator, a system which has been…
Optimal implementation of quantum gates is crucial for designing a quantum computer. We consider the matrix representation of an arbitrary multiqubit gate. By ordering the basis vectors using the Gray code, we construct the quantum circuit…