Related papers: Two bases suffice for QMA1-completeness
The number of measurements necessary to perform the quantum state reconstruction of a system of qubits grows exponentially with the number of constituents, creating a major obstacle for the design of scalable tomographic schemes. We work…
We define a general formulation of quantum PCPs, which captures adaptivity and multiple unentangled provers, and give a detailed construction of the quantum reduction to a local Hamiltonian with a constant promise gap. The reduction turns…
The thesis is mainly about the construction and implementation of cyclic mutually unbiased bases, dealing with different entanglement structures by discussing the related group structures. A recursive construction for Fermat number…
We show that one can quantum simulate the dynamics of a Sachdev-Ye-Kitaev model with $N$ Majorana modes for time $t$ to precision $\epsilon$ with gate complexity $O(N^{7/2} t + N^{5/2} t \,{\rm polylog}(N/ \epsilon))$. In addition to…
The circuit-to-Hamiltonian construction has found widespread use within the field of Hamiltonian complexity, particularly for proving QMA-hardness results. In this work we examine the ground state energies of the Hamiltonian for standard…
We provide a simplified, yet rigorous presentation of the ideas from Bomb\'{i}n's paper "Gauge Color Codes" [arXiv:1311.0879v3]. Our presentation is self-contained, and assumes only basic concepts from quantum error correction. We provide…
We investigate the advantage of coherent superposition of two different coded channels in quantum metrology. In a continuous variable system, we show that the Heisenberg limit $1/N$ can be beaten by the coherent superposition without the…
The conventional Hamiltonian $H= p^2+ V_N(x)$, where the potential $V_N(x)$ is a polynomial of degree $N$, has been studied intensively since the birth of quantum mechanics. In some cases, its spectrum can be determined by combining the WKB…
Recently Shi proved that Toffoli and Hadamard are universal for quantum computation. This is perhaps the simplest universal set of gates that one can hope for, conceptually; It shows that one only needs to add the Hadamard gate to make a…
We explore ideas for scaling verification methods for quantum circuits using SMT (Satisfiability Modulo Theories) solvers. We propose two primary strategies: (1) decomposing proof obligations via compositional verification and (2)…
Consider the problem: Alice wishes to send the same key to $n-1$ users (Bob, Carol,. . . , Nathan), while preventing eavesdropper Eve from acquiring information without being detected. The problem has no solution in the classical…
Finding the ground energy of a quantum system is a fundamental problem in condensed matter physics and quantum chemistry. Existing classical algorithms for tackling this problem often assume that the ground state has a succinct classical…
The quartic H\'enon-Heiles Hamiltonian $H = (P_1^2+P_2^2)/2+(\Omega_1 Q_1^2+\Omega_2 Q_2^2)/2 +C Q_1^4+ B Q_1^2 Q_2^2 + A Q_2^4 +(1/2)(\alpha/Q_1^2+\beta/Q_2^2) - \gamma Q_1$ passes the Painlev\'e test for only four sets of values of the…
We analyse in details the problems which one faces trying to quantize a scalar field on the spacelike cylinder being the simple example of a spacetime with closed timelike curves. Our analysis brings to light the fact that the usual set of…
Quantum computing involving physical systems with continuous degrees of freedom, such as the quantum states of light, has recently attracted significant interest. However, a well-defined quantum complexity theory for these bosonic…
We give a convergent hierarchy of SDP certificates for bounding the spectral gap of local qubit Hamiltonians from below. Our approach is based on the NPA hierarchy applied to a polynomially-sized system of constraints defining the universal…
Bosonic quantum error correction has proven to be a successful approach for extending the coherence of quantum memories, but to execute deep quantum circuits, high-fidelity gates between encoded qubits are needed. To that end, we present a…
The gauge field formalism, or operator-valued cochain formalism, has recently emerged as a powerful framework for describing quantum Calderbank-Shor-Steane (CSS) codes. In this work, we extend this framework to construct a broad class of…
Semidefinite programs are optimization methods with a wide array of applications, such as approximating difficult combinatorial problems. One such semidefinite program is the Goemans-Williamson algorithm, a popular integer relaxation…
We use a local scale invariance of a classical Hamiltonian and describe how to construct six different formulations of quantum mechanics in spaces with two time-like dimensions. All these six formulations have the same classical limit…