Static and dynamic coherence fraction in the Bernstein-Vazirani algorithm

• URL: http://arxiv.org/abs/2511.06845v1
• Date: Mon, 10 Nov 2025 08:41:23 GMT
• Title: Static and dynamic coherence fraction in the Bernstein-Vazirani algorithm
• Authors: Si-Qi Zhou, Jin-Min Liang, Jiayin Peng, Zhihua Chen, Shao-Ming Fei, Zhihao Ma,
• Abstract summary: We establish a link between the coherence fraction and the Bernstein-Vazirani algorithm.<n>We show that the success probability of the generalized Bernstein-Vazirani algorithm depends only on the coherence fraction of the initial state.<n>Our findings highlight how quantum coherence fraction influences the efficiency of quantum algorithms.
• Score: 8.412544270062323
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Coherence Fraction in Grover Search Algorithm [17.812164427695926]
  We show that entanglement and coherence do not fully explain the quantum advantage achieved by the Grover search algorithm.<n>We also explore the role of the coherence fraction in the quantum minimization algorithm.<n>These findings offer insights into the origins of quantum advantage and open pathways for the development of new quantum algorithms.
  arXiv  Detail & Related papers  (2025-11-10T08:29:05Z)
• On the role of coherence for quantum computational advantage [1.4675095722281564]
  We introduce path coherence as a measure of the coherent paths interferences arising in a quantum computation.<n>We obtain a classical algorithm for estimating quantum transition amplitudes, the complexity of which scales with path coherence.<n>Our results have practical applications for simulating large classes of quantum computations with classical computers.
  arXiv  Detail & Related papers  (2024-10-09T16:06:07Z)
• Separable Power of Classical and Quantum Learning Protocols Through the Lens of No-Free-Lunch Theorem [70.42372213666553]
  The No-Free-Lunch (NFL) theorem quantifies problem- and data-independent generalization errors regardless of the optimization process. We categorize a diverse array of quantum learning algorithms into three learning protocols designed for learning quantum dynamics under a specified observable. Our derived NFL theorems demonstrate quadratic reductions in sample complexity across CLC-LPs, ReQu-LPs, and Qu-LPs. We attribute this performance discrepancy to the unique capacity of quantum-related learning protocols to indirectly utilize information concerning the global phases of non-orthogonal quantum states.
  arXiv  Detail & Related papers  (2024-05-12T09:05:13Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• Evolution of Quantum Resources in Quantum-walk-based Search Algorithm [3.604186493583444]
  We consider the effects of quantum coherence and quantum entanglement for the quantum walk search on the complete bipartite graph. First, we numerically show the complementary relationship between the success probability and the two quantum resources. At last, we discuss the role played by generalized depolarizing noises and find that it would influence the dynamics of success probability and quantum coherence sharply.
  arXiv  Detail & Related papers  (2023-09-30T12:16:28Z)
• Quantum resources in Harrow-Hassidim-Lloyd algorithm [1.4605137432098108]
  We prove that nonvanishing quantum correlations, both bipartite and genuine multipartite entanglement, are required for solving nontrivial linear systems of equations. We find a nonvanishing l1-norm quantum coherence of the entire system and the register qubit which turns out to be related to the success probability of the algorithm.
  arXiv  Detail & Related papers  (2023-08-08T03:35:15Z)
• Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
  Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
  arXiv  Detail & Related papers  (2022-05-26T20:32:36Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• On the Role of Coherence in Shor's Algorithm [1.3124513975412255]
  Shor's factoring algorithm provides a super-polynomial speed-up over all known classical factoring algorithms. We identify the role of coherence for this algorithm quantitatively.
  arXiv  Detail & Related papers  (2022-03-20T19:49:17Z)
• Quantum Causal Unravelling [44.356294905844834]
  We develop the first efficient method for unravelling the causal structure of the interactions in a multipartite quantum process. Our algorithms can be used to identify processes that can be characterized efficiently with the technique of quantum process tomography.
  arXiv  Detail & Related papers  (2021-09-27T16:28:06Z)
• Creating and destroying coherence with quantum channels [62.997667081978825]
  We study optimal ways to create a large amount of quantum coherence via quantum channels. correlations in multipartite systems do not enhance the ability of a quantum channel to create coherence. We show that a channel can destroy more coherence when acting on a subsystem of a bipartite state.
  arXiv  Detail & Related papers  (2021-05-25T16:44:13Z)
• Quantum Causal Inference in the Presence of Hidden Common Causes: an Entropic Approach [34.77250498401055]
  We put forth a new theoretical framework for merging quantum information science and causal inference by exploiting entropic principles. We apply our proposed framework to an experimentally relevant scenario of identifying message senders on quantum noisy links. This approach can lay the foundations of identifying originators of malicious activity on future multi-node quantum networks.
  arXiv  Detail & Related papers  (2021-04-24T22:45:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.