Pages that link to "Item:Q5895206"
From MaRDI portal
The following pages link to Quantum lower bounds by quantum arguments (Q5895206):
Displaying 31 items.
- On the power of Ambainis lower bounds (Q557899) (← links)
- Entanglement rates and the stability of the area law for the entanglement entropy (Q739565) (← links)
- A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs (Q835643) (← links)
- Quantum separation of local search and fixed point computation (Q848947) (← links)
- Adversary lower bounds for nonadaptive quantum algorithms (Q980943) (← links)
- Quantum lower bounds for the Goldreich-Levin problem (Q1045938) (← links)
- Quantum query as a state decomposition (Q1643135) (← links)
- Entropy lower bounds for quantum decision tree complexity (Q1847373) (← links)
- A lower bound on the quantum query complexity of read-once functions (Q1880783) (← links)
- A lower bound method for quantum circuits (Q1944121) (← links)
- Intricacies of quantum computational paths (Q1952642) (← links)
- Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives (Q2220875) (← links)
- Quantum and classical tradeoffs (Q2575086) (← links)
- A new quantum lower bound method, (Q2931423) (← links)
- Explicit relation between all lower bound techniques for quantum query complexity (Q2957904) (← links)
- A new quantum lower bound method, with an application to a strong direct product theorem for quantum search (Q3002814) (← links)
- Inverting a permutation is as hard as unordered search (Q3002827) (← links)
- Lower bound for quantum phase estimation (Q3102418) (← links)
- Quantum adversary lower bound for element distinctness with small range (Q3191147) (← links)
- All Classical Adversary Methods are Equivalent for Total Functions (Q3304102) (← links)
- Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs (Q3541808) (← links)
- Quantum vs Classical Proofs and Subset Verification (Q5005122) (← links)
- Quantum adversary (upper) bound (Q5414623) (← links)
- Lower Bounds for Local Search by Quantum Arguments (Q5470715) (← links)
- Quantum weakest preconditions (Q5482269) (← links)
- Automata, Languages and Programming (Q5716754) (← links)
- Deriving Grover's lower bound from simple physical principles (Q5855095) (← links)
- Quantum lower bounds by quantum arguments (Q5894821) (← links)
- Lower bounds for QCDCL via formula gauge (Q6053848) (← links)
- Quantum algorithm for lexicographically minimal string rotation (Q6151147) (← links)
- On query complexity measures and their relations for symmetric functions (Q6547823) (← links)
