Static and dynamic coherence fraction in the Bernstein-Vazirani algorithm
arXiv:2511.06845 · doi:10.1002/qute.202400709
Abstract
Quantum entanglement and coherence are crucial resources in quantum information theory. In some scenarios, however, it is not necessary to directly estimate entanglement or coherence measures to quantify the capabilities of a state in quantum information processing. Instead, fully entangled fraction and coherence fraction are two alternatives for entanglement and coherence in specific quantum tasks. Here, we establish a link between the coherence fraction and the Bernstein-Vazirani algorithm, which has several potential applications including cryptography and database search. We show that the success probability of the generalized Bernstein-Vazirani algorithm depends only on the coherence fraction of the initial state rather than its entanglement or coherence. Moreover, we discuss the coherence fraction dynamics and establish a relation between the operator's coherence fraction and the algorithm's success probability. Our findings highlight how quantum coherence fraction influences the efficiency of quantum algorithms.
9 pages, 3 figures
References in corpus (33)
- Quantum entanglement
- Advances in Quantum Metrology
- Quantum-enhanced measurements: beating the standard quantum limit
- Quantifying Coherence
- Quantum Coherence as a Resource
- Operational Resource Theory of Coherence
- Measuring Quantum Coherence with Entanglement
- Description of quantum coherence in thermodynamic processes requires constraints beyond free energy
- Robustness of coherence: An operational and observable measure of quantum coherence
- Converting Coherence to Quantum Correlations
- Quantum advantage with shallow circuits
- Intrinsic randomness as a measure of quantum coherence
- Coherence as a resource in decision problems: The Deutsch-Jozsa algorithm and a variation
- Converting Nonclassicality into Entanglement
- Coherence depletion in the Grover quantum search algorithm
- Quantum fidelity measures for mixed states
- SLOCC classification of n qubits invoking the proportional relationships for spectrums and for standard Jordan normal forms
- Universal quantum computation with little entanglement
- Maximally coherent states and coherence-preserving operations
- Experimental progress on quantum coherence: detection, quantification, and manipulation
- Catalytic quantum teleportation and beyond
- On the Role of Coherence in Shor's Algorithm
- Demonstration of algorithmic quantum speedup
- Quantum steerability: characterization, quantification, superactivation and unbounded amplification
- Super-Activation of Quantum Steering
- Entanglement and coherence in Bernstein-Vazirani algorithm
- Quantification of Entanglement and Coherence with Purity Detection
- Quantum coherence fraction
- Arbitrary Amplification of Quantum Coherence in Asymptotic and Catalytic Transformation
- Complementarity between Success Probability and Coherence in Grover Search Algorithm
- Quantum Speed Limit in Terms of Coherence Variations
- Work extraction and fully entangled fraction
- Coherence Fraction in Grover Search Algorithm