scientific article; zbMATH DE number 7559045
From MaRDI portal
Publication:5090371
DOI10.4230/LIPICS.ITCS.2019.2MaRDI QIDQ5090371
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1804.11084
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving ⋮ Toy models of holographic duality between local Hamiltonians ⋮ Translationally invariant universal quantum Hamiltonians in 1D
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectral gap and exponential decay of correlations
- Fault-tolerant quantum computation by anyons
- The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\)
- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
- Quantum Phase Transitions
- Spectral Sparsification of Graphs
- Universal Quantum Simulators
- HOW TO MAKE THE QUANTUM ADIABATIC ALGORITHM FAIL
- Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
- Resilient quantum computation: error models and thresholds
- Strong converse for identification via quantum channels
- Twice-Ramanujan Sparsifiers
- Sparse Sums of Positive Semidefinite Matrices
- The Complexity of the Local Hamiltonian Problem
- On the Complexity of Commuting Local Hamiltonians, and Tight Conditions for Topological Order in Such Systems
- Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
- Coherence in Spontaneous Radiation Processes
- The PCP theorem by gap amplification
- Product-state approximations to quantum states
- Graph Sparsification by Effective Resistances
This page was built for publication:
