Related papers: The Detectability Lemma and Quantum Gap Amplificat…
On one side, so far a great part of the evidence accepted as proof of the alleged quantum non-locality relied on inhomogeneous Bell inequalities involving an additional assumption (no-enhancement) whose role had not been sufficiently…
We characterize the set of generalized quantum measurements that can be decomposed into a continuous measurement process using a stream of probe qubits and a tunable interaction Hamilto- nian. Each probe in the stream interacts weakly with…
We investigate the connection between local minima in the problem Hamiltonian and first order quantum phase transitions during an adiabatic quantum computation. We demonstrate how some properties of the local minima can lead to an extremely…
The configuration space, i.e. the Hilbert space, of compound quantum systems grows exponentially with the number of its subsystems: its dimensionality is given by the product of the dimensions of its constituents. Therefore a full quantum…
We show that under certain technical assumptions, including the existence of a constant mean curvature (CMC) slice and strict positivity of the scalar field, general relativity conformally coupled to a scalar field can be quantised on a…
Recall the classical hypothesis testing setting with two convex sets of probability distributions P and Q. One receives either n i.i.d. samples from a distribution p in P or from a distribution q in Q and wants to decide from which set the…
Non-commutativity is one of the most elementary non-classical features of quantum observables. Here we propose a method to detect non-commutativity of interaction Hamiltonians of two probe objects coupled via a mediator. If these objects…
Adiabatic quantum computing is a framework for quantum computing that is superficially very different to the standard circuit model. However, it can be shown that the two models are computationally equivalent. The key to the proof is a…
We consider the task of approximating the ground state energy of two-local quantum Hamiltonians on bounded-degree graphs. Most existing algorithms optimize the energy over the set of product states. Here we describe a family of shallow…
Providing an optimal path to a quantum annealing algorithm is key to finding good approximate solutions to computationally hard optimization problems. Reinforcement is one of the strategies that can be used to circumvent the exponentially…
In this work, we present a quantum information framework for the entanglement behavior of the low energy quasiparticle (QP) excitations in various quantum phases in one-dimensional (1D) systems. We first establish an exact correspondence…
The derandomization of MA, the probabilistic version of NP, is a long standing open question. In this work, we connect this problem to a variant of another major problem: the quantum PCP conjecture. Our connection goes through the…
A new approach to the classical limit of Grover's algorithm is discussed by assuming a very rapid dephasing of a system between consecutive Grover's unitary operations, which drives pure quantum states to decohered mixed states. One can…
Independent studies by different authors have proposed that classicality may be induced in quantum objects by cosmological constraints presented by an expanding universe of finite extent in space-time. Cosmological effects on a quantum…
Hamiltonian constraints feature in the canonical formulation of general relativity. Unlike typical constraints they cannot be associated with a reduction procedure leading to a non-trivial reduced phase space and this means the physical…
This is not a disproof of the quantum PCP conjecture! In this note we use perturbation on the commuting Hamiltonian problem on a graph, based on results by Bravyi and Vyalyi, to provide a partial no-go theorem for quantum PCP. Specifically,…
A frustration-free local Hamiltonian has the property that its ground state minimises the energy of all local terms simultaneously. In general, even deciding whether a Hamiltonian is frustration-free is a hard task, as it is closely related…
Quantum walk is one of the main tools for quantum algorithms. Defined by analogy to classical random walk, a quantum walk is a time-homogeneous quantum process on a graph. Both random and quantum walks can be defined either in continuous or…
The goal of the present account is to review our efforts to obtain and apply a ``collective'' Hamiltonian for a few, approximately decoupled, adiabatic degrees of freedom, starting from a Hamiltonian system with more or many more degrees of…
For a given Hamiltonian $H$ on a multipartite quantum system, one is interested in finding the energy $E_0$ of its ground state. In the separability approximation, arising as a natural consequence of measurement in a separable basis, one…