On the Computational Complexity of Curing Non-Stoquastic Hamiltonians

Nature Communications - United Kingdom
doi 10.1038/s41467-019-09501-6
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Two-Local Qubit Hamiltonians: When Are They Stoquastic?

Quantum
2019English

Quantum Complexity of Time Evolution With Chaotic Hamiltonians

Journal of High Energy Physics
High Energy PhysicsNuclear
2020English

On the Computational Complexity of Matrix Semigroup Problems

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2012English

On the Computational Complexity of Approximation Operators Ii

1976English

Computational Complexity and Knowledge Complexity

SIAM Journal on Computing
MathematicsComputer Science
1998English

On Computational Complexity of Cremer Julia Sets

Fundamenta Mathematicae
Number TheoryAlgebra
2020English

The Computational Complexity of Program Schemata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1974English

Computational Complexity of Hedonic Games on Sparse Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

The Computational Complexity of Program Schemata

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
1976English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy