相关论文: Constructing $\mathrm{NP}^{\mathord{\#}\mathrm P}$…
We show a significant reduction of the number of quantum operations and the improvement of the circuit depth for the realization of the Toffoli gate by using qudits. This is done by establishing a general relation between the dimensionality…
Different graphical calculi have been proposed to represent quantum computation. First the ZX- calculus [4], followed by the ZW-calculus [12] and then the ZH-calculus [1]. We can wonder if new Z*-calculi will continue to be proposed…
Quantum computing is currently strongly limited by the impact of noise, in particular introduced by the application of two-qubit gates. For this reason, reducing the number of two-qubit gates is of paramount importance on noisy…
The real stabilizer fragment of quantum mechanics was shown to have a complete axiomatization in terms of the angle-free fragment of the ZX-calculus. This fragment of the ZX-calculus---although abstractly elegant---is stated in terms of…
We propose several methods for optimizing the number of qubits in a quantum circuit while preserving the number of non-Clifford gates. One of our approaches consists in reversing, as much as possible, the gadgetization of Hadamard gates,…
The ZX-calculus is a graphical language for suitably represented tensor networks, called ZX-diagrams. Calculations are performed by transforming ZX-diagrams with rewrite rules. The ZX-calculus has found applications in reasoning about…
The commonly used circuit model of quantum computing leaves out the problems of imprecision in the initial state preparation, particle statistics (indistinguishability of particles belonging to the same quantum state), and error correction…
The relevance of shallow-depth quantum circuits has recently increased, mainly due to their applicability to near-term devices. In this context, one of the main goals of quantum circuit complexity is to find problems that can be solved by…
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…
To ensure a long-term quantum computational advantage, the quantum hardware should be upgraded to withstand the competition of continuously improved classical algorithms and hardwares. Here, we demonstrate a superconducting quantum…
Graphical languages offer intuitive and rigorous formalisms for quantum physics. They can be used to simplify expressions, derive equalities, and do computations. Yet in order to replace conventional formalisms, rigour alone is not…
We designed an search algorithm in order to find a non-transversal but fault-tolerant construction of a logical controlled-phase gate for general [[n,1,d]] degenerate quantum code. Then we give an example to illustrate our algorithm for a…
It is well-known that deciding equivalence of logic circuits is a coNP-complete problem. As a corollary, the problem of deciding weak equivalence of reversible circuits, i.e. ignoring the ancilla bits, is also coNP-complete. The complexity…
We propose a quantum programming language that generalizes the $\lambda$-calculus. The language is non-linear; duplicated variables denote, not cloning of quantum data, but sharing a qubit's state; that is, producing an entangled pair of…
We continue to study the notion of cancellation-free linear circuits. We show that every matrix can be computed by a cancellation- free circuit, and almost all of these are at most a constant factor larger than the optimum linear circuit…
The NP-complete problem Feedback Vertex Set is that of deciding whether or not it is possible, for a given integer $k\geq 0$, to delete at most $k$ vertices from a given graph so that what remains is a forest. The variant in which the…
Variational algorithms such as the Quantum Approximate Optimization Algorithm have attracted attention due to their potential for solving problems using near-term quantum computers. The $ZZ$ interaction typically generates the primitive…
The master equation describing the non-equilibrium dynamics of a quantum dot coupled to metallic leads is considered. Employing a superoperator approach, we derive an exact time-convolutionless master equation for the probabilities of dot…
Given two quantum states of N q-bits we are interested to find the shortest quantum circuit consisting of only one- and two- q-bit gates that would transfer one state into another. We call it the quantum maze problem for the reasons…
Linear optical quantum computation (LOQC) offers a promising platform for scalable quantum information processing, but its scalability is fundamentally constrained by the probabilistic nature of non-local entangling gates. Qudit circuit…