SearcharxivSearch

arXiv · 1201.3387

Trivial Low Energy States for Commuting Hamiltonians, and the Quantum PCP Conjecture

Abstract

We consider whether or not Hamiltonians which are sums of commuting projectors have "trivial" ground states which can be constructed by a local quantum circuit of bounded depth and range acting on a product state. While the toric code only has nontrivial ground states, commuting projector Hamiltonians which are sums of two-body interactions have trivial ground states. We define an "interaction complex" for a Hamiltonian, generalizing the interaction graph, and we show that if this complex can be continuously mapped to a 1-complex using a map with bounded diameter of pre-images then the Hamiltonian has a trivial ground state assuming one technical condition on the Hamiltonian (this condition holds for all stabilizer Hamiltonians, and we also prove the result for all Hamiltonians under an assumption on the 1-complex). While this includes cases considered by Ref., it also includes other Hamiltonians whose interaction complexes cannot be coarse-grained into the case of Ref. One motivation for this is the quantum PCP conjecture. Many commonly studied interaction complexes can be mapped to a 1-complex after removing a small fraction of sites. For commuting projector Hamiltonians on such complexes, a trivial ground state for the Hamiltonian with those sites removed is a low energy trivial state for the original Hamiltonian. Such states can act as a classical witness to the existence of a low energy state. While this result applies only to commuting Hamiltonians, it suggests that to prove a quantum PCP conjecture one should consider interaction complexes which cannot be mapped to 1-complexes after removing a small fraction of cells. We define this more precisely below; in a sense this generalizes the idea of an expander graph. Surprisingly, such complexes do exist as will be shown elsewhere, and have useful properties in quantum coding theory.

Explore related subjects

Keep this discovery

BibTeXRIS

M. B. Hastings. 2012-11-28. Trivial Low Energy States for Commuting Hamiltonians, and the Quantum PCP Conjecture. https://arxiv.org/abs/1201.3387

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph