Related papers: Towards a universal gateset for $\mathsf{QMA}_1$
A 2-covering for a finite group $G$ is a set of proper subgroups of $G$ such that every pair of elements of $G$ is contained in at least one subgroup in the set. The minimal number of subgroups needed to 2-cover a group $G$ is called the…
A quantum constraint problem is a frustration-free Hamiltonian problem: given a collection of local operators, is there a state that is in the ground state of each operator simultaneously? It has previously been shown that these problems…
Inspired by the works of L. Carlitz and Z.-W. Sun on cyclotomic matrices, in this paper, we investigate certain cyclotomic matrices involving Gauss sums over finite fields, which can be viewed as finite field analogues of certain matrices…
The author proves that the generalized Suita conjecture holds for any complex torus, which means that $ \alpha\pi K \geq c^2(\alpha\in\mathbb R)$, $c$ being the modified logarithmic capacity and $K$ being the Bergman kernel on the diagonal.…
We first consider various methods for the indirect implementation of unitary gates. We apply these methods to rederive the universality of 4-qubit measurements based on a scheme much simpler than Nielsen's original construction…
We formulate a general problem: given projective schemes $\mathbb{Y}$ and $\mathbb{X}$ over a global field $K$ and a $K$-morphism $\eta$ from $\mathbb{Y}$ to $\mathbb{X}$ of finite degree, how many points in $\mathbb{X}(K)$ of height at…
The two-way finite automaton with quantum and classical states (2QCFA), defined by Ambainis and Watrous, is a model of quantum computation whose quantum part is extremely limited; however, as they showed, 2QCFA are surprisingly powerful: a…
In this paper, we give a universal completion of the ZX-calculus for the whole of pure qubit quantum mechanics. This proof is based on the completeness of another graphical language: the ZW-calculus, with direct translations between these…
We provide an explicit construction of a universal gate set for continuous-variable quantum computation with microwave circuits. Such a universal set has been first proposed in quantum-optical setups, but its experimental implementation has…
The Gottesman-Kitaev-Preskill (GKP) encoding of a qubit within an oscillator is particularly appealing for fault-tolerant quantum computing with bosons because Gaussian operations on encoded Pauli eigenstates enable Clifford quantum…
This study presents a roadmap towards utilizing a single arbitrary gate for universal quantum computing. Since two decades ago, it has been widely accepted that almost any single arbitrary gate with qubit number $>2$ is universal. Utilizing…
An effective approach to open systems and irreversible phenomena is presented, where an open system $\Sigma(d)$ with $d$-dimensional Hilbert space, is a subsystem of a larger isolated system $\Sigma(2d)$ (the `full universe') with…
The Mishchenko-Fomenko conjecture says that for each real or complex finite-dimensional Lie algebra $\goth g$ there exists a complete set of commuting polynomials on its dual space $\goth g^*$. In terms of the theory of integrable…
We show that the word problem of the Brin-Higman-Thompson group $n G_{k,1}$ is {\sf coNP}-complete for all $n \ge 2$ and all $k \ge 2$. For this we prove that $n G_{k,1}$ is finitely generated, and that $n G_{k,1}$ contains a subgroup of $2…
We show how one can implement any local quantum gate on specific qubits in an array of qubits by carrying adiabatically a Hamiltonian around a closed loop. We find the exact form of the loop and the Hamiltonian for implementing general one…
We generalize Voronoi's theory of perfect quadratic forms to generalized copositive matrices over a closed convex and full-dimensional cone K. We introduce a notion of a K-copositive minimum and of perfect K-copositive matrices. We consider…
It has been known for almost three decades that many $\mathrm{NP}$-hard optimization problems can be solved in polynomial time when restricted to structures of constant treewidth. In this work we provide the first extension of such results…
We propose a set of universal gate operations for the singlet-triplet qubit realized by two electron spins in a double quantum dot, in the presence of a fixed inhomogeneous magnetic field. All gate operations are achieved by switching the…
It is known that the matrices that can be exactly represented by a multiqubit circuit over the Toffoli+Hadamard, Clifford+$T$, or, more generally, Clifford-cyclotomic gate set are precisely the unitary matrices with entries in the ring…
Suppose $A=k[X_1, X_2, \ldots, X_n]$ is a polynomial ring over a field $k$ and $I$ is an ideal in $A$. Then M. P. Murthy conjectured that $\mu(I)=\mu(I/I^2)$, where $\mu$ denotes the minimal number of generators. Recently, Fasel \cite{F}…