Related papers: Optimal Synthesis of Multi-Controlled Qudit Gates
One of the most promising paths towards large scale fault tolerant quantum computation is the use of quantum error correcting stabilizer codes. Just like every other quantum circuit, these codes must be compiled to hardware in a way to…
The native gate set is fundamental to the performance of quantum devices, as it governs the accuracy of basic quantum operations and dictates the complexity of implementing quantum algorithms. Traditional approaches to extending gate sets…
We propose a theoretical control protocol designed for the dynamic synthesis of single qubit and four-level qudit quantum gates using external parameters, such as photonic Gaussian pulses and magnetic fields, in a microcavity quantum well…
The performance of quantum error correction schemes depends sensitively on the physical realizations of the qubits and the implementations of various operations. For example, in quantum dot spin qubits, readout is typically much slower than…
One of the largest obstacles to building a quantum computer is gate error, where the physical evolution of the state of a qubit or group of qubits during a gate operation does not match the intended unitary transformation. Gate error stems…
Most quantum error correcting codes are predicated on the assumption that there exists a reservoir of qubits in the state $\ket{0}$, which can be used as ancilla qubits to prepare multi-qubit logical states. In this report, we examine the…
The synthesis approaches for quantum circuits typically aim at minimizing the number of lines or gates. Given the tight restrictions on those logical resources in physical implementations, we propose to view the problem fundamentally…
Bosonic quantum error correction has proven to be a successful approach for extending the coherence of quantum memories, but to execute deep quantum circuits, high-fidelity gates between encoded qubits are needed. To that end, we present a…
The circuit model of a quantum computer consists of sequences of gate operations between quantum bits (qubits), drawn from a universal family of discrete operations. The ability to execute parallel entangling quantum gates offers clear…
In quantum error correction, information is encoded in a high-dimensional system to protect it from the environment. A crucial step is to use natural, low-weight operations with an ancilla to extract information about errors without causing…
The reversible implementation of classical functions accounts for the bulk of most known quantum algorithms. As a result, a number of reversible circuit constructions over the Clifford+$T$ gate set have been developed in recent years which…
This paper investigates the synthesis of quantum networks built to realize ternary switching circuits in the absence of ancilla bits. The results we established are twofold. The first shows that ternary Swap, ternary Not and ternary Toffoli…
We study the resources required to achieve universal quantum computing via the gate sets that provide the fundamental instructions from which quantum algorithms are built. While single-gate universal sets are known, they rely on precisely…
We introduce conditionally clean ancilla qubits, a new quantum resource, recently explored by [NZS24], that bridges the gap between traditional clean and dirty ancillae. Like dirty ancillae, they begin and end in an unknown state and can be…
Reversible computation is an emerging technology that has gained significant attention due to its critical role in quantum circuit synthesis and low-power design. This paper introduces a transformation-based method for exact synthesis of…
Single-step implementations of multi-qubit gates are generally believed to provide a simpler design, a faster operation, and a lower decoherence. For coupled three qubits interacting with a photon field, a realizable scheme for a…
Multi-controlled gates are fundamental components in the design of quantum algorithms, where efficient decompositions of these operators can enhance algorithm performance. The best asymptotic decomposition of an n-controlled X gate with one…
We propose an efficiently measurable lower bound on quantum process fidelity of N-qubit controlled-Z gates. This bound is determined by average output state fidelities for N partially conjugate product bases. A distinct advantage of our…
Transversal gates are the ideal gates in a fault-tolerant scenario; relatively easy to implement, and minimally error propagating. Their availability will maximise fault tolerant thresholds, enabling universal quantum computation in a wider…
Quantum computing has garnered significant interest for its potential to solve certain computational problems much faster than the best-known classical algorithms. A fully functional and scalable quantum computer could transform various…