REVIEW 2 cited by
The Complexity Geometry of a Single Qubit
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
The Complexity Geometry of a Single Qubit
read the original abstract
The computational complexity of a quantum state quantifies how hard it is to make. `Complexity geometry', first proposed by Nielsen, is an approach to defining computational complexity using the tools of differential geometry. Here we demonstrate many of the attractive features of complexity geometry using the example of a single qubit, which turns out to be rich enough to be illustrative but simple enough to be illuminating.
Forward citations
Cited by 2 Pith papers
-
The Geometry of Quantum Complexity in Open Systems
Nielsen complexity for Lindbladian open systems induces a sub-Finslerian geometry on mixed states whose flag curvature depends on control penalty factors.
-
Nielsen complexity with multiple cost factors
Generalizes Nielsen complexity to multiple cost factors, derives modified Euler-Arnold and Jacobi equations, and examines effects on conjugate points in single-qubit and SYK systems.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.