Related papers: Two bases suffice for QMA1-completeness
Executing quantum algorithms on a quantum computer requires compilation to representations that conform to all restrictions imposed by the device. Due to devices' limited coherence times and gate fidelities, the compilation process has to…
We clarify the lore that anomaly-free symmetries are either on-site or can be transformed into on-site symmetries. We prove that any finite, internal, anomaly-free symmetry in a 1+1d lattice Hamiltonian system can be disentangled into an…
We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we show hardness of a classical tiling problem on an N x N…
We show that the NP complete problems MAX CUT and INDEPENDENT SET can be formulated as the 2-local Hamiltonian problem as defined by Kitaev. He introduced the quantum complexity class BQNP as the quantum analog of NP, and showed that the…
We introduce a simple sub-universal quantum computing model, which we call the Hadamard-classical circuit with one-qubit (HC1Q) model. It consists of a classical reversible circuit sandwiched by two layers of Hadamard gates, and therefore…
A technique for constructing an infinite tower of pairs of PT-symmetric Hamiltonians, $\hat{H}_n$ and $\hat{K}_n$ (n=2,3,4,...), that have exactly the same eigenvalues is described. The eigenvalue problem for the first Hamiltonian…
All Hamiltonian complexity results to date have been proven by constructing a local Hamiltonian whose ground state -- or at least some low-energy state -- is a "computational history state", encoding a quantum computation as a superposition…
Calderbank-Shor-Steane (CSS) quantum error-correcting codes are based on pairs of classical codes which are mutually dual containing. Explicit constructions of such codes for large blocklengths and with good error correcting properties are…
In this paper, we compute the injective norm - a.k.a. geometric entanglement - of standard basis states of CSS quantum error-correcting codes. The injective norm of a quantum state is a measure of genuine multipartite entanglement.…
Kliuchnikov, Maslov, and Mosca proved in 2012 that a $2\times 2$ unitary matrix $V$ can be exactly represented by a single-qubit Clifford+$T$ circuit if and only if the entries of $V$ belong to the ring $\mathbb{Z}[1/\sqrt{2},i]$. Later…
To treat a problem with a Quantum Processing Unit (QPU), it must be transformed into a sequence of quantum operations, or gates: this is the quantum description of the problem. These operations are either packed into a query (i.e. quantum…
Quantum error correcting codes play the role of suppressing noise and decoherence in quantum systems by introducing redundancy. Some strategies can be used to improve the parameters of these codes. For example, entanglement can provide a…
Estimation of the minimum eigenvalue of a quantum Hamiltonian can be formalised as the Local Hamiltonian problem. We study the natural special case of the Local Hamiltonian problem where the same 2-local interaction, with differing weights,…
We investigate CSS and CSS-T quantum error-correcting codes from the point of view of their existence, rarity, and performance. We give a lower bound on the number of pairs of linear codes that give rise to a CSS code with good correction…
We show that for a particular model, the quantum mechanical bootstrap is capable of finding exact results. We consider a solvable system with Hamiltonian $H=SZ(1-Z)S$, where $Z$ and $S$ satisfy canonical commutation relations. While this…
Near-term quantum computers are primarily limited by errors in quantum operations (or gates) between two quantum bits (or qubits). A physical machine typically provides a set of basis gates that include primitive 2-qubit (2Q) and 1-qubit…
The presence of symmetries, be they discrete or continuous, in a physical system typically leads to a reduction in the problem to be solved. Here we report that neither translational invariance nor rotational invariance reduce the…
This paper proposes to broaden the canonical formulation of quantum mechanics. Ordinarily, one imposes the condition $H^\dagger=H$ on the Hamiltonian, where $\dagger$ represents the mathematical operation of complex conjugation and matrix…
We introduce an algebraic methodology for designing exactly-solvable Lie model Hamiltonians. The idea consists in looking at the algebra generated by bond operators. We illustrate how this method can be applied to solve numerous problems of…
The problem of building supersymmetry in the quantum mechanics of two Coulombian centers of force is analyzed. It is shown that there are essentially two ways of proceeding. The spectral problems of the SUSY (scalar) Hamiltonians are quite…