A Connectivity-Order Law and Conditional Minimal-Mechanism Identification in Many-Body Geometric Phases

Abstract:The value of a multiqubit geometric phase at a single operating point does not reveal whether it was generated directly or through a connected sequence of lower-body interactions. For analytic, gapped, nondegenerate Abelian holonomies, we jointly resolve logical support and independently calibrated coupling support. Every nonzero connected response must involve an active set that connects and covers the target and must contain one factor of each active coupling, yielding the sharp onset bound $\nu_S \geq \tau_E(S)$. The same selection law applies locally to projected Berry curvature. Conversely, an unrestricted finite-dimensional construction realizes all responses allowed by the connected-cover condition simultaneously, making the condition necessary and sufficient within this theorem class. Operationally, simultaneous confidence bands certify detected mixed responses while controlling false positives; a factor-of-two separation condition additionally recovers exact library-relative response minima. In a complete dictionary, nontriviality of every minimal-cover response is generically necessary and sufficient for these minima to coincide with the minimal calibrated mechanisms. Three-qubit Wilson calculations distinguish direct and pair-mediated routes with the same endpoint phase, and a synthetic Ramsey audit locates the finite-resolution boundary.

Quantum Physics (quant-ph); Applied Physics (physics.app-ph)

arXiv:2608.17280 [quant-ph]

(or arXiv:2608.17280v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2608.17280 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

SELECTION_THEORY_NOTES.md

code/ENVIRONMENT_LOCK.txt

code/environment.yml

code/fixed_support_core.py

code/reproduce_all.sh

code/reproduce_experimental_bridge.py

code/reproduce_experimental_inference_validation.py

code/reproduce_experimental_workflow.py

code/reproduce_minimal_connected_holonomy.py

code/reproduce_theory_map.py

code/validate_connectivity_corollaries.py

code/validate_fixed_support.py

code/validate_matched_output_mechanism.py

code/validate_noncovariant_three_body.py

code/validate_partition_factorization.py

code/validate_radial_parity_symmetry.py

code/validate_relative_framework.py

code/validate_selection_theory_extensions.py

code/validate_universal_witness.py

data/connectivity_corollary_audit.json

data/direct_hamiltonian_checks.csv

data/directional_cancellation.json

data/exhaustive_connected_graphs.csv

data/experimental_bridge_derivative_convergence.csv

data/experimental_bridge_elasticity.csv

data/experimental_bridge_mesh_convergence.csv

data/experimental_bridge_phase_scan.csv

data/experimental_bridge_summary.csv

data/experimental_derivative_error_budget.csv

data/experimental_inference_summary.json

data/experimental_order_inference_success.csv

data/finest_partition_recovery.json

data/fixed_support_chain_phase_scan.csv

data/fixed_support_chain_scaling.csv

data/fixed_support_summary.json

data/gap_controlled_domain_checks.csv

data/generic_nonzero_witnesses.json

data/generic_saturation_ensemble.csv

data/matched_output_elasticity.csv

data/matched_output_mesh_convergence.csv

data/matched_output_scan.csv

data/matched_output_summary.json

data/minimal_connected_holonomy_convergence.csv

data/minimal_connected_holonomy_elasticity.csv

data/minimal_connected_holonomy_scan.csv

data/minimal_connected_holonomy_summary.csv

data/noncovariant_three_body_scan.csv

data/noncovariant_three_body_summary.json

data/partition_factorization_summary.json

data/partition_join_counterexample.json

data/partition_lattice_checks.csv

data/radial_parity_symmetry_scan.csv

data/radial_parity_symmetry_validation.json

data/random_hypergraph_checks.json

data/relative_framework_validation.json

data/representative_witnesses.json

data/selection_theory_extension_validation.json

data/symmetry_zero.json

data/universal_witness_summary.json

validation_generic_mechanism_identifiability/MECHANISM_IDENTIFIABILITY_NOTES.md

validation_generic_mechanism_identifiability/SHA256SUMS.txt

validation_generic_mechanism_identifiability/combinatorial_mechanism_correspondence.json

validation_generic_mechanism_identifiability/finite_noise_mechanism_set_recovery.csv

validation_generic_mechanism_identifiability/finite_noise_mechanism_set_recovery.pdf

validation_generic_mechanism_identifiability/finite_noise_mechanism_set_recovery.png

validation_generic_mechanism_identifiability/finite_noise_mechanism_set_summary.json

validation_generic_mechanism_identifiability/finite_noise_per_mechanism_detection.csv

validation_generic_mechanism_identifiability/validate_generic_mechanism_identifiability.py

validation_mechanism_certification/MECHANISM_CERTIFICATION_NOTES.md

validation_mechanism_certification/SHA256SUMS.txt

validation_mechanism_certification/edge_resolved_derivatives.csv

validation_mechanism_certification/leading_model_predictions.csv

validation_mechanism_certification/mechanism_certification_summary.json

validation_mechanism_certification/mechanism_certification_validation.pdf

validation_mechanism_certification/mechanism_certification_validation.png

validation_mechanism_certification/mixed_mechanism_elasticity.csv

validation_mechanism_certification/radial_orders.csv

validation_mechanism_certification/validate_mechanism_certification.py

(76 additional files not shown) You must enabled JavaScript to view entire file list.

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.