Partial Boolean Functions With Exact Quantum Query Complexity One

Article Properties
Abstract
Cite
Xu, Guoliang, and Daowen Qiu. “Partial Boolean Functions With Exact Quantum Query Complexity One”. Entropy, vol. 23, no. 2, 2021, p. 189, https://doi.org/10.3390/e23020189.
Xu, G., & Qiu, D. (2021). Partial Boolean Functions With Exact Quantum Query Complexity One. Entropy, 23(2), 189. https://doi.org/10.3390/e23020189
Xu, Guoliang, and Daowen Qiu. “Partial Boolean Functions With Exact Quantum Query Complexity One”. Entropy 23, no. 2 (2021): 189. https://doi.org/10.3390/e23020189.
Xu G, Qiu D. Partial Boolean Functions With Exact Quantum Query Complexity One. Entropy. 2021;23(2):189.
Journal Categories
Science
Astronomy
Astrophysics
Science
Physics
Refrences
Title Journal Journal Categories Citations Publication Date
Quantum Query as a state decomposition Theoretical Computer Science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. 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
Citations
Title Journal Journal Categories Citations Publication Date
Randomized decision tree complexity of Deutsch–Jozsa problem and a generalization Quantum Information Processing
  • Science: Physics
  • Science: Physics
  • Science: Mathematics
  • Science: Physics
2024
Characterization of Exact One-Query Quantum Algorithms for Partial Boolean Functions Journal of Computer Science and Technology
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
2023
Parity decision tree in classical–quantum separations for certain classes of Boolean functions Quantum Information Processing
  • Science: Physics
  • Science: Physics
  • Science: Mathematics
  • Science: Physics
1 2021
Exact Quantum 1-Query Algorithms and Complexity

SPIN
  • Technology: Chemical technology
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Materials of engineering and construction. Mechanics of materials
  • Science: Physics
  • Science: Physics
2021
Citations Analysis
The category Science: Physics 3 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Exact Quantum 1-Query Algorithms and Complexity and was published in 2021. The most recent citation comes from a 2024 study titled Randomized decision tree complexity of Deutsch–Jozsa problem and a generalization. This article reached its peak citation in 2021, with 2 citations. It has been cited in 3 different journals. Among related journals, the Quantum Information Processing cited this research the most, with 2 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year