New approaches to complexity via quantum graphs
From MaRDI portal
Cites work
- A ``quantum Ramsey theorem for operator systems
- A generalized solution of the orthogonal Procrustes problem
- A simple protocol for verifiable delegation of quantum computation in one round
- A von Neumann Algebra Approach to Quantum Metrics/Quantum Relations
- Algebras, synchronous games, and chromatic numbers of graphs
- Algorithms and Computation
- An infinite quantum Ramsey theorem
- Chromatic numbers, Sabidussi's theorem and Hedetniemi's conjecture for non-commutative graphs
- Classification of quantum graphs on M2 and their quantum automorphism groups
- Complexity lower bounds for computing the approximately-commuting operator value of non-local games to high precision
- Complexity of stoquastic frustration-free Hamiltonians
- Entanglement Breaking Channels
- scientific article; zbMATH DE number 4178769 (Why is no real title available?)
- scientific article; zbMATH DE number 3503283 (Why is no real title available?)
- scientific article; zbMATH DE number 1776257 (Why is no real title available?)
- scientific article; zbMATH DE number 1849957 (Why is no real title available?)
- scientific article; zbMATH DE number 4185024 (Why is no real title available?)
- MIP* = RE
- Nonlocal games, compression theorems, and the arithmetical hierarchy
- On a problem of formal logic.
- Perfect zero knowledge for quantum multiprover interactive proofs
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- QMA-hardness of consistency of local density matrices with applications to quantum zero-knowledge
- Quantum Cuntz-Krieger algebras
- Quantum delegation with an off-the-shelf device
- Quantum graph homomorphisms via operator systems
- Quantum graphs as quantum relations
- Quantum homomorphisms
- Quantum interactive proofs and the complexity of separability testing
- Quantum Zero-Error Source-Channel Coding and Non-Commutative Graph Theory
- Random quantum graphs
- Rank one subspaces of bimodules over maximal abelian selfadjoint algebras
- Sandwich theorems and capacity bounds for non-commutative graphs
- Spatial isolation implies zero knowledge even in a quantum world
- Spectral bounds for the quantum chromatic number of quantum graphs
- Stoquastic PCP vs. randomness
- Succinct representations of graphs
- Testing product states, quantum Merlin-Arthur games and tensor optimization
- The power of unentanglement
- The quantum-to-classical graph homomorphism game
- The theory of quantum information
- Tolerance relations and operator systems
- Zero-Error Communication via Quantum Channels, Noncommutative Graphs, and a Quantum Lovász Number
This page was built for publication: New approaches to complexity via quantum graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7295936)