Related papers: A T-depth two Toffoli gate for 2D square lattice a…
It has been known that quantum error correction via concatenated codes can be done with exponentially small failure rate if the error rate for physical qubits is below a certain accuracy threshold. Other, unconcatenated codes with their own…
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…
In this work we present a method of decomposition of arbitrary unitary matrix $U\in\mathbf U(2^k)$ into a product of single-qubit negator and controlled-$\sqrt{\mbox{NOT}}$ gates. Since the product results with negator matrix, which can be…
Nonlocal two-qubit quantum gates are represented by canonical decomposition or equivalently by operator-Schmidt decomposition. The former decomposition results in geometrical representation such that all the two-qubit gates form tetrahedron…
Resource consumption is an important issue in quantum information processing, particularly during the present NISQ era. In this paper, we investigate resource optimization of implementing multiple controlled operations, which are…
Optimal construction of quantum operations is a fundamental problem in the realization of quantum computation. We here introduce a newly discovered quantum gate, B, that can implement any arbitrary two-qubit quantum operation with minimal…
We propose a systematic and efficient quantum circuit composed solely of Clifford gates for simulating the ground state of the surface code model. This approach yields the ground state of the toric code in $\lceil…
Transversal gates play a crucial role in suppressing error propagation in fault-tolerant quantum computation, yet they are intrinsically constrained: any nontrivial code encoding a single logical qubit admits only a finite subgroup of…
We present a 1D repetition code based on the so-called cat qubits as a viable approach toward hardware-efficient universal and fault-tolerant quantum computation. The cat qubits that are stabilized by a two-photon driven-dissipative…
Most work in quantum circuit optimization has been performed in isolation from the results of quantum fault-tolerance. Here we present a polynomial-time algorithm for optimizing quantum circuits that takes the actual implementation of…
Reversible computation is one of the most promising emerging technologies of the future. The usage of reversible circuits in computing devices can lead to a significantly lower power consumption. In this paper we study reversible logic…
We propose hardware-efficient schemes for implementing logical H and S gates transversally on rotated surface codes with reconfigurable neutral atom arrays. For logical H gates, we develop a simple strategy to rotate code patches…
High-efficiency quantum information processing is equivalent to the fewest quantum resources and the simplest operations by means of logic qubit gates. Based on the reflection geometry of a single photon interacting with a three-level…
It is an oft-cited fact that no quantum code can support a set of fault-tolerant logical gates that is both universal and transversal. This no-go theorem is generally responsible for the interest in alternative universality constructions…
The Clifford hierarchy is a nested sequence of sets of quantum gates that can be fault-tolerantly performed using gate teleportation within standard quantum error correction schemes. The groups of Pauli and Clifford gates constitute the…
The Clifford$+T$ gate set is commonly used to perform universal quantum computation. In such setup the $T$ gate is typically much more expensive to implement in a fault-tolerant way than Clifford gates. To improve the feasibility of…
We construct a polynomial-time classical algorithm that samples from the output distribution of noisy geometrically local Clifford circuits with any product-state input and single-qubit measurements in any basis. Our results apply to…
Multi-controlled Pauli gates are typical high-level qubit operations that appear in the quantum circuits of various quantum algorithms. We find multi-controlled Pauli gate decompositions with smaller CNOT-count or $T$-depth while keeping…
Controlled operations are fundamental building blocks of quantum algorithms. Decomposing $n$-control-NOT gates ($C^n(X)$) into arbitrary single-qubit and CNOT gates, is a crucial but non-trivial task. This study introduces $C^n(X)$ circuits…
We propose a protocol for realizing a Toffoli gate using neutral-atom qubits in optical tweezers. Two ground-state hyperfine levels of the atoms are considered as qubit states. Our method relies on the strong and long-range interactions…