相关论文: Completeness of the Phase-free ZH-calculus
Quantum circuit cutting refers to a series of techniques that allow one to partition a quantum computation on a large quantum computer into several quantum computations on smaller devices. This usually comes at the price of a sampling…
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,…
Polymorphic circuits are a special kind of circuits which possess some different build-in functions and these functions are activated by environment parameters, like light and VDD. Some theories have been proposed to guide the design of…
What additional gates are needed for a set of classical universal gates to do universal quantum computation? We answer this question by proving that any single-qubit real gate suffices, except those that preserve the computational basis.…
Classical simulation of quantum circuits is a pivotal part of the quantum computing landscape, specially within the NISQ era, where the constraints imposed by available hardware are unavoidable. The Gottesman-Knill theorem further motivates…
Loop quantum gravity (LQG) attempts to unify general relativity with quantum physics to offer a complete description of the universe by quantising spacetime geometry, but the numerical calculations we encounter are extraordinarily…
An efficient and intuitive framework for universal quantum computation is presented that uses pairs of spin-1/2 particles to form logical qubits and a single physical interaction, Heisenberg exchange, to produce all gate operations. Only…
The paper introduces a new geometric interpretation of the quantum Knizhnik-Zamolodchikov equations introduced in 1991 by I.Frenkel and N.Reshetikhin. It turns out that these equations can be linked to certain holomorphic vector bundles on…
An examination of the concept of using classical degrees of freedom to drive the evolution of quantum computers is given. Specifically, when externally generated, coherent states of the electromagnetic field are used to drive transitions…
Universal and complete graphical languages have been successfully designed for pure state quantum mechanics, corresponding to linear maps between Hilbert spaces, and mixed states quantum mechanics, corresponding to completely positive…
This paper studies the zero-divisor graphs attached to several finite chain-ring families and computes the homological invariants of their edge ideals by using cochordal constructible systems. We begin with a general layered graph $C(q,L)$,…
Nodal free geometric phases are the eigenvalues of the final member of a parallel transporting family of unitary operators. These phases are gauge invariant, always well-defined, and can be measured interferometrically. Nodal free geometric…
Discrete-time quantum walks have been shown to simulate all known topological phases in one and two dimensions. Being periodically driven quantum systems, their topological description, however, is more complex than that of closed…
The phase diagram of strong interactions in nature at finite temperature and chemical potential remains largely unexplored theoretically due to inadequacy of Monte-Carlo-based computational techniques in overcoming a sign problem. Quantum…
To approximate arbitrary unitary transformations on one or more qubits, one must perform transformations which are outside of the Clifford group. The gate most commonly considered for this purpose is the T = diag(1, exp(i \pi/4)) gate. As T…
It is known that a computationally universal gate set $\{H,CCZ\}$ can be transformed to a strictly universal one $\{H, \Lambda(S)\}$ using one maximally imaginary state $|+i \rangle$ and non-imaginary ancillary qubits. We succeed this…
All-to-all interactions arise naturally in many areas of theoretical physics and across diverse experimental quantum platforms, motivating a systematic study of their information-processing power. Assuming each pair of qubits interacts with…
A major challenge for scaling up superconducting quantum computers is unwanted couplings between qubits, which lead to always-on ZZ couplings that impact gate fidelities by shifting energy levels conditional on qubit states. To tackle this…
Optimizing quantum circuits is a key challenge for quantum computing. The PyZX compiler broke new ground by optimizing circuits via the ZX calculus, a powerful graphical alternative to the quantum circuit model. Still, it carries no…
A finite hypergraph $H$ consists of a finite set of vertices $V(H)$ and a collection of subsets $E(H) \subseteq 2^{V(H)}$ which we consider as partition of unity relations between projection operators. These partition of unity relations…