On the public citation graph
Quantum Lower Bounds by Quantum Arguments
0 signed · 318 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-48224-5_29openalex-snapshot
Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness
inferredcites →https://doi.org/10.1016/0304-3975(92)90260-mopenalex-snapshot
On the distributional complexity of disjointness
inferredcites →https://doi.org/10.1016/s0020-0190(00)00069-7openalex-snapshot
Lower bounds of quantum black-box complexity and degree of approximating polynomials by influence of Boolean variables
inferredcites →https://doi.org/10.1098/rsta.1998.0247openalex-snapshot
On the power of quantum computation
inferredcites →https://doi.org/10.1103/physrevlett.81.5442openalex-snapshot
Limit on the Speed of Quantum Computation in Determining Parity
inferredcites →https://doi.org/10.1103/physrevlett.85.5448openalex-snapshot
Communication Capacity of Quantum Computation
inferredcites →https://doi.org/10.1109/ccc.2001.933879openalex-snapshot
Communication complexity lower bounds by polynomials
inferredcites →https://doi.org/10.1109/ccc.2001.933880openalex-snapshot
Quantum algorithms for element distinctness
inferredcites →https://doi.org/10.1137/0405044openalex-snapshot
The Probabilistic Communication Complexity of Set Intersection
inferredcites →https://doi.org/10.1137/s0097539795293172openalex-snapshot
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
inferredcites →https://doi.org/10.1137/s0097539796300933openalex-snapshot
Strengths and Weaknesses of Quantum Computing
inferredcites →https://doi.org/10.1145/261342.261346openalex-snapshot
Quantum cryptanalysis of hash and claw-free functions
inferredcites →https://doi.org/10.1145/301250.301349openalex-snapshot
The quantum query complexity of approximating the median and related statistics
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/9612026openalex-snapshot
An Analog Analogue of a Digital Quantum Computation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11523468_105openalex-snapshot
All Quantum Adversary Methods Are Equivalent
inferred← citeshttps://doi.org/10.1007/11683858_1openalex-snapshot
Quantum Identification of Boolean Oracles
inferred← citeshttps://doi.org/10.1007/11683858_2openalex-snapshot
Query Complexity of Quantum Biased Oracles
inferred← citeshttps://doi.org/10.1007/11780342_32openalex-snapshot
Lower Bounds Using Kolmogorov Complexity
inferred← citeshttps://doi.org/10.1007/11809678_14openalex-snapshot
Robust Quantum Algorithms with ε-Biased Oracles
inferred← citeshttps://doi.org/10.1007/11894841_10openalex-snapshot
How Many Query Superpositions Are Needed to Learn?
inferred← citeshttps://doi.org/10.1007/3-540-44683-4_7openalex-snapshot
Introduction to Recent Quantum Algorithms
inferred← citeshttps://doi.org/10.1007/978-0-387-30162-4_308openalex-snapshot
Quantum Algorithm for Finding Triangles
inferred← citeshttps://doi.org/10.1007/978-1-4939-2864-4_308openalex-snapshot
Quantum Algorithm for Finding Triangles
inferred← citeshttps://doi.org/10.1007/978-3-030-19066-8_6openalex-snapshot
Conclusion and Further Remarks
inferred← citeshttps://doi.org/10.1007/978-3-030-26951-7_10openalex-snapshot
Quantum Security Proofs Using Semi-classical Oracles
inferred← citeshttps://doi.org/10.1007/978-3-030-83508-8_39openalex-snapshot
A Query-Efficient Quantum Algorithm for Maximum Matching on General Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-92062-3_19openalex-snapshot
Franchised Quantum Money
inferred← citeshttps://doi.org/10.1007/978-3-031-58737-5_1openalex-snapshot
The NISQ Complexity of Collision Finding
inferred← citeshttps://doi.org/10.1007/978-3-031-68391-6_7openalex-snapshot
Quantum One-Wayness of the Single-Round Sponge with Invertible Permutations
inferred← citeshttps://doi.org/10.1007/978-3-032-12296-4_15openalex-snapshot
NISQ Security and Complexity via Simple Classical Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-319-09704-6_1openalex-snapshot
Recent Developments in Quantum Algorithms and Complexity
inferred← citeshttps://doi.org/10.1007/978-3-319-19225-3_15openalex-snapshot
Quantum Queries on Permutations
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_19openalex-snapshot
The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-24618-3_11openalex-snapshot
Quantum Query Complexity for Some Graph Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-24749-4_10openalex-snapshot
Quantum Identification of Boolean Oracles
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_102openalex-snapshot
On the Power of Ambainis’s Lower Bounds
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_42openalex-snapshot
Quantum Query Complexity of Some Graph Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_83openalex-snapshot
A Polynomial Quantum Query Lower Bound for the Set Equality Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_65openalex-snapshot
An Algorithmic Argument for Nonadaptive Query Complexity Lower Bounds on Advised Quantum Computation
inferred← citeshttps://doi.org/10.1007/978-3-540-70575-8_71openalex-snapshot
Optimal Quantum Adversary Lower Bounds for Ordered Search
inferred← citeshttps://doi.org/10.1007/978-3-540-70918-3_13openalex-snapshot
A New Rank Technique for Formula Size Lower Bounds
inferred← citeshttps://doi.org/10.1007/978-3-540-74240-1_22openalex-snapshot
The Quantum Query Complexity of Algebraic Properties
inferred← citeshttps://doi.org/10.1007/978-3-540-77566-9_44openalex-snapshot
The Quantum Complexity of Group Testing
inferred← citeshttps://doi.org/10.1007/978-3-540-85363-3_31openalex-snapshot
Quantum and Randomized Lower Bounds for Local Search on Vertex-Transitive Graphs
inferred← citeshttps://doi.org/10.1007/978-3-540-92182-0_79openalex-snapshot
Quantum Query Complexity of Boolean Functions with Small On-Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-02979-0_24openalex-snapshot
Quantum Queries on Permutations with a Promise
inferred← citeshttps://doi.org/10.1007/978-3-642-15155-2_1openalex-snapshot
New Developments in Quantum Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_10openalex-snapshot
Quantum Counterfeit Coin Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-22935-0_31openalex-snapshot
Quantum Property Testing for Bounded-Degree Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-30574-0_59openalex-snapshot
Quantum and Biocomputing – Common Notions and Targets
inferred← citeshttps://doi.org/10.1007/978-3-642-31155-0_34openalex-snapshot
Reconstructing Strings from Substrings with Quantum Queries
inferred← citeshttps://doi.org/10.1007/978-3-642-31653-1_3openalex-snapshot
Recovering Strings in Oracles: Quantum and Classic
inferred← citeshttps://doi.org/10.1007/978-3-642-31968-6_45openalex-snapshot
Solving the 0-1 Knapsack Problem with Polynomial-Time Quantum Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-642-54429-3_6openalex-snapshot
Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas
inferred← citeshttps://doi.org/10.1007/978-3-662-44777-2_49openalex-snapshot
Optimal Parallel Quantum Query Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-662-49384-7_15openalex-snapshot
Mitigating Multi-target Attacks in Hash-Based Signatures
inferred← citeshttps://doi.org/10.1007/978-981-99-8730-6_12openalex-snapshot
Towards Compressed Permutation Oracles
inferred← citeshttps://doi.org/10.1007/s00037-006-0212-7openalex-snapshot
THE QUANTUM ADVERSARY METHOD AND CLASSICAL FORMULA SIZE LOWER BOUNDS
inferred← citeshttps://doi.org/10.1007/s00037-013-0066-8openalex-snapshot
A strong direct product theorem for quantum query complexity
inferred← citeshttps://doi.org/10.1007/s00037-014-0084-1openalex-snapshot
On the Power of Non-adaptive Learning Graphs
inferred← citeshttps://doi.org/10.1007/s00037-015-0099-2openalex-snapshot
Quantum Algorithms for Learning Symmetric Juntas via the Adversary Bound
inferred← citeshttps://doi.org/10.1007/s00037-016-0139-6openalex-snapshot
Quantum Query Complexity of Almost All Functions with Fixed On-set Size
inferred← citeshttps://doi.org/10.1007/s00037-025-00277-4openalex-snapshot
An Exponential Separation Between Quantum Query Complexity and the Polynomial Degree
inferred← citeshttps://doi.org/10.1007/s00224-008-9118-xopenalex-snapshot
Quantum Algorithms for Matching Problems
inferred← citeshttps://doi.org/10.1007/s00450-006-0008-7openalex-snapshot
Quantum algorithms: A survey of some recent results
inferred← citeshttps://doi.org/10.1007/s00453-007-9022-9openalex-snapshot
A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs
inferred← citeshttps://doi.org/10.1007/s00453-008-9169-zopenalex-snapshot
Quantum and Classical Query Complexities of Local Search Are Polynomially Related
inferred← citeshttps://doi.org/10.1007/s00453-008-9170-6openalex-snapshot
On the Quantum Query Complexity of Local Search in Two and Three Dimensions
inferred← citeshttps://doi.org/10.1007/s00453-013-9784-1openalex-snapshot
Evolutionary Algorithms for Quantum Computers
inferred← citeshttps://doi.org/10.1007/s00453-015-0060-4openalex-snapshot
Quantum Pattern Matching Fast on Average
inferred← citeshttps://doi.org/10.1007/s00453-016-0206-zopenalex-snapshot
Optimal Parallel Quantum Query Algorithms
inferred← citeshttps://doi.org/10.1007/s10773-011-0701-6openalex-snapshot
Problem-Solution Symmetry in Grover’s Quantum Search Algorithm
inferred← citeshttps://doi.org/10.1007/s10773-020-04644-5openalex-snapshot
A Quantum Evolving Secret Sharing Scheme
inferred← citeshttps://doi.org/10.1007/s11128-006-0023-4openalex-snapshot
On the Role of Hadamard Gates in Quantum Circuits
inferred← citeshttps://doi.org/10.1007/s11128-011-0233-2openalex-snapshot
Optimality proofs of quantum weight decision algorithms
inferred← citeshttps://doi.org/10.1007/s11128-019-2297-3openalex-snapshot
Evaluation of exact quantum query complexities by semidefinite programming
inferred← citeshttps://doi.org/10.1007/s11128-020-02975-0openalex-snapshot
From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm
inferred← citeshttps://doi.org/10.1007/s11128-023-03910-9openalex-snapshot
Quantum bounds for 2D-grid and Dyck language
inferred← citeshttps://doi.org/10.1007/s11128-023-04085-zopenalex-snapshot
Quantum attribute-based encryption: a comprehensive study
inferred← citeshttps://doi.org/10.1007/s42484-021-00049-7openalex-snapshot
Quantum-accessible reinforcement learning beyond strictly epochal environments
inferred← citeshttps://doi.org/10.1016/b978-0-44-327704-7.00006-2openalex-snapshot
Development history and potential applications of quantum computing
inferred← citeshttps://doi.org/10.1016/b978-0-44-327704-7.00012-8openalex-snapshot
Quantum computational complexity
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.11.006openalex-snapshot
The quantum query complexity of the determinant
inferred← citeshttps://doi.org/10.1016/j.ipl.2026.106676openalex-snapshot
On quantum lower bounds for local search via congestion and expansion
inferred← citeshttps://doi.org/10.1016/j.jcss.2005.06.006openalex-snapshot
Polynomial degree vs. quantum query complexity
inferred← citeshttps://doi.org/10.1016/j.jcss.2007.06.020openalex-snapshot
Quantum certificate complexity
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.01.019openalex-snapshot
On the power of Ambainis lower bounds
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.02.057openalex-snapshot
The quantum query complexity of the abelian hidden subgroup problem
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.02.005openalex-snapshot
A stronger LP bound for formula size lower bounds via clique constraints
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.05.039openalex-snapshot
Quantum counterfeit coin problems
inferred← citeshttps://doi.org/10.1017/s0960129512000151openalex-snapshot
Quantum algorithms for testing and learning Boolean functions
inferred← citeshttps://doi.org/10.1038/s41534-023-00733-5openalex-snapshot
Peptide conformational sampling using the Quantum Approximate Optimization Algorithm
inferred← citeshttps://doi.org/10.1088/0253-6102/48/2/013openalex-snapshot
Quantum Query Complexity for Searching Multiple Marked States from an Unsorted Database
inferred← citeshttps://doi.org/10.1088/1367-2630/15/10/103019openalex-snapshot
Identification of a reversible quantum gate: assessing the resources
inferred← citeshttps://doi.org/10.1088/1367-2630/ad309copenalex-snapshot
Variational learning algorithms for quantum query complexity
inferred← citeshttps://doi.org/10.1093/9780191964381.003.0003openalex-snapshot
Quantum mechanics and quantum information
inferred← citeshttps://doi.org/10.1093/9780191964381.003.0005openalex-snapshot
Quantum communication protocols
inferred← citeshttps://doi.org/10.1093/9780191964381.003.0007openalex-snapshot
Quantum algorithms for query problems
inferred← citeshttps://doi.org/10.1093/9780191964381.003.0009openalex-snapshot
Quantum phase estimation and quantum amplitude estimation
inferred← citeshttps://doi.org/10.1093/9780191964381.003.0010openalex-snapshot
Order finding, period finding, and quantum factoring
inferred← citeshttps://doi.org/10.1093/9780191964381.003.0011openalex-snapshot
Hamiltonian simulation and ground state energy estimation
inferred← citeshttps://doi.org/10.1093/9780191964381.003.0013openalex-snapshot
A quantum linear system solver
inferred← citeshttps://doi.org/10.1093/9780191964381.003.0014openalex-snapshot
Quantum signal processing and the quantum singular value transformation
inferred← citeshttps://doi.org/10.1093/9780191964381.003.0015openalex-snapshot
An introduction to quantum error correction
inferred← citeshttps://doi.org/10.1093/9780191964381.003.0017openalex-snapshot
Answers to chapter problems
inferred← citeshttps://doi.org/10.1093/9780191964381.005.0001openalex-snapshot
Simulating the Hadamard gate in the quadratic form expansion
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.001.0001openalex-snapshot
The Nature of Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0003openalex-snapshot
Copyright Page
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.002.0006openalex-snapshot
Figure Credits
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0003openalex-snapshot
Insights and Algorithms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0004openalex-snapshot
Needles in a Haystack: the Class NP
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0005openalex-snapshot
Who is the Hardest One of All? NP-Completeness
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0006openalex-snapshot
The Deep Question: P vs. NP
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0007openalex-snapshot
The Grand Unified Theory of Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0008openalex-snapshot
Memory, Paths, and Games
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0009openalex-snapshot
Optimization and Approximation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0010openalex-snapshot
Randomized Algorithms
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0011openalex-snapshot
Interaction and Pseudorandomness
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0012openalex-snapshot
Random Walks and Rapid Mixing
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0013openalex-snapshot
Counting, Sampling, and Statistical Physics
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0014openalex-snapshot
When Formulas Freeze: Phase Transitions in Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.003.0015openalex-snapshot
Quantum Computation
inferred← citeshttps://doi.org/10.1093/acprof:oso/9780199233212.005.0001openalex-snapshot
Mathematical Tools
inferred← citeshttps://doi.org/10.1103/5qsb-5jy5openalex-snapshot
Oracle problems as communication tasks and optimization of quantum algorithms
inferred← citeshttps://doi.org/10.1103/physreva.109.022412openalex-snapshot
Two methods for breaking down a quantum algorithm
inferred← citeshttps://doi.org/10.1103/physreva.110.062412openalex-snapshot
Quadratic quantum speedup for perceptron training
inferred← citeshttps://doi.org/10.1103/physreva.71.052308openalex-snapshot
Entanglement flow in multipartite systems
inferred← citeshttps://doi.org/10.1103/physreva.73.022308openalex-snapshot
Grover’s quantum search algorithm and Diophantine approximation
inferred← citeshttps://doi.org/10.1103/physreva.83.022304openalex-snapshot
Quantum snake walk on graphs
inferred← citeshttps://doi.org/10.1103/physrevresearch.6.l032020openalex-snapshot
Quantum query complexity of Boolean functions under indefinite causal order
inferred← citeshttps://doi.org/10.1103/revmodphys.82.1openalex-snapshot
Quantum algorithms for algebraic problems
inferred← citeshttps://doi.org/10.1109/access.2019.2908785openalex-snapshot
A Quantum Algorithm for the Commutativity of Finite Dimensional Algebras
inferred← citeshttps://doi.org/10.1109/ccc.2003.1214419openalex-snapshot
Quantum query complexity and semi-definite programming
inferred← citeshttps://doi.org/10.1109/ccc.2004.1313851openalex-snapshot
Graph properties and circular functions: how low can quantum query complexity go?
inferred← citeshttps://doi.org/10.1109/ccc.2004.1313852openalex-snapshot
Lower bounds for randomized and quantum query complexity using Kolmogorov arguments
inferred← citeshttps://doi.org/10.1109/ccc.2004.14openalex-snapshot
Graph properties and circular functions: how low can quantum query complexity go?
inferred← citeshttps://doi.org/10.1109/ccc.2005.29openalex-snapshot
The Quantum Adversary Method and Classical Formula Size Lower Bounds
inferred← citeshttps://doi.org/10.1109/ccc.2008.9openalex-snapshot
The Multiplicative Quantum Adversary
inferred← citeshttps://doi.org/10.1109/ccc.2009.42openalex-snapshot
Quantum Copy-Protection and Quantum Money
inferred← citeshttps://doi.org/10.1109/ccc.2010.31openalex-snapshot
The Partition Bound for Classical Communication Complexity and Query Complexity
inferred← citeshttps://doi.org/10.1109/ccc.2012.17openalex-snapshot
A Strong Direct Product Theorem for Quantum Query Complexity
inferred← citeshttps://doi.org/10.1109/ccc.2013.14openalex-snapshot
On the Power of Non-adaptive Learning Graphs
inferred← citeshttps://doi.org/10.1109/ccc.2014.11openalex-snapshot
Quantum Algorithms for Learning Symmetric Juntas via Adversary Bound
inferred← citeshttps://doi.org/10.1109/focs.2006.57openalex-snapshot
On the Quantum Query Complexity of Local Search in Two and Three Dimensions
inferred← citeshttps://doi.org/10.1109/focs.2008.91openalex-snapshot
The Polynomial Method in Quantum and Classical Computing
inferred← citeshttps://doi.org/10.1109/focs.2009.55openalex-snapshot
Span Programs and Quantum Query Complexity: The General Adversary Bound Is Nearly Tight for Every Boolean Function
inferred← citeshttps://doi.org/10.1109/focs.2011.75openalex-snapshot
Quantum Query Complexity of State Conversion
inferred← citeshttps://doi.org/10.1109/focs.2012.18openalex-snapshot
Learning-Graph-Based Quantum Algorithm for k-Distinctness
inferred← citeshttps://doi.org/10.1109/focs.2019.00061openalex-snapshot
A Quantum Query Complexity Trichotomy for Regular Languages
inferred← citeshttps://doi.org/10.1109/focs54457.2022.00113openalex-snapshot
Nearly Optimal Communication and Query Complexity of Bipartite Matching
inferred← citeshttps://doi.org/10.1109/ismvl.2007.11openalex-snapshot
Boolean Functions of Low Polynomial Degree for Quantum Query Complexity Theory
inferred← citeshttps://doi.org/10.1109/sfcs.2002.1181970openalex-snapshot
Limits on the power of quantum statistical zero-knowledge
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238194openalex-snapshot
Quantum search of spatial regions
inferred← citeshttps://doi.org/10.1109/sfcs.2003.1238197openalex-snapshot
Polynomial degree vs. quantum query complexity
inferred← citeshttps://doi.org/10.1109/tit.2024.3447915openalex-snapshot
Optimal Trace Distance and Fidelity Estimations for Pure Quantum States
inferred← citeshttps://doi.org/10.1117/12.719158openalex-snapshot
Quantum algorithms for optimal graph traversal problems
inferred← citeshttps://doi.org/10.1137/050639090openalex-snapshot
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
inferred← citeshttps://doi.org/10.1137/050643684openalex-snapshot
Quantum Algorithms for the Triangle Problem
inferred← citeshttps://doi.org/10.1137/050644719openalex-snapshot
Quantum Query Complexity of Some Graph Problems
inferred← citeshttps://doi.org/10.1137/06066775xopenalex-snapshot
Tight Bounds for Randomized and Quantum Local Search
inferred← citeshttps://doi.org/10.1137/1.9781611975031.76openalex-snapshot
Approximating Edit Distance in Truly Subquadratic Time: Quantum and MapReduce
inferred← citeshttps://doi.org/10.1137/1.9781611976014.5openalex-snapshot
Quantum Approximate Counting, Simplified
inferred← citeshttps://doi.org/10.1137/100792640openalex-snapshot
Span Programs are Equivalent to Quantum Query Algorithms
inferred← citeshttps://doi.org/10.1137/110833026openalex-snapshot
Quantum Query Complexity of Minor-Closed Graph Properties
inferred← citeshttps://doi.org/10.1137/110842661openalex-snapshot
Strong Direct Product Theorems for Quantum Communication and Query Complexity
inferred← citeshttps://doi.org/10.1137/18m117563xopenalex-snapshot
Quantum Query Algorithms Are Completely Bounded Forms
inferred← citeshttps://doi.org/10.1137/24m1638616openalex-snapshot
Quantum Lower Bounds by Sample-to-Query Lifting
inferred← citeshttps://doi.org/10.1137/s0097539700379644openalex-snapshot
Algorithms for Boolean Function Query Properties
inferred← citeshttps://doi.org/10.1137/s0097539704447237openalex-snapshot
Lower Bounds for Local Search by Quantum Arguments
inferred← citeshttps://doi.org/10.1140/epjp/i2015-15034-4openalex-snapshot
A fast quantum algorithm for the affine Boolean function identification
inferred← citeshttps://doi.org/10.1142/s0129054113400261openalex-snapshot
RECOVERING STRINGS IN ORACLES: QUANTUM AND CLASSIC
inferred← citeshttps://doi.org/10.1142/s0219749912500190openalex-snapshot
QUANTUM QUERY COMPLEXITY OF CONSTANT-SIZED SUBGRAPH CONTAINMENT
inferred← citeshttps://doi.org/10.1142/s0219749913500597openalex-snapshot
Explicit relation between all lower bound techniques for quantum query complexity
inferred← citeshttps://doi.org/10.1142/s2010324721400014openalex-snapshot
Exact Quantum 1-Query Algorithms and Complexity
inferred← citeshttps://doi.org/10.1145/1007352.1007427openalex-snapshot
Quantum and classical query complexities of local search are polynomially related
inferred← citeshttps://doi.org/10.1145/1052796.1052804openalex-snapshot
Guest Column: NP-complete problems and physical reality
inferred← citeshttps://doi.org/10.1145/1109557.1109654openalex-snapshot
Quantum verification of matrix products
inferred← citeshttps://doi.org/10.1145/1132516.1132604openalex-snapshot
A new quantum lower bound method,
inferred← citeshttps://doi.org/10.1145/1132516.1132605openalex-snapshot
New upper and lower bounds for randomized and quantum local search
inferred← citeshttps://doi.org/10.1145/1250790.1250867openalex-snapshot
Negative weights make adversaries stronger
inferred← citeshttps://doi.org/10.1145/1830483.1830746openalex-snapshot
Can quantum search accelerate evolutionary algorithms?
inferred← citeshttps://doi.org/10.1145/2213977.2213983openalex-snapshot
Quantum money from hidden subspaces
inferred← citeshttps://doi.org/10.1145/2422436.2422474openalex-snapshot
Adversary lower bound for the k-sum problem
inferred← citeshttps://doi.org/10.1145/3188745.3188784openalex-snapshot
The polynomial method strikes back: tight quantum query bounds via dual polynomials
inferred← citeshttps://doi.org/10.1145/3357713.3384304openalex-snapshot
One-shot signatures and applications to hybrid quantum/classical authentication
inferred← citeshttps://doi.org/10.1145/3406325.3451047openalex-snapshot
Degree vs. approximate degree and Quantum implications of Huang’s sensitivity theorem
inferred← citeshttps://doi.org/10.1145/3456509openalex-snapshot
Quantum and Randomised Algorithms for Non-linearity Estimation
inferred← citeshttps://doi.org/10.1145/3589986openalex-snapshot
Quantum Time–Space Tradeoff for Finding Multiple Collision Pairs
inferred← citeshttps://doi.org/10.1145/3618260.3649604openalex-snapshot
On the Communication Complexity of Approximate Pattern Matching
inferred← citeshttps://doi.org/10.1145/3618260.3649700openalex-snapshot
Quantum Time-Space Tradeoffs for Matrix Problems
inferred← citeshttps://doi.org/10.1145/3648573openalex-snapshot
Hybrid Quantum-classical Search Algorithms
inferred← citeshttps://doi.org/10.1145/3694906.3743335openalex-snapshot
Optimal quantum sampling on distributed databases
inferred← citeshttps://doi.org/10.1515/jmc-2013-0038openalex-snapshot
Quantum computation of discrete logarithms in semigroups
inferred← citeshttps://doi.org/10.1587/bplus.14.102openalex-snapshot
An Overview of Quantum Algorithms
inferred← citeshttps://doi.org/10.1587/transinf.e93.d.280openalex-snapshot
Lower Bounds on Quantum Query Complexity for Read-Once Formulas with XOR and MUX Operators
showing the first 200 of 303 · page through all 303
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.