Class of Highly Entangled Many-Body States that can be Efficiently Simulated
نویسندگان
چکیده
منابع مشابه
Class of highly entangled many-body states that can be efficiently simulated.
We describe a quantum circuit that produces a highly entangled state of N qubits from which one can efficiently compute expectation values of local observables. This construction yields a variational ansatz for quantum many-body states that can be regarded as a generalization of the multiscale entanglement renormalization ansatz (MERA), which we refer to as the branching MERA. In a lattice syst...
متن کاملClass of quantum many-body states that can be efficiently simulated.
We introduce the multiscale entanglement renormalization ansatz, a class of quantum many-body states on a D-dimensional lattice that can be efficiently simulated with a classical computer, in that the expectation value of local observables can be computed exactly and efficiently. The multiscale entanglement renormalization ansatz is equivalent to a quantum circuit of logarithmic depth that has ...
متن کاملCan Classical Epistemic States Be Entangled?
Entanglement is a well-known and central concept in quantum theory, where it expresses a fundamental nonlocality (holism) of ontic quantum states, regarded as independent of epistemic means of gathering knowledge about them. An alternative, epistemic kind of entanglement is proposed for epistemic states (distributions) of dynamical systems represented in classical phase spaces. We conjecture th...
متن کاملAll pure bipartite entangled states can be self-tested
Quantum technologies promise advantages over their classical counterparts in the fields of computation, security and sensing. It is thus desirable that classical users are able to obtain guarantees on quantum devices, even without any knowledge of their inner workings. That such classical certification is possible at all is remarkable: it is a consequence of the violation of Bell inequalities b...
متن کاملOn Families of Split Cuts that Can Be Generated Efficiently
Split cuts represent the most widely used class of cutting planes currently employed by state-of-the-art branch-and-cut solvers for mixed integer linear programming. Rank-1 cuts often have better numerical properties than higher rank cuts. In this paper, we study several heuristics to generate new families of strong rank-1 split cuts, by considering integer linear combinations of the rows of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review Letters
سال: 2014
ISSN: 0031-9007,1079-7114
DOI: 10.1103/physrevlett.112.240502