相关论文: Decomposing Quantum Generalized Toffoli with an Ar…
We present a method for quantum error mitigation on partially error-corrected quantum computers - i.e., computers with some logical qubits and some noisy qubits. Our method is inspired by the error cancellation method and is implemented via…
In this paper, we have implemented and designed a sorting network for reversible logic circuits synthesis in terms of n*n Toffoli gates. The algorithm presented in this paper constructs a Toffoli Network based on swapping bit strings.…
We first consider the basic requirements for a quantum computer, arguing for the attractiveness of nuclear spins as information-bearing entities, and light for the coupling which allows quantum gates. We then survey the strengths of and…
Reducing errors is essential for reliable quantum computation. Quantum error mitigation (QEM) and quantum error correction (QEC) are two leading approaches for this task, each with challenges: QEM suffers from high sampling costs and cannot…
Entanglement purification is a crucial technique for promising the effective entanglement channel in noisy large-scale quantum networks, yet complicated in designing protocols in multi-degree of freedom (DoF). To execute the above tasks…
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 paper presents two algorithms for finding irreducible decomposition of monomial ideals. The first one is recursive, derived from staircase structures of monomial ideals. This algorithm has a good performance for highly non-generic…
A generic approach for compiling any classical block compression algorithm into a quantum block compression algorithm is presented. Using this technique, compression asymptoticaly approaching the von Neumann entropy of a qubit source can be…
We demonstrate an improved concatenated encoded ancilla preparation procedure. Simulations show that this procedure significantly increases the error threshold beneath which arbitrarily long quantum computations are possible.
Quantum error correction methods use processing power to combat noise. The noise level which can be tolerated in a fault-tolerant method is therefore a function of the computational resources available, especially the size of computer and…
Quantum circuits must run on quantum computers with tight limits on qubit and gate counts. To generate circuits respecting both limits, a promising opportunity is exploiting uncomputation to trade qubits for gates. We present Reqomp, a…
Given a quantum algorithm, it is highly nontrivial to devise an efficient sequence of physical gates implementing the algorithm on real hardware and incorporating topological quantum error correction. In this paper, we present a first step…
We consider quantum gates for trapped ions using state-selective displacement of the ions. We generalize earlier work in order to treat arbitrary separations between the traps. This requires the impact of anharmonicity arising from the…
Fault-tolerant quantum computation allows quantum computations to be carried out while resisting unwanted noise. Several error-correcting codes have been developed to achieve this task, but none alone are capable of universal quantum…
Most of the work on implementing arithmetic on a quantum computer has borrowed from results in classical reversible computing (e.g. [VBE95], [BBF02], [DKR04]). These quantum networks are inherently classical, as they can be implemented with…
Measurements play an important role in quantum computing (QC), by either providing the nonlinearity required for two-qubit gates (linear optics QC), or by implementing a quantum algorithm using single-qubit measurements on a highly…
We propose a method for decomposing continuous-variable operations into a universal gate set, without the use of any approximations. We fully characterize a set of transformations admitting exact decompositions and describe a process for…
This paper introduces a reformulation of the classical convergence theorem for spectral sequences of filtered complexes which provides an algorithm to effectively compute the induced filtration on the total (co)homology, as soon as the…
We draw attention to the existence of "genuine" fidelity gaps in an ancilla-assisted sequential decomposition of genuinely entangling isometry and unitary operations of quantum computing. The gaps arise upon a bipartite decomposition of a…
Multipartite entanglement has a much more complex structure than bipartite entanglement. A state that lacks generic multipartite entanglement is 2-producible, i.e. it can be written as a tensor product of at most 2-partite entangled states.…