- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1029-8479
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
Circuit complexity and 2D bosonisation ; volume:2019 ; number:10 ; day:30 ; month:10 ; year:2019 ; pages:1-30 ; date:10.2019
Journal of high energy physics ; 2019, Heft 10 (30.10.2019), 1-30, 10.2019
- Creator
-
Ge, Dongsheng
Policastro, Giuseppe
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1007/JHEP10(2019)276
- URN
-
urn:nbn:de:101:1-2020030320364480972852
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:59 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Ge, Dongsheng
- Policastro, Giuseppe
- SpringerLink (Online service)
Other Objects (12)
Circuit Complexity in Z2 EEFT
Circuit complexity for coherent states
Circuit complexity for free fermions
Finite automata, formal logic, and circuit complexity
Characterising QBF Hardness via Circuit Complexity
Circuit complexity in quantum field theory
Circuit complexity of group theoretic problems
Circuit complexity in interacting QFTs and RG flows
Introduction to circuit complexity : a uniform approach
Descriptive complexity of circuit-based counting classes
Variational quantum eigensolver with reduced circuit complexity
On the space and circuit complexity of parameterized problems
Circuit Complexity in Z2 EEFT
Circuit complexity for coherent states
Circuit complexity for free fermions
Finite automata, formal logic, and circuit complexity
Characterising QBF Hardness via Circuit Complexity
Circuit complexity in quantum field theory
Circuit complexity of group theoretic problems
Circuit complexity in interacting QFTs and RG flows
Introduction to circuit complexity : a uniform approach
Descriptive complexity of circuit-based counting classes
Variational quantum eigensolver with reduced circuit complexity
On the space and circuit complexity of parameterized problems
Circuit Complexity in Z2 EEFT
Circuit complexity for coherent states
Circuit complexity for free fermions
Finite automata, formal logic, and circuit complexity
Characterising QBF Hardness via Circuit Complexity
Circuit complexity in quantum field theory
Circuit complexity of group theoretic problems
Circuit complexity in interacting QFTs and RG flows
Introduction to circuit complexity : a uniform approach
Descriptive complexity of circuit-based counting classes
Variational quantum eigensolver with reduced circuit complexity