Nondeterministic Quantum Query and Communication Complexities
From MaRDI portal
Recommendations
Cited in
(31)- Quantum zero-error algorithms cannot be composed
- Nonadaptive quantum query complexity
- Information-theoretic approximations of the nonnegative rank
- Pitch, extension complexity, and covering problems
- A short proof that the extension complexity of the correlation polytope grows exponentially
- Quantum certificate complexity
- From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm
- Exponential lower bounds for polytopes in combinatorial optimization
- Tensor rank and strong quantum nondeterminism in multiparty communication
- Fooling one-sided quantum protocols
- Nondeterministic query algorithms
- Quantum Nondeterministic Computation based on Statistics Superselection Rules
- Common information and unique disjointness
- Query complexity in expectation
- Average case polyhedral complexity of the maximum stable set problem
- Quantum weakly nondeterministic communication complexity
- scientific article; zbMATH DE number 6851887 (Why is no real title available?)
- The border support rank of two-by-two matrix multiplication is seven
- Quantum query algorithms are completely bounded forms
- Nondeterministic quantum communication complexity: the cyclic equality game and iterated matrix multiplication
- Quantum query algorithms are completely bounded forms
- Algorithms for NP-Hard Problems via Rank-Related Parameters of Matrices
- A Communication-Efficient Nonlocal Measurement With Application to Communication Complexity and Bipartite Gate Capacities
- Unbounded-Error Classical and Quantum Communication Complexity
- Quantum Weakly Nondeterministic Communication Complexity
- Extended formulations in combinatorial optimization
- Quantum attribute-based encryption: a comprehensive study
- Unbounded-error quantum query complexity
- Towards tight bounds for the graph homomorphism problem parameterized by cutwidth via asymptotic matrix parameters
- Communication memento: memoryless communication complexity
- Exponential separation of quantum and classical online space complexity
This page was built for publication: Nondeterministic Quantum Query and Communication Complexities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4706225)
