Coherence and entanglement dynamics in Shor's algorithm

• URL: http://arxiv.org/abs/2604.06639v1
• Date: Wed, 08 Apr 2026 03:25:43 GMT
• Title: Coherence and entanglement dynamics in Shor's algorithm
• Abstract summary: Shor's algorithm outperforms its classical counterpart in efficient prime factorization.<n>We explore the coherence and entanglement dynamics of the evolved states within Shor's algorithm.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Shor's algorithm outperforms its classical counterpart in efficient prime factorization. We explore the coherence and entanglement dynamics of the evolved states within Shor's algorithm, showing that the coherence in each step relies on the dimension of register or the order, and discuss the relations between geometric coherence and geometric entanglement. We investigate how unitary operators induce variations in coherence and entanglement, and analyze the variations of coherence and entanglement within the entire algorithm, demonstrating that the overall effect of Shor's algorithm tends to deplete coherence and produce entanglement. Our research not only deepens the understanding of this algorithm but also provides methodological references for studying resource dynamics in other quantum algorithms.

Related papers

• ClustOpt: A Clustering-based Approach for Representing and Visualizing the Search Dynamics of Numerical Metaheuristic Optimization Algorithms [4.740182373135037]
  We propose a novel representation and visualization methodology that clusters solution candidates explored by the algorithm.<n>We quantify the consistency of search trajectories across runs of an individual algorithm and the similarity between different algorithms.<n>We apply this methodology to a set of ten numerical metaheuristic algorithms, revealing insights into their stability and comparative behaviors.
  arXiv  Detail & Related papers  (2025-07-03T06:01:02Z)
• Stability and Generalization of the Decentralized Stochastic Gradient Descent Ascent Algorithm [80.94861441583275]
  We investigate the complexity of the generalization bound of the decentralized gradient descent (D-SGDA) algorithm. Our results analyze the impact of different top factors on the generalization of D-SGDA. We also balance it with the generalization to obtain the optimal convex-concave setting.
  arXiv  Detail & Related papers  (2023-10-31T11:27:01Z)
• First-Order Algorithms for Nonlinear Generalized Nash Equilibrium Problems [88.58409977434269]
  We consider the problem of computing an equilibrium in a class of nonlinear generalized Nash equilibrium problems (NGNEPs) Our contribution is to provide two simple first-order algorithmic frameworks based on the quadratic penalty method and the augmented Lagrangian method. We provide nonasymptotic theoretical guarantees for these algorithms.
  arXiv  Detail & Related papers  (2022-04-07T00:11:05Z)
• 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)
• Convergence of a New Learning Algorithm [3.679678618747414]
  A new learning algorithm has been shown to be mathematically equivalent to the conventional back-propagation learning algorithm. A convergence measure is proposed to measure the convergence rate of the new algorithm.
  arXiv  Detail & Related papers  (2022-02-08T19:36:43Z)
• Bregman divergence based em algorithm and its application to classical and quantum rate distortion theory [61.12008553173672]
  We address the minimization problem of the Bregman divergence between an exponential subfamily and a mixture subfamily in a Bregman divergence system. We apply this algorithm to rate distortion and its variants including the quantum setting.
  arXiv  Detail & Related papers  (2022-01-07T13:33:28Z)
• Amortized Implicit Differentiation for Stochastic Bilevel Optimization [53.12363770169761]
  We study a class of algorithms for solving bilevel optimization problems in both deterministic and deterministic settings. We exploit a warm-start strategy to amortize the estimation of the exact gradient. By using this framework, our analysis shows these algorithms to match the computational complexity of methods that have access to an unbiased estimate of the gradient.
  arXiv  Detail & Related papers  (2021-11-29T15:10:09Z)
• Fractal Structure and Generalization Properties of Stochastic Optimization Algorithms [71.62575565990502]
  We prove that the generalization error of an optimization algorithm can be bounded on the complexity' of the fractal structure that underlies its generalization measure. We further specialize our results to specific problems (e.g., linear/logistic regression, one hidden/layered neural networks) and algorithms.
  arXiv  Detail & Related papers  (2021-06-09T08:05:36Z)
• Tunable Tradeoff between Quantum and Classical Computation via Nonunitary Zeno-like Dynamics [0.5249805590164902]
  We show that the algorithm scales similarly to the pure quantum version by deriving tight analytical lower bounds on its efficiency. We also study the behavior of the algorithm subject to noise, and find that under certain oracle and operational errors our measurement-based algorithm outperforms the standard algorithm.
  arXiv  Detail & Related papers  (2020-11-22T00:57:17Z)
• Efficient Algorithms for Approximating Quantum Partition Functions [0.0]
  We establish a time approximation algorithm for partition functions of quantum spin models at high temperature. Our main contribution is a simple and slightly sharper analysis for the case of pairwise interactions on bounded-degree graphs.
  arXiv  Detail & Related papers  (2020-04-24T07:21:43Z)
• Active Model Estimation in Markov Decision Processes [108.46146218973189]
  We study the problem of efficient exploration in order to learn an accurate model of an environment, modeled as a Markov decision process (MDP) We show that our Markov-based algorithm outperforms both our original algorithm and the maximum entropy algorithm in the small sample regime.
  arXiv  Detail & Related papers  (2020-03-06T16:17:24Z)

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.