Aspects of Complexity in Quantum Evolutions on the Bloch Sphere

• URL: http://arxiv.org/abs/2501.13279v1
• Date: Thu, 23 Jan 2025 00:06:11 GMT
• Title: Aspects of Complexity in Quantum Evolutions on the Bloch Sphere
• Authors: Carlo Cafaro, Emma Clements, Abeer Alanazi,
• Abstract summary: We enhance our quantitative comprehension of the complexity associated with time-optimal and time sub-optimal quantum Hamiltonian evolutions. Our research suggests that, in general, efficient quantum evolutions possess a lower complexity than their inefficient counterparts.
• Score: 0.0
• License:
• Abstract: We enhance our quantitative comprehension of the complexity associated with both time-optimal and time sub-optimal quantum Hamiltonian evolutions that connect arbitrary source and target states on the Bloch sphere, as recently presented in Nucl. Phys. B1010, 116755 (2025). Initially, we examine each unitary Schrodinger quantum evolution selected through various metrics, such as path length, geodesic efficiency, speed efficiency, and the curvature coefficient of the corresponding quantum-mechanical trajectory that connects the source state to the target state on the Bloch sphere. Subsequently, we evaluate the selected evolutions using our proposed measure of complexity, as well as in relation to the concept of complexity length scale. The choice of both time-optimal and time sub-optimal evolutions, along with the selection of source and target states, enables us to conduct pertinent sanity checks that seek to validate the physical relevance of the framework supporting our proposed complexity measure. Our research suggests that, in general, efficient quantum evolutions possess a lower complexity than their inefficient counterparts. However, it is important to recognize that complexity is not solely determined by length; in fact, longer trajectories that are adequately curved may exhibit a complexity that is less than or equal to that of shorter trajectories with a lower curvature coefficient.

Related papers

• Complexity of Quantum-Mechanical Evolutions from Probability Amplitudes [0.0]
  We study the complexity of both time-optimal and time sub-optimal quantum Hamiltonian evolutions connecting arbitrary source and a target states on the Bloch sphere equipped with the Fubini-Study metric.
  arXiv  Detail & Related papers  (2024-08-26T12:54:51Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Quantum Walks on Simplicial Complexes and Harmonic Homology: Application to Topological Data Analysis with Superpolynomial Speedups [9.538251541300028]
  We introduce a novel quantum walk that encodes the Laplacian, a key mathematical object whose spectral properties reflect the underlying simplicial complex. Our results achieve superpolynomial quantum speedup with quantum walks without relying on quantum oracles for large datasets.
  arXiv  Detail & Related papers  (2024-04-23T18:00:17Z)
• Spectral chaos bounds from scaling theory of maximally efficient quantum-dynamical scrambling [49.1574468325115]
  A key conjecture about the evolution of complex quantum systems towards an ergodic steady state, known as scrambling, is that this process acquires universal features when it is most efficient. We develop a single- parameter scaling theory for the spectral statistics in this scenario, which embodies exact self-similarity of the spectral correlations along the complete scrambling dynamics. We establish that scaling predictions are matched by a privileged process, and serve as bounds for other dynamical scrambling scenarios, allowing one to quantify inefficient or incomplete scrambling on all timescales.
  arXiv  Detail & Related papers  (2023-10-17T15:41:50Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
  We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
  arXiv  Detail & Related papers  (2022-12-13T16:04:16Z)
• Qubit Geodesics on the Bloch Sphere from Optimal-Speed Hamiltonian Evolutions [0.0]
  We present an explicit geodesic analysis of the trajectories that emerge from the quantum evolution of a single-qubit quantum state. In addition to viewing geodesics in ray space as paths of minimal length, we also verify the geodesicity of paths in terms of unit geometric efficiency and vanishing geometric phase.
  arXiv  Detail & Related papers  (2022-10-17T14:44:03Z)
• Complexity of Pure and Mixed Qubit Geodesic Paths on Curved Manifolds [0.0]
  We propose an information geometric theoretical construct to describe and understand the complex behavior of evolutions of quantum systems in pure and mixed states. We analytically show that the evolution of mixed quantum states in the Bloch ball is more complex than the evolution of pure states on the Bloch sphere.
  arXiv  Detail & Related papers  (2022-09-21T21:11:31Z)
• 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)
• Complexity and efficiency of minimum entropy production probability paths from quantum dynamical evolutions [0.0]
  We present an information geometric characterization of quantum driving schemes specified by su (2;C) time-dependent Hamiltonians. We evaluate the so-called information geometric complexity (IGC) and our newly proposed measure of entropic efficiency.
  arXiv  Detail & Related papers  (2021-07-23T16:18:11Z)
• Detailed Account of Complexity for Implementation of Some Gate-Based Quantum Algorithms [55.41644538483948]
  In particular, some steps of the implementation, as state preparation and readout processes, can surpass the complexity aspects of the algorithm itself. We present the complexity involved in the full implementation of quantum algorithms for solving linear systems of equations and linear system of differential equations.
  arXiv  Detail & Related papers  (2021-06-23T16:33:33Z)

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.