English
Related papers

Related papers: Quantum error suppression with commuting Hamiltoni…

200 papers

Quantum error correction is essential for realizing scalable quantum computation. Among various approaches, low-density parity-check codes over higher-order Galois fields have shown promising performance due to their structured sparsity and…

Quantum Physics · Physics 2025-06-19 Kenta Kasai

Since there are many examples in which no decoherence-free subsystems exist (among them all cases where the error generators act irreducibly on the system Hilbert space), it is of interest to search for novel mechanisms which suppress…

Quantum Physics · Physics 2009-11-11 William Gordon Ritter

Quantum computation in solid state quantum dots faces two significant challenges: Decoherence from interactions with the environment and the difficulty of generating local magnetic fields for the single qubit rotations. This paper presents…

Quantum Physics · Physics 2007-05-23 C. Stephen Hellberg

We present a class of exactly solvable 2D models whose ground states violate conventional beliefs about entanglement scaling in quantum matter. These beliefs are (i) that area law entanglement scaling originates from local correlations…

Quantum Physics · Physics 2023-05-12 Shankar Balasubramanian , Ethan Lake , Soonwon Choi

Decoherence-Free Subsystems (DFS) are a powerful means of protecting quantum information against noise with known symmetry properties. Although Hamiltonians theoretically exist that can implement a universal set of logic gates on DFS…

Quantum Physics · Physics 2007-05-23 P. Cappellaro , J. S. Hodges , T. F. Havel , D. G. Cory

We show that trapped ions can be used to simulate a highly symmetrical Hamiltonian with eingenstates naturally protected against local sources of decoherence. This Hamiltonian involves long range coupling between particles and provides a…

We show an equivalence relation between fault-tolerant circuits for a stabilizer code and fault-tolerant adiabatic processes for holonomic quantum computation (HQC), in the case where quantum information is encoded in the degenerated ground…

Quantum Physics · Physics 2015-06-17 Yi-Cong Zheng , Todd A. Brun

The propagation of errors severely compromises the reliability of quantum computations. The quantum adiabatic algorithm is a physically motivated method to prepare ground states of classical and quantum Hamiltonians. Here, we analyze the…

Quantum Physics · Physics 2024-04-25 Benjamin F. Schiffer , Adrian Franco Rubio , Rahul Trivedi , J. Ignacio Cirac

The simulation of complex quantum systems on a quantum computer is studied, taking the kicked Harper model as an example. This well-studied system has a rich variety of dynamical behavior depending on parameters, displays interesting…

Quantum Physics · Physics 2007-05-23 Benjamin Levi , Bertrand Georgeot

The delocalization or scrambling of quantum information has emerged as a central ingredient in the understanding of thermalization in isolated quantum many-body systems. Recently, significant progress has been made analytically by modeling…

Statistical Mechanics · Physics 2022-04-20 Jonah Kudler-Flam , Ramanjit Sohal , Laimei Nie

Protecting information against decoherence in open quantum systems remains a central challenge for quantum computing. In particular, passive error correction schemes have so far been limited to static memories rather than dynamical qubits.…

Quantum Physics · Physics 2026-02-25 Mert Esencan , A. I. Lvovsky , Berislav Buča

We consider the discrimination of bipartite quantum states and establish a relation between nonlocal quantum state ensemble and quantum data hiding processing. Using a bound on optimal local discrimination of bipartite quantum states, we…

Quantum Physics · Physics 2024-05-14 Donghoon Ha , Jeong San Kim

Quantum entanglement is considered, by and large, to be a very delicate and non-robust phenomenon that is very hard to maintain in the presence of noise, or non-zero temperatures. In recent years however, and motivated, in part, by a quest…

Quantum Physics · Physics 2017-02-27 Lior Eldar

We consider a quantum system subject to superselection rules, for which certain restrictions apply to the quantum operations that can be implemented. It is shown how the notion of quantum-nonlocality has to be redefined in the presence of…

Quantum Physics · Physics 2009-11-10 F. Verstraete , J. I. Cirac

We propose a two qubit experiment for validating tunable antiferromagnetic $XX$ interactions in quantum annealing. Such interactions allow the time-dependent Hamiltonian to be non-stoquastic, and the instantaneous ground state can have…

Quantum Physics · Physics 2020-01-10 Tameem Albash

The Kitaev honeycomb model is an approximate topological quantum error correcting code in the same phase as the toric code, but requiring only a 2-body Hamiltonian. As a frustrated spin model, it is well outside the commuting models of…

Quantum Physics · Physics 2017-09-01 Yi-Chan Lee , Courtney Brell , Steven T. Flammia

We investigate the relationship between the energy spectrum of a local Hamiltonian and the geometric properties of its ground state. By generalizing a standard framework from the analysis of Markov chains to arbitrary (non-stoquastic)…

Quantum Physics · Physics 2018-10-16 Elizabeth Crosson , John Bowen

We develop dynamical non-Markovian description of quantum computing in weak coupling limit, in lowest order approximation. We show that long range memory of quantum reservoir produces strong interrelation between structure of noise and…

Quantum Physics · Physics 2009-11-07 Robert Alicki , Michal Horodecki , Pawel Horodecki , Ryszard Horodecki

An effective time-dependent Hamiltonian can be implemented by making a quantum system fly through an inhomogeneous potential, realizing, for example, a quantum gate on its internal degrees of freedom. However, flying systems have a spatial…

Quantum Physics · Physics 2024-06-13 Nicolò Piccione , Léa Bresque , Andrew N. Jordan , Robert S. Whitney , Alexia Auffèves

The k-local Hamiltonian problem is a natural complete problem for the complexity class QMA, the quantum analog of NP. It is similar in spirit to MAX-k-SAT, which is NP-complete for k<=2. It was known that the problem is QMA-complete for any…

Quantum Physics · Physics 2007-05-23 Julia Kempe , Alexei Kitaev , Oded Regev