Approximate Locality for Quantum Systems on Graphs

DOI10.1103/PhysRevLett.101.140503zbMath1228.81131arXivquant-ph/0611231OpenAlexW1968239563WikidataQ51866829 ScholiaQ51866829MaRDI QIDQ3107627

Tobias J. Osborne

Publication date: 26 December 2011

Published in: Physical Review Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0611231

Mathematics Subject Classification ID

Quantum computation (81P68) Selfadjoint operator theory in quantum theory, including spectral analysis (81Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (3)

Unitarity plus causality implies localizability ⋮ Graphs of unitary matrices and positive semidefinite zero forcing ⋮ Almost commuting unitaries with spectral gap are near commuting unitaries

Cites Work

• A remark on the cluster theorem
• Functional Analysis
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximate Locality for Quantum Systems on Graphs