Related papers: Operation Time of Quantum Gates
The time of arrival at an arbitrary position in configuration space can be given as a function of the phase space variables for the Liouville integrable systems of classical mechanics, but only for them. We review the Jacobi-Lie…
We present a quantum averaging theory (QAT) for analytically modeling unitary gate dynamics in driven quantum systems beyond the rotating-wave approximation. QAT addresses the simultaneous presence of distinct timescales by generating a…
Quantum transition amplitudes are formulated for a model system with local internal time, using path integrals. The amplitudes are shown to be more regular near a turning point of internal time than could be expected based on existing…
Quantum computing has garnered attention for its potential to solve complex computational problems with considerable speedup. Despite notable advancements in the field, achieving meaningful scalability and noise control in quantum hardware…
The role of time in quantum mechanics is discussed. The differences between ordinary observables and an observable which corresponds to the time of an event is examined. In particular, the time-of-arrival of a particle to a fixed location…
Quantum computers process information with the laws of quantum mechanics. Current quantum hardware is noisy, can only store information for a short time, and is limited to a few quantum bits, i.e., qubits, typically arranged in a planar…
The creation of composite quantum gates that implement quantum response functions $\hat{U}(\theta)$ dependent on some parameter of interest $\theta$ is often more of an art than a science. Through inspired design, a sequence of $L$…
We propose a new protocol to implement ultra-fast two-qubit phase gates with trapped ions using spin-dependent kicks induced by resonant transitions. By only optimizing the allocation of the arrival times in a pulse train sequence the gate…
Contemporary quantum computers encode and process quantum information in binary qubits (d = 2). However, many architectures include higher energy levels that are left as unused computational resources. We demonstrate a superconducting…
Although quantum circuit depth is commonly used to approximate circuit runtimes, it overlooks a prevailing trait of current hardware implementation: different gates have different execution times. Recognizing the potential for…
Quantum computers provide a fundamentally new computing paradigm that promises to revolutionize our ability to solve broad classes of problems. Surprisingly, the basic mathematical structures of gate-based quantum computing, such as unitary…
We consider how to optimize memory use and computation time in operating a quantum computer. In particular, we estimate the number of memory qubits and the number of operations required to perform factorization, using the algorithm…
Gate-based quantum computation has been extensively investigated using quantum circuits based on qubits. In many cases, such qubits are actually made out of multilevel systems but with only two states being used for computational purpose.…
We investigate the cost of three phase estimation procedures that require only constant-precision phase shift operators. The cost is in terms of the number of elementary gates, not just the number of measurements. Faster phase estimation…
We propose a simple method for realizing a multiqubit phase gate of one qubit simultaneously controlling $n$ target qubits, by using three-level quantum systems (i.e., qutrits) coupled to a cavity or resonator. The gate can be implemented…
We present a way for fast implementation of a two-qubit controlled phase gate with superconducting flux qubits coupled to a cavity. A distinct feature of this proposal is that since only qubit-cavity resonant interaction and qubit-pulse…
Basis state shift is central to many quantum algorithms, most notably the quantum walk. Efficient implementations are of major importance for achieving a quantum speedup for computational applications. We optimize the state shift algorithm…
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…
It is shown that a quantum controlled-NOT gate simultaneously performs the logical functions of three distinct conditional local operations. Each of these local operations can be verified by measuring a corresponding truth table of four…
An essential element of classical computation is the "if-then" construct, that accepts a control bit and an arbitrary gate, and provides conditional execution of the gate depending on the value of the controlling bit. On the other hand,…