Jove
Visualize
Contact Us

Related Concept Videos

The Quantum-Mechanical Model of an Atom02:45

The Quantum-Mechanical Model of an Atom

54.9K
Shortly after de Broglie published his ideas that the electron in a hydrogen atom could be better thought of as being a circular standing wave instead of a particle moving in quantized circular orbits, Erwin Schrödinger extended de Broglie’s work by deriving what is now known as the Schrödinger equation. When Schrödinger applied his equation to hydrogen-like atoms, he was able to reproduce Bohr’s expression for the energy and, thus, the Rydberg formula governing hydrogen spectra.
54.9K
Singularity Functions for Shear01:26

Singularity Functions for Shear

310
In structural analysis, singularity functions are crucial in simplifying the representation of shear forces in beams under discontinuous loading. These functions describe discontinuous  variations in shear force across a beam with varying loads by using a single mathematical expression, regardless of the complexity of the loading conditions. The singularity functions are derived from creating a free-body diagram of the beam and then making conceptual cuts at specific points to examine the...
310
Woodward–Hoffmann Selection Rules and Microscopic Reversibility01:34

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

3.5K
Electrocyclic reactions, cycloadditions, and sigmatropic rearrangements are concerted pericyclic reactions that proceed via a cyclic transition state. These reactions are stereospecific and regioselective. The stereochemistry of the products depends on the symmetry characteristics of the interacting orbitals and the reaction conditions. Accordingly, pericyclic reactions are classified as either symmetry-allowed or symmetry-forbidden. Woodward and Hoffmann presented the selection criteria for...
3.5K
Norton's Theorem01:14

Norton's Theorem

1.1K
Norton's theorem is a fundamental principle stating that a linear two-terminal circuit can be substituted with an equivalent circuit, which comprises a current source (ⅠN) in parallel with a resistor (RN). Here, ⅠN represents the short-circuit current flowing through the terminals, and RN stands for the input or equivalent resistance at the terminals when all independent sources are deactivated. This implies that the circuit illustrated in Figure (a) can be exchanged with the one depicted...
1.1K
Molecular Orbital Theory I02:35

Molecular Orbital Theory I

41.8K
Overview of Molecular Orbital Theory
41.8K
The Uncertainty Principle04:08

The Uncertainty Principle

30.1K
Werner Heisenberg considered the limits of how accurately one can measure properties of an electron or other microscopic particles. He determined that there is a fundamental limit to how accurately one can measure both a particle’s position and its momentum simultaneously. The more accurate the measurement of the momentum of a particle is known, the less accurate the position at that time is known and vice versa. This is what is now called the Heisenberg uncertainty principle. He...
30.1K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same journal

Research on a Regional Availability Evaluation Model for Road-Area High-Entropy Energy Based on Synergy Factors.

Entropy (Basel, Switzerland)·2026
Same journal

Atmospheric Turbulence Channel Modeling and Performance Analysis of a CO-ZP-OFDM Coherent Optical Communication System for UAV Air-to-Ground Scenarios.

Entropy (Basel, Switzerland)·2026
Same journal

Information Geometry and Asymptotic Theory for SMML Estimators.

Entropy (Basel, Switzerland)·2026
Same journal

Correlation Entropy and Power-Law Kinetics.

Entropy (Basel, Switzerland)·2026
Same journal

Research on the Contagion of Systemic Financial Risk Under the Impact of Climate Risks-From the Perspective of Complex Networks and Machine Learning.

Entropy (Basel, Switzerland)·2026
Same journal

The Statistical-Mechanical Meaning of the Wave Function of Quantum Mechanics.

Entropy (Basel, Switzerland)·2026
See all related articles
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Video

Updated: Nov 18, 2025

Quantum State Engineering of Light with Continuous-wave Optical Parametric Oscillators
09:23

Quantum State Engineering of Light with Continuous-wave Optical Parametric Oscillators

Published on: May 30, 2014

14.8K

Partial Boolean Functions with Exact Quantum Query Complexity One.

Guoliang Xu1,2, Daowen Qiu1,2

  • 1Institute of Quantum Computing and Computer Theory, School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou 510006, China.

Entropy (Basel, Switzerland)
|February 6, 2021
PubMed
Summary
This summary is machine-generated.

Researchers identified conditions for 1-query quantum algorithms computing partial Boolean functions. This work characterizes functions computable with one quantum query, offering insights into quantum algorithm efficiency.

Keywords:
partial Boolean functionquantum computationquantum query algorithmquantum query complexity

More Related Videos

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

941
Generation and Coherent Control of Pulsed Quantum Frequency Combs
06:42

Generation and Coherent Control of Pulsed Quantum Frequency Combs

Published on: June 8, 2018

9.4K

Related Experiment Videos

Last Updated: Nov 18, 2025

Quantum State Engineering of Light with Continuous-wave Optical Parametric Oscillators
09:23

Quantum State Engineering of Light with Continuous-wave Optical Parametric Oscillators

Published on: May 30, 2014

14.8K
Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

941
Generation and Coherent Control of Pulsed Quantum Frequency Combs
06:42

Generation and Coherent Control of Pulsed Quantum Frequency Combs

Published on: June 8, 2018

9.4K

Area of Science:

  • Quantum Computing
  • Computational Complexity Theory
  • Boolean Functions

Background:

  • Partial Boolean functions are fundamental in computational complexity.
  • Quantum query complexity studies the number of queries to an input required by a quantum algorithm.
  • Exact quantum query complexity focuses on algorithms that produce the correct output with certainty.

Purpose of the Study:

  • To provide necessary and sufficient conditions for characterizing n-bit partial Boolean functions with exact quantum query complexity of 1.
  • To identify all n-bit partial Boolean functions computable by a 1-query quantum algorithm.
  • To establish bounds on the number of such functions.

Main Methods:

  • Derivation of two characterization conditions for 1-query complexity.
  • Construction of a function F to map partial Boolean functions to integers based on their query complexity.
  • Combinatorial analysis to determine upper bounds on the count of specific functions.

Main Results:

  • Two novel conditions precisely characterize n-bit partial Boolean functions with exact quantum query complexity 1.
  • Identification of all n-bit partial Boolean functions computable with a single quantum query.
  • A constructed function F proves that functions with k-bit dependency and 1-query complexity yield non-positive values.
  • An upper bound is established for the number of n-bit partial Boolean functions with k-bit dependency and 1-query complexity, significantly smaller than the total number of functions for large n.

Conclusions:

  • The study provides a complete characterization of functions solvable with one quantum query.
  • The findings offer a significant reduction in the number of functions considered for 1-query quantum computation, especially for larger input sizes.
  • This work contributes to a deeper understanding of the power and limitations of quantum algorithms in solving Boolean functions.