Pages that link to "Item:Q5465869"
From MaRDI portal
The following pages link to FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science (Q5465869):
Displaying 9 items.
- On complexity of the quantum Ising model (Q507268) (← links)
- The power of quantum systems on a line (Q842451) (← links)
- The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\) (Q2018136) (← links)
- Complexity classification of local Hamiltonian problems (Q2799351) (← links)
- (Q3191569) (← links)
- Hardness and Ease of Curing the Sign Problem for Two-Local Qubit Hamiltonians (Q3387762) (← links)
- (Q5020598) (← links)
- Exploiting subspace constraints and \textit{ab initio} variational methods for quantum chemistry (Q6559184) (← links)
- Quantum interactive proofs using quantum energy teleportation (Q6566210) (← links)