Related papers: Towards a universal gateset for $\mathsf{QMA}_1$

Let $A$ be a matrix with nonnegative real entries. A nonnegative factorization of size $k$ is a representation of $A$ as a sum of $k$ nonnegative rank-one matrices. The space of all such factorizations is a bounded semialgebraic set, and we…

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…

We find exact solutions for a universal set of quantum gates on a scalable candidate for quantum computers, namely an array of two level systems. The gates are constructed by a combination of dynamical and geometrical (non-Abelian) phases.…

We study brick wall quantum circuits enjoying a global fermionic symmetry. The constituent 2-qubit gate, and its fermionic symmetry, derive from a 2-particle scattering matrix in integrable, supersymmetric quantum field theory in 1+1…

We propose a method for exact circuit synthesis using a discrete gate set, as required for fault-tolerant quantum computing. Our approach translates the problem of synthesizing a gate specified by its unitary matrix into a boolean…

Matchgate unitaries are ubiquitous in quantum computation due to their relation to non-interacting fermions and because they can be used to benchmark quantum computers. Implementing such unitaries on fault-tolerant devices requires first…

A universal set of quantum gates is constructed for the recently developed jump-error correcting quantum codes. These quantum codes are capable of correcting errors arising from the spontaneous decay of distinguishable qubits into…

Many promising quantum algorithms in economics, medical science, and material science rely on circuits that are parameterized by a large number of angles. To ensure that these algorithms are efficient, these parameterized circuits must be…

In this paper, we propose a way to achieve protected universal computation in a neutral atom quantum computer subject to collective dephasing. Our proposal relies on the existence of a Decoherence Free Subspace (DFS), resulting from…

A universal set of gates for (classical or quantum) computation is a set of gates that can be used to approximate any other operation. It is well known that a universal set for classical computation augmented with the Hadamard gate results…

Quantum algorithms offer a dramatic speedup for computational problems in machine learning, material science, and chemistry. However, any near-term realizations of these algorithms will need to be heavily optimized to fit within the finite…

We consider the dichotomy conjecture for consistent query answering under primary key constraints. It states that, for every fixed Boolean conjunctive query q, testing whether q is certain (i.e. whether it evaluates to true over all repairs…

There is a well-known global equivalence between \Sigma^1_2 sets having the Universal Baire property, two-step \Sigma^1_3 generic absoluteness, and the closure of the universe under the sharp operation. In this note, we determine the exact…

Let $\mathscr{P}_\mathbb{Q}=\{ \alpha^n \; : \; \alpha \in \mathbb{Q}, \; n \ge 2\}$ be the set of rational perfect powers, and let $S \subseteq \mathscr{P}_\mathbb{Q}$ be a finite subset. We prove the existence of a polynomial $f_S \in…

We study the Chern-Simons approach to the topological quantum computing. We use quantum $\mathcal{R}$-matrices as universal quantum gates and study the approximations of some one-qubit operations. We make some modifications to the known…

A large-scalable quantum computer model, whose qubits are represented by the subspace subtended by the ground state and the single exciton state on semiconductor quantum dots, is proposed. A universal set of quantum gates in this system may…

Symmetry adaptation, universality, and gate efficiency are central but often competing requirements in quantum algorithms for electronic structure and many-body physics. For example, fully symmetry-adapted universal operator pools typically…

We show that a certain geometric property, the QSF introduced by S. Brick and M. Mihalik, is universally true for {\ibf all} finitely presented groups $\Gamma$. One way of defining this property is the existence of a smooth compact manifold…

This thesis aims to establish notions of symmetry for quantum states and channels as well as describe algorithms to test for these properties on quantum computers. Ideally, the work will serve as a self-contained overview of the subject. We…

We demonstrate that in a coupled two-qubit system any single-qubit gate can be decomposed into two conditional two-qubit gates and that any conditional two-qubit gate can be implemented by a manipulation analogous to that used for a…