Non-commuting two-local Hamiltonians for quantum error suppression

DOI10.1007/S11128-017-1527-9MaRDI QIDQ2412625zbMATH OpenOpenAlexWikidataFDO

Authors Zhang Jiang, Eleanor G. Rieffel

Publication date 24 October 2017

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1511.01997

zbMATH Keywords

adiabatic quantum computingquantum annealingadiabatic quantum optimizationerror suppressionBacon-Shor codesubsystem quantum error-correcting codetwo-local Hamiltonian

Mathematics Subject Classification ID

Quantum coding (general) (81P70) Other types of codes (94B60)

Abstract: Physical constraints make it challenging to implement and control many-body interactions. For this reason, designing quantum information processes with Hamiltonians consisting of only one- and two-local terms is a worthwhile challenge. Enabling error suppression with two-local Hamiltonians is particularly challenging. A no-go theorem of Marvian and Lidar [Physical Review Letters 113(26), 260504 (2014)] demonstrates that, even allowing particles with high Hilbert-space dimension, it is impossible to protect quantum information from single-site errors by encoding in the ground subspace of any Hamiltonian containing only commuting two-local terms. Here, we get around this no-go result by encoding in the ground subspace of a Hamiltonian consisting of non-commuting two-local terms arising from the gauge operators of a subsystem code. Specifically, we show how to protect stored quantum information against single-qubit errors using a Hamiltonian consisting of sums of the gauge generators from Bacon-Shor codes [Physical Review A 73(1), 012340 (2006)] and generalized-Bacon-Shor code [Physical Review A 83(1), 012320 (2011)]. Our results imply that non-commuting two-local Hamiltonians have more error-suppressing power than commuting two-local Hamiltonians. While far from providing full fault tolerance, this approach improves the robustness achievable in near-term implementable quantum storage and adiabatic quantum computations, reducing the number of higher-order terms required to encode commonly used adiabatic Hamiltonians such as the Ising Hamiltonians common in adiabatic quantum optimization and quantum annealing.

Recommendations

• Error suppression and error correction in adiabatic quantum computation: non-equilibrium dynamics
• scientific article; zbMATH DE number 5568625
• Hamiltonian quantum simulation with bounded-strength controls
• Limitations of passive protection of quantum information
• Complexity classification of two-qubit commuting Hamiltonians

Cites work

• scientific article; zbMATH DE number 5613917 (Why is no real title available?)
• Commutative version of the local Hamiltonian problem and common eigenspace problem
• On the Complexity of Commuting Local Hamiltonians, and Tight Conditions for Topological Order in Such Systems
• On vacuum negative refraction, the effective medium and Sylvester's Inertia Theorem: the resolution of a paradox
• Quantum computing. A gentle introduction
• Toric codes and quantum doubles from two-body Hamiltonians

Cited in

(4)

• Error suppression and error correction in adiabatic quantum computation: non-equilibrium dynamics
• Nonlocal quantum information in bipartite quantum error correction
• Fault-tolerant quantum error correction for non-abelian anyons
• Approximate Bacon-Shor code and holography

This page was built for publication: Non-commuting two-local Hamiltonians for quantum error suppression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2412625)