Complexity of quantum impurity problems
From MaRDI portal
Publication:2411633
DOI10.1007/s00220-017-2976-9zbMath1394.81171arXiv1609.00735OpenAlexW3099799934MaRDI QIDQ2411633
Publication date: 24 October 2017
Published in: Communications in Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.00735
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
Matchgate shadows for fermionic quantum simulation ⋮ Approximation algorithms for quantum many-body problems ⋮ Free fermions behind the disguise ⋮ Boundary theories of critical matchgate tensor networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Conformal field theory
- A factorization algorithm to compute Pfaffians
- Rational approximation to \(|x|\)
- Algorithm 923
- Functional Inequalities for Complete Elliptic Integrals and Their Ratios
- Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions
- Quantum Hamiltonian Complexity
- Adiabatic quantum state generation and statistical zero knowledge
- Computing Matrix Eigenvalues and Polynomial Zeros Where the Output is Real
- ZOLOTAREV PROBLEMS CONNECTED WITH RATIONAL FUNCTIONS
- Quantum Theory of Many-Particle Systems. I. Physical Interpretations by Means of Density Matrices, Natural Spin-Orbitals, and Convergence Problems in the Method of Configurational Interaction
This page was built for publication: Complexity of quantum impurity problems
