Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

How the Quantum of Action Cannot Be a Metric one

Constantin Antonopoulos

Published Jan 1, 1984• 0 citations
OpenAlex

Related papers

Group Actions and Monotone Metric Tensors: The Qubit Case

Florio M. Ciaglia, Fabio Di Nocera

arXiv:2105.15067•Lecture notes in computer science•Jan 1, 2021•2 citations

How the Quantum of Action can Limit Non-Locality

Constantin Antonopoulos

Springer eBooks•Jan 1, 1994•0 citations

Complexity measures in QFT and constrained geometric actions

Pablo Bueno, Javier M. Magán, C. S. Shahbazi

Abstract We study the conditions under which, given a generic quantum system, complexity metrics provide actual lower bounds to the circuit complexity associated to a set of quantum gates. Inhomogeneous cost functions — many examples of which have been recently proposed in the literature — are ruled out by our analysis. Such measures are shown to be unrelated to circuit complexity in general and to produce severe violations of Lloyd’s bound in simple situations. Among the metrics which do provide lower bounds, the idea is to select those which produce the tightest possible ones. This establishes a hierarchy of cost functions and considerably reduces the list of candidate complexity measures. In particular, the criterion suggests a canonical way of dealing with penalties, consisting in assigning infinite costs to directions not belonging to the gate set. We discuss how this can be implemented through the use of Lagrange multipliers. We argue that one of the surviving cost functions defines a particularly canonical notion in the sense that: i) it straightforwardly follows from the standard Hermitian metric in Hilbert space; ii) its associated complexity functional is closely related to Kirillov’s coadjoint orbit action, providing an explicit realization of the “complexity equals action” idea; iii) it arises from a Hamilton-Jacobi analysis of the “quantum action” describing quantum dynamics in the phase space canonically associated to every Hilbert space. Finally, we explain how these structures provide a natural framework for characterizing chaos in classical and quantum systems on an equal footing, find the minimal geodesic connecting two nearby trajectories, and describe how complexity measures are sensitive to Lyapunov exponents.

arXiv:1908.03577•Journal of High Energy Physics•Sep 29, 2021•48 citations

Compatibility between the Brownian metric and the kinetic metric in Nelson stochastic quantization

Daniela Dohrn, Francesco Guerra

In the frame of Nelson stochastic quantization for dynamical systems on a manifold, we consider diffusion processes with Brownian covariance given by a Riemannian metric on the manifold. The dynamics is specified through a stochastic variational principle for a generalization of the classical action, with a given kinetic metric. The resulting programming equation, of the Hamilton-Jacobi type, depends on both metrics, the Brownian one and the kinetic one. We introduce a simple notion of compatibility between the two metrics, such that the programming equation and the continuity equation lead to the Schr\"odinger equation on the manifold.

Physical review. D. Particles, fields, gravitation, and cosmology/Physical review. D. Particles and fields•May 15, 1985•24 citations

On quantum theories with indefinite metric

Renato Ascoli, Ettore Minardi

Nuclear Physics•Jan 1, 1958•24 citations

ON THE INTERPRETATION OF A QUANTUM THEORY WITH INDEFINITE METRIC

R. Huper

•May 1, 1962•0 citations
Abstract We study the conditions under which, given a generic quantum system, complexity metrics provide actual lower bounds to the circuit complexity associated to a set of quantum gates. Inhomogeneous cost functions — many examples of which have been recently proposed in the literature — are ruled out by our analysis. Such measures are shown to be unrelated to circuit complexity in general and to produce severe violations of Lloyd’s bound in simple situations. Among the metrics which do provide lower bounds, the idea is to select those which produce the tightest possible ones. This establishes a hierarchy of cost functions and considerably reduces the list of candidate complexity measures. In particular, the criterion suggests a canonical way of dealing with penalties, consisting in assigning infinite costs to directions not belonging to the gate set. We discuss how this can be implemented through the use of Lagrange multipliers. We argue that one of the surviving cost functions defines a particularly canonical notion in the sense that: i) it straightforwardly follows from the standard Hermitian metric in Hilbert space; ii) its associated complexity functional is closely related to Kirillov’s coadjoint orbit action, providing an explicit realization of the “complexity equals action” idea; iii) it arises from a Hamilton-Jacobi analysis of the “quantum action” describing quantum dynamics in the phase space canonically associated to every Hilbert space. Finally, we explain how these structures provide a natural framework for characterizing chaos in classical and quantum systems on an equal footing, find the minimal geodesic connecting two nearby trajectories, and describe how complexity measures are sensitive to Lyapunov exponents.
In the frame of Nelson stochastic quantization for dynamical systems on a manifold, we consider diffusion processes with Brownian covariance given by a Riemannian metric on the manifold. The dynamics is specified through a stochastic variational principle for a generalization of the classical action, with a given kinetic metric. The resulting programming equation, of the Hamilton-Jacobi type, depends on both metrics, the Brownian one and the kinetic one. We introduce a simple notion of compatibility between the two metrics, such that the programming equation and the continuity equation lead to the Schr\"odinger equation on the manifold.