English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

We study the computational complexity of certain integrable quantum theoriesin 1+1 dimensions. We formalize a model of quantum computation based on thesetheories. In this model, distinguishable particles start out with known momentaand initial superposition of different configurations. Then the label of theseparticles are measured at the end. We prove that additive approximation tosingle amplitudes of these models can be obtained by the one-clean-qubit model,if no initial superpositions are allowed. However, if arbitrary initial statesand non-adaptive intermediate measurements are allowed, we show thatconditioned on infinite polynomial hierarchy assumption it is hard to samplefrom the output distribution of these models on a classical randomizedcomputer. A classical analogue of this model is also formalized and itscomputational power is pinned down within the complexity classes below BPP andNP.

Computational Complexity of Some Quantum Theories in $1+1$ Dimensions