English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Path integral optimization as circuit complexity

MPS-Authors
/persons/resource/persons231236

Camargo,  Hugo
Gravity, Quantum Fields and Information, AEI-Golm, MPI for Gravitational Physics, Max Planck Society;

/persons/resource/persons209103

Heller,  Michal P.
Gravity, Quantum Fields and Information, AEI-Golm, MPI for Gravitational Physics, Max Planck Society;

/persons/resource/persons224771

Jefferson,  Ro
Gravity, Quantum Fields and Information, AEI-Golm, MPI for Gravitational Physics, Max Planck Society;

/persons/resource/persons231238

Knaute,  Johannes
Gravity, Quantum Fields and Information, AEI-Golm, MPI for Gravitational Physics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

1904.02713.pdf
(Preprint), 433KB

PhysRevLett.123.011601.pdf
(Publisher version), 224KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Camargo, H., Heller, M. P., Jefferson, R., & Knaute, J. (2019). Path integral optimization as circuit complexity. Physical Review Letters, 123(1): 011601. doi:10.1103/PhysRevLett.123.011601.


Cite as: https://hdl.handle.net/21.11116/0000-0003-5536-1
Abstract
Early efforts to understand complexity in field theory have primarily
employed a geometric approach based on the concept of circuit complexity in
quantum information theory. In a parallel vein, it has been proposed that
certain deformations of the Euclidean path integral that prepares a given
operator or state may provide an alternative definition, whose connection to
the standard notion of complexity is less apparent. In this letter, we bridge
the gap between these two proposals in two-dimensional conformal field
theories, by explicitly showing how the latter approach from path integral
optimization may be given a concrete realization within the standard gate
counting framework. In particular, we show that when the background geometry is
deformed by a Weyl rescaling, a judicious gate counting allows one to recover
the Liouville action as a particular choice within a more general class of cost
functions.