.png){kind=icon}
.png){kind=icon}
Return
Fast Multiqubit Gates through Simultaneous Two-Qubit Gates
.png){kind=icon}
OA
AI
DOI：10.1103/PRXQuantum.2.040348.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Near-term quantum computers are limited by the decoherence of qubits to only being able to run lowdepth quantum circuits with acceptable fidelity. This severely restricts what quantum algorithms can be compiled and implemented on such devices. One way to overcome these limitations is to expand the available gate set from single- and two-qubit gates to multiqubit gates, which entangle three or more qubits in a single step. Here, we show that such multiqubit gates can be realized by the simultaneous application of multiple two-qubit gates to a group of qubits where at least one qubit is involved in two or more of the two-qubit gates. Multiqubit gates implemented in this way are as fast as, or sometimes even faster than, the constituent two-qubit gates. Furthermore, these multiqubit gates do not require any modification of the quantum processor, but are ready to be used in current quantum-computing platforms. We demonstrate this idea for two specific cases: simultaneous controlled-Z gates and simultaneous iSWAP gates. We show how the resulting multiqubit gates relate to other well-known multiqubit gates and demonstrate through numerical simulations that they would work well in available quantum hardware, reaching gate fidelities well above 99%. We also present schemes for using these simultaneous two-qubit gates to swiftly create large entangled states like Dicke and Greenberger-Horne-Zeilinger states.
Keywords:
QUANTUM GATES
PYTHON FRAMEWORK
ENTANGLING GATE
REALIZATION
ALGORITHMS
GENERATION
DYNAMICS
STATES
QUTIP
QUBIT