Related papers: Efficient purification protocols using iSWAP gates…
We introduce crosstalk-robust gate sets, which are obtained using a novel, scalable optimal control problem exploiting locality. Through the suppression of pairwise quantum crosstalk, the gate sets enable robustness that extends to…
We present a quantum SWAP gate valid for quantum systems of an arbitrary dimension. The gate generalizes the CNOT implementation of the SWAP gate for qubits and keeps its most important properties, like symmetry and simplicity. We only use…
In gate-defined semiconductor spin qubits, the highly tunable Heisenberg exchange interaction is leveraged to implement fermionic two-qubit gates such as CZ and SWAP. However, the broader family of fermionic simulation (fSim) gates remains…
Noise poses a fundamental challenge to quantum information processing, with amplitude-damping (AD) noise being particularly detrimental. Preserving high-fidelity quantum systems therefore relies critically on effective error correction and…
We theoretically study single and two-qubit dynamics in the circuit QED architecture. We focus on the current experimental design [Wallraff et al., Nature 431, 162 (2004); Schuster et al., Nature 445, 515 (2007)] in which superconducting…
We present two protocols for implementing deterministic non-local multi-qubit quantum gates on qubits coupled to a common cavity mode. The protocols rely only on a classical drive of the cavity modes, while no external drive of the qubits…
The Heisenberg exchange interaction is a natural method to implement non-local (i.e., multi-qubit) quantum gates in quantum information processing. We consider quantum circuits comprising of $(SWAP)^\alpha $ gates, which are realized…
A remarkable characteristic of quantum computing is the potential for reliable computation despite faulty qubits. This can be achieved through quantum error correction, which is typically implemented by repeatedly applying static syndrome…
A crucial requirement for scalable quantum-information processing is the realization of multiple-qubit quantum gates. Universal multiple-qubit gates can be implemented by a set of universal single qubit gates and any one kind of two-qubit…
Qubit mapping/routing is a critical stage in compilation for both near-term and fault-tolerant quantum computers, yet existing scalable methods typically impose several times the routing overhead in terms of circuit depth or duration. This…
Nearly all modern solid-state quantum processors approach quantum computation with a set of discrete qubit operations (gates) that can achieve universal quantum control with only a handful of primitive gates. In principle, this approach is…
Semiconductor spin qubits may be coupled through a superconducting cavity to generate an entangling two-qubit gate. However, the fidelity of such an operation will be reduced by a variety of error mechanisms such as charge and magnetic…
We propose an implementation of the two-qubit gate in a quantum dot spin qubit system which is immune to charge noise problems. Our proposed implementation, if it could be realized in a physical system, would have the advantage of being…
Implementations for quantum computing require fast single- and multi-qubit quantum gate operations. In the case of optically controlled quantum dot qubits theoretical designs for long-range two- or multi-qubit operations satisfying all the…
Using the Parity Flow formalism, we show that physical SWAP gates can be eliminated in linear hardware architectures, without increasing the total number of two-qubit operations. This has a significant impact on the execution time of…
Recently, two-photon six-qubit hyperentangled states were produced in experiment and they can improve the channel capacity of quantum communication largely. Here we present a scheme for the hyperentanglement purification of nonlocal…
Quantum state purification protocols, which mitigate noise by converting multiple copies of noisy quantum states into fewer copies with a lower noise level, have applications in quantum communication and computation with imperfect devices.…
Superconducting qubits have achieved remarkable progress in gate fidelity and coherence, yet their typical nearest-neighbor connectivity presents constraints for implementing complex quantum circuits. Here, we introduce a cavity-mediated…
In this paper we consider feedback control algorithms for the rapid purification of a bipartite state consisting of two qubits, when the observer has access to only one of the qubits. We show 1) that the algorithm that maximizes the average…
While all quantum algorithms can be expressed in terms of single-qubit and two-qubit gates, more expressive gate sets can help reduce the algorithmic depth. This is important in the presence of gate errors, especially those due to…