Revisiting Deutsch-Jozsa algorithm
From MaRDI portal
Publication:2216118
DOI10.1016/j.ic.2020.104605zbMath1496.68152OpenAlexW3048152041MaRDI QIDQ2216118
Publication date: 15 December 2020
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2020.104605
symmetric Boolean functionsquery complexitypromise problemsDeutsch-Jozsa problemsexact quantum query algorithms
Related Items (7)
Performance of Grover's search algorithm with diagonalizable collective noises ⋮ From the sum-of-squares representation of a Boolean function to an optimal exact quantum query algorithm ⋮ Lifting query complexity to time-space complexity for two-way finite automata ⋮ Quantum encoding of dynamic directed graphs ⋮ Distributed Grover's algorithm ⋮ Directed graph encoding in quantum computing supporting edge-failures ⋮ Testing Boolean Functions Properties
Cites Work
- Optimal separation in exact query complexities for Simon's problem
- Deterministic polynomial-time quantum algorithms for Simon's problem
- Complexity measures and decision tree complexity: a survey.
- The quantum black-box complexity of majority
- On exact quantum query complexity
- A different Deutsch-Jozsa
- From Quantum Query Complexity to State Complexity
- Exact Quantum Query Complexity of EXACT and THRESHOLD
- Generalizations of the distributed Deutsch–Jozsa promise problem
- Symmetric Boolean Functions
- The complexity of promise problems with applications to public-key cryptography
- Rapid solution of problems by quantum computation
- Quantum algorithms revisited
- Separations in Query Complexity Based on Pointer Functions
- Partially Symmetric Functions Are Efficiently Isomorphism Testable
- Polynomials, quantum query complexity, and Grothendieck's inequality
- Quantum lower bounds by polynomials
- Superlinear advantage for exact quantum algorithms
- Quantum Queries on Permutations
- Unnamed Item
This page was built for publication: Revisiting Deutsch-Jozsa algorithm
