Complexity in One- and Two-Qubit Systems

Reginald J. Caginalp; Samuel Leutheusser

Complexity in One- and Two-Qubit Systems

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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

arxiv 2010.15099 v1 pith:IVZBUKXX submitted 2020-10-28 hep-th

Reginald J. Caginalp , Samuel Leutheusser This is my paper · ORCID

classification hep-th

keywords complexityone-operatorstwo-qubitgeometryprecursorsystemstime

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

We numerically analyze the complexity of unitary time-evolution and precursor operators in one- and two-qubit systems using the framework of Nielsen complexity geometry. We find that, as expected, the complexities of unitary time evolution operators grow linearly with time, at least initially, for both the one- and two-qubit cases. The precursor operators display switchback-effect-like behavior provided we choose our cost factors so that the resulting complexity geometry is negatively curved.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

CFT Complexity and Penalty Factors
hep-th 2025-07 conditional novelty 6.0 of 10

A submersion-based method turns weighted generator costs into state-complexity metrics for CFTs, giving analytic formulas in simple limits and constraints on which weight choices are viable.

Pith tools