English
Related papers

Related papers: An analytical decomposition protocol for optimal i…

200 papers

The ability to perform entangling quantum operations with low error rates in a scalable fashion is a central element of useful quantum information processing. Neutral atom arrays have recently emerged as a promising quantum computing…

We show how to construct a multi-qubit control gate on a quantum register of an arbitrary size N. This gate performs a single-qubit operation on a specific qubit conditioned by the state of other N-1 qubits. We provide an algorithm how to…

Quantum Physics · Physics 2009-11-07 Marek Sasura , Vladimir Buzek

We theoretically study operations with a four-level superconducting circuit as a two-qubit system. Using a mapping on a two-qubit system, we show how to implement iSWAP gates and Hadamard gates through pulses on transitions between…

Quantum Physics · Physics 2015-04-14 E. O. Kiktenko , A. K. Fedorov , O. V. Man'ko , V. I. Man'ko

Although only two quantum states of a physical system are often used to encode quantum information in the form of qubits, many levels can in principle be used to obtain qudits and increase the information capacity of the system. To take…

Quantum Physics · Physics 2025-06-25 Aryan Iliat , Mark Byrd , Sahel Ashhab , LianAo Wu

To treat a problem with a Quantum Processing Unit (QPU), it must be transformed into a sequence of quantum operations, or gates: this is the quantum description of the problem. These operations are either packed into a query (i.e. quantum…

Quantum Physics · Physics 2026-03-19 Robin Ollive , Stéphane Louise

Entangling gates between qubits are a crucial component for performing algorithms in quantum computers. However, any quantum algorithm must ultimately operate on error-protected logical qubits encoded in high-dimensional systems. Typically,…

We show a certain kind of non-local operations can be simulated by sampling a set of local operations with a quasi-probability distribution when the task of a quantum circuit is to evaluate an expectation value of observables. Utilizing the…

Quantum Physics · Physics 2022-03-14 Kosuke Mitarai , Keisuke Fujii

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…

Quantum Physics · Physics 2026-03-30 Ryota Tamura , Tomoya Kashimata , Yohei Hamakawa , Kosuke Tatsumura , Hiroshi Imai

From a geometric approach, we derive the minimum number of applications needed for an arbitrary Controlled-Unitary gate to construct a universal quantum circuit. A new analytic construction procedure is presented and shown to be either…

Quantum Physics · Physics 2009-11-10 Jun Zhang , Jiri Vala , Shankar Sastry , K. Birgitta Whaley

Decomposing unitary operations into native gates is an essential step for implementing quantum algorithms. For qubit-based devices, where native gates are typically single- and two-qubit operations, a range of decomposition techniques have…

Quantum Physics · Physics 2025-10-10 Daniele Trisciani , Marco Cattaneo , Zoltán Zimborás

Most quantum computing architectures to date natively support multi-valued logic, albeit being typically operated in a binary fashion. Multi-valued, or qudit, quantum processors have access to much richer forms of quantum entanglement,…

Quantum Physics · Physics 2023-01-12 Kevin Mato , Martin Ringbauer , Stefan Hillmich , Robert Wille

A novel two-qubit entangling gate for trapped-ion quantum processors is proposed theoretically and demonstrated experimentally. During the gate, double-dressed quantum states are created by applying a phase-modulated continuous driving…

A recurrence scheme is presented to decompose an $n$-qubit unitary gate to the product of no more than $N(N-1)/2$ single qubit gates with small number of controls, where $N = 2^n$. Detailed description of the recurrence steps and formulas…

Quantum Physics · Physics 2013-12-06 Chi-Kwong Li , Diane Pelejo

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.…

Here, we numerically simulate probabilistic elementary entangling operations between rail-encoded photons for the purpose of scalable universal quantum computation or communication. We propose grouping logical qubits into single-photon…

Quantum Physics · Physics 2018-01-24 Jake A. Smith , Lev Kaplan

Dual-type qubits have become a promising way to suppress the crosstalk error of auxiliary operations in large-scale ion trap quantum computation. Here we demonstrate a direct entangling gate between dual-type qubits encoded in the $S_{1/2}$…

We present a new algorithm for reducing an arbitrary unitary matrix U into a sequence of elementary operations (operations such as controlled-nots and qubit rotations). Such a sequence of operations can be used to manipulate an array of…

Quantum Physics · Physics 2007-05-23 Robert R. Tucci

A non-local unitary transformation of two qubits occurs when some Hamiltonian interaction couples them. Here we characterize the amount, as measured by time, of interaction required to perform two--qubit gates, when also arbitrarily fast,…

Quantum Physics · Physics 2009-11-07 K. Hammerer , G. Vidal , J. I. Cirac

We study the generation of two-qudit entangling quantum logic gates using two techniques in quantum optimal control. We take advantage of both continuous, Lie-algebraic control and digital, Lie-group control. In both cases, the key is…

Quantum Physics · Physics 2023-12-06 Sivaprasad Omanakuttan , Anupam Mitra , Eric J. Meier , Michael J. Martin , Ivan H Deutsch

We show that two electrons confined in a square semiconductor quantum dot have two isolated low-lying energy eigenstates, which have the potential to form the basis of scalable computing elements (qubits). Initialisation, one-qubit and…

Quantum Physics · Physics 2009-11-07 J. H. Jefferson , M. Fearn , D. L. J. Tipton , T. P. Spiller
‹ Prev 1 3 4 5 6 7 10 Next ›