• Rapid Communication

Undecidability in tensor network states

Jason Morton and Jacob Biamonte
Phys. Rev. A 86, 030301(R) – Published 10 September 2012

Abstract

Recent work has examined how undecidable problems can arise in quantum-information science. We augment this by introducing three undecidable problems stated in terms of tensor networks. These relate to ideas of Penrose about the physicality of a spin network representing a physical process, closed timelike curves, and Boolean relation theory. Seemingly slight modifications of the constraints on the topology or the tensor families generating the networks lead to problems that transition from decidable to undecidable to even always satisfiable.

  • Figure
  • Received 20 May 2012

DOI:https://doi.org/10.1103/PhysRevA.86.030301

©2012 American Physical Society

Authors & Affiliations

Jason Morton1,* and Jacob Biamonte2,3,†

  • 1Department of Mathematics, Pennsylvania State University, University Park, Pennsylvania 16802, USA
  • 2Institute for Scientific Interchange, ISI Foundation, Via Alassio 11/c, 10126 Torino, Italy
  • 3Centre for Quantum Technologies, National University of Singapore, Block S15, 3 Science Drive 2, Singapore 117543

  • *morton@math.psu.edu
  • jacob.biamonte@qubit.org

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 86, Iss. 3 — September 2012

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×