Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
Quantum Query as a state decomposition | Theoretical Computer Science |
| 4 | 2018 |
Rapid solution of problems by quantum computation | Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences | 1,096 | 1992 | |
Quantum theory, the Church–Turing principle and the universal quantum computer | Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences | 1,685 | 1985 | |
Exact quantum algorithms have advantage for almost all Boolean functions | 2015 | |||
Lower Bounds on Quantum Query Complexity | 2005 |
Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
Randomized decision tree complexity of Deutsch–Jozsa problem and a generalization | Quantum Information Processing |
| 2024 | |
Characterization of Exact One-Query Quantum Algorithms for Partial Boolean Functions | Journal of Computer Science and Technology |
| 2023 | |
Parity decision tree in classical–quantum separations for certain classes of Boolean functions | Quantum Information Processing |
| 1 | 2021 |
Exact Quantum 1-Query Algorithms and Complexity | SPIN |
| 2021 |