Related papers: Results on two-bit gate design for quantum compute…
An algorithm for reversible logic synthesis is proposed. The task is, for a given $n$-bit substitution map $P_n: \{0,1\}^n \rightarrow \{0,1\}^n$, to find a sequence of reversible logic gates that implements the map. The gate library…
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…
Fault-tolerant logical operations for qubits encoded by CSS codes are discussed, with emphasis on methods that apply to codes of high rate, encoding k qubits per block with k>1. It is shown that the logical qubits within a given block can…
Quantum dot-based spin qubit realization is one of the most promising quantum computing systems owing to its integrability with classical computation hardware and its versatility in realizing qubits and quantum gates. In this work, we…
Reversible algorithms play a crucial role both in classical and quantum computation. While for a classical bit the only nontrivial reversible operation is the bit-flip, nature is far more versatile in what it allows to do to a quantum bit.…
We investigate the minimal resources that are required in the local implementation of non-local quantum gates in a distributed quantum computer. Both classical communication requirements and entanglement consumption are investigated. We…
We examine the detailed scenario for implementing n-control-qubit Toffoli gates and select gates on ion-trap quantum computers, especially those that shuttle ions into interaction zones. We determine expected performance of these gates with…
Quantum arithmetic computation requires a substantial number of scratch qubits to stay reversible. These operations necessitate qubit and gate resources equivalent to those needed for the larger of the input or output registers due to state…
We discuss the realization of a universal set of ultrafast single- and two-qubit operations with superconducting quantum circuits and investigate the most relevant physical and technical limitations that arise when pushing for faster and…
The success probability of a quantum algorithm constructed from noisy quantum gates cannot be accurately predicted from single parameter metrics that compare noisy and ideal gates. We illustrate this concept by examining a system with…
A problem of universality in simulation of evolution of quantum system and in theory of quantum computations is related with the possibility of expression or approximation of arbitrary unitary transformation by composition of specific…
Optimal implementation of quantum gates is crucial for designing a quantum computer. We consider the matrix representation of an arbitrary multiqubit gate. By ordering the basis vectors using the Gray code, we construct the quantum circuit…
Recently, reversible circuit synthesis has been intensively studied. One of the problems that has not been solved for a long time was exact minimization of gate count (GC) in 4-bit circuits. Finally, last year a tool of practical usage for…
We describe a method for achieving arbitrary 1-qubit gates and controlled-NOT gates within the context of the Single Cooper Pair Box (SCB) approach to quantum computing. Such gates are sufficient to support universal quantum computation.…
The fidelity of certain gates on noisy quantum computers may be improved when they are implemented using more than two levels of the involved transmons. The main impediments to achieving this potential are the dynamic gate phase errors that…
Multiplication is an essential step in a lot of calculations. In this paper we look at multiplication of 2 binary polynomials of degree at most $n-1$, modulo an irreducible polynomial of degree $n$ with $2n$ input and $n$ output qubits,…
Encoding qubits in multiple degrees of freedom (DOFs) of a quantum system allows less-decoherence quantum information processing with much less quantum resources. We present a compact and scalable quantum circuit to determinately implement…
While there is a general consensus about the structure of one qubit operations in topological quantum computer, two qubits are as usual a more difficult and complex story of different attempts with varying approaches, problems and…
Quantum walk has been regarded as a primitive to universal quantum computation. By using the operations required to describe the single particle discrete-time quantum walk on a position space we demonstrate the realization of the universal…
There are various gate sets used for describing quantum computation. A particularly popular one consists of Clifford gates and arbitrary single-qubit phase gates. Computations in this gate set can be elegantly described by the ZX-calculus,…