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

Finite-Resource Contacts in Collective Quantum Engines: Exact Dynamics, Resource Reconstruction, and Identifiability

Attar Ali

Published Sep 29, 2026• 0 citations
Publisher

Abstract

The same quantum channel can hide different resource costs \[\boxed{C_{\mathrm{loc}}=\varepsilon(\mu_M-\mu_0)+k_{\mathrm B}T_0\left[\sum_{j=1}^{M}h(q-\mu_j+\mu_{j-1})-Mh(q)\right].}\] Two finite supply devices can implement exactly the same complete quantum channel while depleting different amounts of locally recoverable free energy. Even perfect endpoint process tomography need not determine that supply cost. This paper proves an explicit counterexample, then identifies the extra records that reconstruct the resource without fitting a relaxation rate: the intermediate mean excitation numbers, together with independently known preparation and energy scales. For a qubit contact with fixed population contraction \(\Lambda\), prepared supply population \(q\), initial system population \(p_0\), and \(M\) contacts, write \(\Delta=(q-p_0)(1-\Lambda)\). The full dynamically attainable resource interval is \[C_{\min}=\varepsilon\Delta+k_{\mathrm B}T_0[h(q-\Delta)-h(q)],\qquad C_{\max}=\varepsilon\Delta+Mk_{\mathrm B}T_0[h(q-\Delta/M)-h(q)].\] Both endpoints are constructively attainable when idle contacts are allowed. Every intermediate value occurs with the same complete reduced channel. The paper supplies the realizing contact angles, the refinement limit, an explicit correction for outgoing-unit coherence, and finite-error bounds that include uncertain energy and temperature scales. The collective extension gives the exact Dicke collision kernel, a controlled weak-collision limit, finite-contact parameter identification, and a stationary Otto-cycle resource balance. The reconstruction archive independently builds the joint unitary, partial traces, full reduced superoperators and a second Markov propagator. It reproduces the published collective-engine benchmark and includes all numerical cases, code, plot data and checksums. Scientific status. These are conditional mathematical theorems with reproducible synthetic verification. They extend the QTT physical-contact program by separating endpoint selection from resource selection. The chosen exchange contact has a matched conventional quantum realization. The work neither reports a laboratory detection nor claims an engine-specific axiom-only value of its coupling. Its operational advance is an explicit resource-selection criterion and a reconstruction that requires no coupling fit. Dependencies: QTT Physical Contact Selection and Predictive Transfer and Completed-Event Transport and Quantum Coherence. Independent benchmark: Garcez and colleagues, collective Dicke Otto engine. Corpus Tree. The PDF is the main paper and default preview. The ZIP contains the complete editable and executable reconstruction package.

DOI
10.5281/zenodo.23039290

Related papers

Retained Quantum Records: Recovery Limits and Control-Dependent Formation Costs

Kent Nimmo

AbstractRetained measurement records constrain recoverability, but their formation also depends on the available physical controls. We give exact, constructively attained answers to both questions in two specified models. For a balanced nondemolition qubit process with actual binary observer memories unavailable to the decoder, we determine the maximum recovery compatible with average readout accuracy and pair agreement. The finite-record solution includes its feasible region and a common memory-writing and recovery process, without assuming exchangeability of observed records. Under a complete conditional-pairwise-independence promise at fixed informative accuracy, the optimal coherence has a sharp inverse-square-root asymptotic; fully conditionally independent records instead give exponential decay. Thus identical single-record and pair-record calibrations need not justify the product-law recovery bound. We then fix a logical code in four spin-3/2 systems and sequential diagonal contacts with exact controlled-swap endpoints. Hard budgets for net contact action and added spectral control charge yield an exact peak-excursion frontier within a declared quadratic-plus-cubic control class. A single positive-amplitude preparation jointly attains the record, recovery and occupation requirements, connecting the two results through an exact finite-dimensional optimization. A closed three-record example distinguishes fixed complete records from fixed averaged data. Separately calibrated imperfect contacts admit one-sided finite-error extensions. Together, the results characterize both informational compatibility and control-dependent formation through common attaining apparatuses.Preprint status and related materialsAuthor-submitted preprint; not peer reviewed or accepted for publication. This theoretical and computational work addresses the compatibility of retained binary quantum records with optimized accessible-system recovery, and the control-dependent resources required to form those records in a specified spin encoding. The article provides exact finite-record bounds, attainable recovery and resource frontiers, and calibrated finite-error qualifications. The manuscript has been submitted to Foundations of Physics for journal consideration; this Figshare record is not a journal publication. The technical supplement is included as a second PDF in this same record. Related software, verification code, exact certificates, and selected computational evidence are available separately at https://doi.org/10.6084/m9.figshare.34886079 under the MIT licence. When a journal version of record becomes available, a link to its DOI will be added here.AuthorKent Nimmo; Independent Researcher, Vancouver, British Columbia, Canada; ORCID 0009-0003-8503-8891.Reading and related workBrowse Quantum Foundations for related work on records, access and measurement, and Mathematics for exact bounds and certified constructions. The MIT software/certificate archive remains a distinct record from these manuscript PDFs.

•Nov 2, 2026•0 citations

δ and Physical Reality

Washburn

A physical identification requires a domain of experiments, a realization, and an observation that distinguishes competing mechanisms. We construct these for the δ framework. Within finite causal quantum experiments, computable Choi data are equivalent to finite arithmetic programs producing valid instrument approximations at every requested accuracy. A separate pointer reader preserves the quantum posterior and supports adaptive composition. For the native two-atom census, the actual join update and common-mode retention select golden scaling and a signed contraction. Coherent return selects its minimal conserving completion; an independently calibrated spectral band then selects its constant interaction. A bright-mode construction and a stable short-time calibration procedure supply an explicit realization and uncertainty budget; measured duration and frequency supply the dimensional units. We derive a general endpoint identity between stored record energy and comparison imbalance, and distinguish the monotone fresh-record trajectory from coherent recurrence. The logical-to-physical bridge also has a sharp boundary: an explicit instance of the proposed completion generator has no effective value-reflecting physical reader or numerical comparison receipt. Sequence completion requires precisely the corresponding halting-oracle resource, not an unexplained scalar cost. This obstructs operational completion while leaving purely proof-language transport distinct. Native implementations of identical logical strength nevertheless carry different physical receipts. Joint covariance and the exact endpoint law state the valid relationship between those quantities. Finally, calibrated return and three-outcome tests distinguish the relevant phase and recording alternatives, with quantitative error bounds. First public preprint release, version 1.0. The files include the PDF and the main TeX file. AI-use disclosure: AI assistance was used for source analysis, mathematical exploration, manuscript drafting and revision, diagram preparation, and computational verification support. GPT-6 Astra reviews assessed arguments, scope, readability, and schematics. These were internal model reviews, not external peer review. Jonathan Washburn is the sole listed author and is responsible for the released manuscript.

•Sep 17, 2026•0 citations

Exchange Realization of Relational Coherence: Exact Synthesis and Resource Bounds

Qingchun Zhang

This preprint studies a cycle-reflection operation on a supplied six-qubit realization of paired trigram configurations. A four-matched-pulse identity and a minimum within its stated serial grammar are separated from an ordinary-exchange endpoint construction. The raw full-source reflection and its full domain-safe alternative are different tasks: the latter is excluded by a collective-symmetry obstruction in the admitted source-only exchange model. Strict preservation of the addressable sector throughout the path is also excluded for the full task, while finite-action lower bounds quantify peak no-address population and time-integrated exposure. The paper presents an explicit low-excursion balanced word and a conditional joint clock–amplitude error certificate. Root settings and trajectory inputs remain tied to their supplied computer-assisted certificates. The second internal review reproduced all ten advertised numerical routes and twenty-four outputs using the original programs; this is same-program reproducibility, not independent implementation or external peer review. A separate Lean supplement covers the finite raw/safe operator algebra and the obstruction for arbitrary finite words of the declared algebraic factors. It does not formalize the numerical roots, matrix exponentials, continuous-time dynamics or resource theorems. No global pulse optimum, measured hardware feasibility, general noise tolerance, or automatic connection to the companion recovery code is claimed.

•Sep 10, 2026•0 citations

The Subordinator Renormalization Problem: When Markovian Error Models Misidentify Quantum Memory

Marcos Eduardo Elias Eliashberg Elias

A quantum processor is controlled through a sequence of operations distributed across time. Its reliability therefore depends on more than the decay observed when the device is left undisturbed. Environmental correlations, stochastic timing, intervention history, acceptance rules, and the observable being computed can all change which errors matter and which protection strategy is justified. The Subordinator Renormalization Problem examines this dependence through an integrated treatment of stochastic clocks, fractional dynamics, multi-time quantum processes, task-specific protection, and finite-sample certification. Its central question is precise: how can temporal resolution be changed and environmental memory compressed while preserving the predictions required by a specified quantum task, including the effects of permitted interventions and their full physical cost? Scientific motivation Coherence time, average gate fidelity, qubit count, and scalar measures of non-Markovianity characterize different aspects of a quantum device. They do not individually determine whether a particular computation can deliver a reliable answer within a given resource budget. A reduced model may reproduce uncontrolled relaxation while omitting correlations that become consequential under pulses, measurements, resets, or subsequent gates. This manuscript investigates the information that must survive a reduction of the noise description. It develops task-sufficient memory as an operational requirement: two process descriptions may be treated as equivalent only when they preserve the declared output expectations, acceptance probabilities, and costs for every allowed future continuation. Stochastic clocks and fractional quantum dynamics The mathematical framework connects Lévy subordinators, Bernstein functions, inverse stable clocks, renewal processes, Caputo fractional derivatives, and Mittag–Leffler relaxation with completely positive quantum dynamics. A central distinction concerns direct and inverse time changes. Direct Bochner subordination of a quantum dynamical semigroup can preserve the semigroup composition law while modifying its generator. An inverse stable clock generally produces a fractional evolution family without that composition law. Fractional powers of generators and fractional derivatives in physical time consequently represent different constructions and cannot be interpreted interchangeably. The manuscript also separates a change of time units from a physical change of the clock law. It derives an exact scaling identity within a fixed stable family and specifies the dimensions of the corresponding relaxation parameter. This identifies what scale covariance establishes and what would require additional evidence of physical control over the environment. The clock-reset problem For inverse stable relaxation, uninterrupted evolution and evolution with an independently renewed hidden clock generally yield different predictions. The paper derives a short-time expansion quantifying the difference between the coherence multiplier after uninterrupted evolution for twice a given duration and the product obtained from two independently renewed intervals. This result makes an otherwise hidden modeling assumption experimentally meaningful. A reset assumption changes the predicted observable response. Whether a real operation renews the relevant environmental variables must therefore be part of the physical model. The analysis includes closed-form calculations for the half-order Mittag–Leffler relaxation, checks of scale covariance, and verification of the deterministic-clock limit. Identical decoherence curves and different control responses An explicit Gaussian dephasing construction provides a separate identification counterexample. A continuum of noise processes produces exactly the same uncontrolled quantum channel at every time, while displaying different responses to spin echo. The entire family has zero Breuer–Laine–Piilo backflow in its uncontrolled reduced dynamics. Nevertheless, its temporal correlations determine whether an echo helps or harms once pulse imperfections are included. The construction shows why uncontrolled channel information alone can be insufficient for an intervention-dependent decision. The relevant distinction is operational: noise processes that look identical during idle evolution can require different control choices. The Gaussian construction and the inverse stable clock analysis are distinct models. Together, they expose complementary requirements on a predictive description, without identifying either construction as a universal microscopic model of a quantum device. Task-sufficient representations and mathematical guarantees The paper formulates exact equivalence of multi-time processes relative to a specified family of interventions, terminal observables, acceptance rules, and resource costs. For a finite linear family, it characterizes the corresponding task quotient and establishes its minimal dimension within linear encoders admitting exact recovery of the contract predictions. Approximate reductions are treated through explicit stability bounds. These bounds show how errors in unnormalized output moments, acceptance probabilities, and attempt costs propagate into conditional expectations and cost per accepted outcome. Low acceptance can amplify a small modeling error and erase an apparent resource advantage. A robust-selection result identifies the feasibility margins required when choosing a policy from approximate predictions. The framework thereby connects process reduction to a concrete accuracy requirement. Finite-sample certification and resource accounting The manuscript derives simultaneous finite-sample certificates for conditional task bias and expected cost per accepted outcome. The guarantees remain valid after data-dependent selection within a fixed finite candidate family, under the stated assumptions of independent reset attempts, bounded observations and costs, and an independently trusted ideal reference. The accounting includes rejected attempts and distinguishes systematic task bias from statistical sampling uncertainty. It also charges characterization, compilation, classical computation, and revalidation to the total resource objective. This distinction matters because a nominal reduction in the cost of one execution can require an unaffordable calibration campaign. A useful controller must improve the complete calculation at matched task accuracy and confidence. Reproducible numerical investigation A classical numerical study evaluates ten pulse policies across three correlation regimes and two contracted observables. The calculations include analytic population predictions, Gaussian trajectory sampling, density-matrix consistency checks, and repeated finite-shot calibration experiments. The results exhibit task-dependent protection choices: a sequence beneficial for one observable can introduce unnecessary error for another. They also distinguish the absence of a certified policy from a general claim that no feasible control exists. Conventional calibrated Hahn echo and the corresponding two-pulse sequence match the best control performance in this benchmark. The study establishes identification and certification results within its declared models; scalable compression, hardware advantage, and reductions in fault-tolerance overhead remain open research objectives. Meaning of the subordinator renormalization problem The title names an operational research problem: construct a change of temporal resolution together with a compressed memory representation and a consistent update rule that preserve all contracted predictions under the permitted controls. The challenge includes causality, complete positivity where applicable, normalization, conditional updates, approximation error, and total resource cost. A small collection of fitted moments is insufficient unless these properties can be maintained through subsequent interventions. The manuscript uses renormalization in the sense of scale change and retention of operationally relevant information. It formulates the conditions a useful reduction must satisfy rather than claiming a completed Wilsonian flow or a new universality class. Relevance and readership The work is intended for researchers in quantum computing, open quantum systems, quantum control, noise characterization, quantum error correction, stochastic processes, fractional calculus, and mathematical model reduction. Its broader engineering relevance is the connection between a model’s predictive sufficiency and the reliable computational output obtained for the resources consumed. The proposed research direction is to identify physical families in which the memory relevant to a useful task can be represented, learned, and updated more efficiently than a full process description. Manuscript contents Version 2.0 comprises 23 pages, four figures, four propositions, one corollary, a finite-sample certification theorem, mathematical appendices, a glossary of 47 terms, and 49 bibliographic references. The bibliography covers stochastic clocks and fractional analysis, quantum dynamical semigroups, environmental memory, process tensors, noise spectroscopy, control, fault tolerance, and statistical certification. About the author Dr. Marcos Eduardo Elias is a Brazilian engineer, mathematician, computer scientist, and entrepreneur based in São Paulo. He is Chairman of Instituto Ramanujan and works with Holosystems on quantum algorithms, stochastic modeling, and the connection between mathematical research and physical computation. His interests include open quantum systems, adaptive quantum–classical optimization, cryptography, and decision-making under uncertainty. Acknowledgments The author gratefully acknowledges Holosystems Quantum Computing Systems for the institutional and intellectual setting in which the

•Nov 10, 2026•0 citations

QTT Physical Contact Selection and Predictive Transfer Theorem

Attar Ali

From independently qualified work to one interaction and several observations \[\boxed{L\ker B=\{0\}.}\] When does a device's independently specified work already determine its interaction? In a finite affine constructor, the answer is exact: every unresolved calibration direction must disappear from the observable interaction. The paper proves necessity and sufficiency, constructs a dual certificate, and counts the additional linear probes needed when selection fails. The QTT source-to-contact construction connects geometry, supported work, mode participation and the actual electrode waveform to a single coupling. That same coupling predicts one-excitation transfer, two-excitation redistribution, phase response and parity controls. A finite future-memory theorem identifies what must remain in the retained packet so that later operations cannot reveal something the model discarded. For independently specified insertion magnitudes, the cross-occupation prediction is \[P_{11}=\cos^2(F\Theta),\qquad F^2=f_{2,a}^2+f_{2,b}^2.\] For symmetric-slot modes, the corresponding frequency ratio obeys \[\boxed{\left(\frac{\Omega_2}{2\Omega_1}\right)^2=1-\frac{1}{2K_a}-\frac{1}{2K_b}.}\] Version 2.0 adds complete feasible-set selection, a harmonic three-dimensional drive, unequal-capacity transfer, and the full preparation-to-detector calculation. A cross-Kerr counterexample shows why a perfect one-excitation calibration alone cannot settle the two-excitation prediction. The package contains the manuscript, proofs, executable checks, synthetic examples and a reproducible audit of the public Hou trapped-ion tables. The selection and transfer results are proved within their stated finite classes. The canonical realization shares laboratory probabilities with matched microscopic quantum mechanics; finite-slot discrimination requires independently qualified physical capacities and instruments. The archive is a retrospective eligibility audit. The separate prospective test commits the measurement design before a laboratory supplies its physical capsule. Companion: Artian's Physical Contact Transfer Test. Source dependencies: Completed-Event Transport and Quantum Coherence; QTT Main Book. Independent experimental context: Hou et al., Nature Physics (2024). Browse the corpus. The main PDF is the preview; the ZIP contains the full reconstruction package.

•Sep 26, 2026•6 citations

Temporal-Access Resource Theory for Continuous Process Tensors

He Wang

The uncontrolled endpoint channel can conceal how well a quantum process can protect a logical task under time-resolved control. We formulate a fixed-task resource theory of continuous process tensors with physical access interfaces, entrance-erasing free objects, and budgeted free conversions. Complete-record total-variation error measures performance; the calibrated capability is monotone under conversions that preserve a common free baseline. For unknown-state transmission the baseline is exactly $1-d^{-2}$. Two qubit processes with the same endpoint channel have optimal errors $0$ and $p=\sin^2(2gh)$ at the same finite pulse budget in an ideal-transparent system-only window architecture, forcing any endpoint-only predictor to err by at least $p/2$ on one of them. An exactly solvable family shows how the allocation of a fixed interaction phase around a control window sets the attainable error, and a nontrivial perfect echo requires and attains total control action $π$ in that architecture. The separation extends directly to every qubit unitary target at a budget that includes its boundary gate, while unitary tasks in any dimension have baseline $1-d^{-2}$ whenever a budget-feasible free realization gives the depolarizing output. Complete-record implementation bounds quantify coherent and dissipative control imperfections. Continuous-process randomized compilation supplies physical instrument pullbacks; compatible completion conditions extend their action, and certified dynamical bounds yield achievable task-error and capability guarantees. The resulting theory identifies temporal structure and control investment that endpoint characterization alone cannot resolve.

quant-pharXiv:2610.13110•Oct 12, 2026•1 citation
The same quantum channel can hide different resource costs [\boxed{C_{\mathrm{loc}}=\varepsilon(\mu_M-\mu_0)+k_{\mathrm B}T_0\left[\sum_{j=1}^{M}h(q-\mu_j+\mu_{j-1})-Mh(q)\right].}] Two finite supply devices can implement exactly the same complete quantum channel while depleting different amounts of locally recoverable free energy. Even perfect endpoint process tomography need not determine that supply cost. This paper proves an explicit counterexample, then identifies the extra records that reconstruct the resource without fitting a relaxation rate: the intermediate mean excitation numbers, together with independently known preparation and energy scales. For a qubit contact with fixed population contraction (\Lambda), prepared supply population (q), initial system population (p_0), and (M) contacts, write (\Delta=(q-p_0)(1-\Lambda)). The full dynamically attainable resource interval is [C_{\min}=\varepsilon\Delta+k_{\mathrm B}T_0[h(q-\Delta)-h(q)],\qquad C_{\max}=\varepsilon\Delta+Mk_{\mathrm B}T_0[h(q-\Delta/M)-h(q)].] Both endpoints are constructively attainable when idle contacts are allowed. Every intermediate value occurs with the same complete reduced channel. The paper supplies the realizing contact angles, the refinement limit, an explicit correction for outgoing-unit coherence, and finite-error bounds that include uncertain energy and temperature scales. The collective extension gives the exact Dicke collision kernel, a controlled weak-collision limit, finite-contact parameter identification, and a stationary Otto-cycle resource balance. The reconstruction archive independently builds the joint unitary, partial traces, full reduced superoperators and a second Markov propagator. It reproduces the published collective-engine benchmark and includes all numerical cases, code, plot data and checksums. Scientific status. These are conditional mathematical theorems with reproducible synthetic verification. They extend the QTT physical-contact program by separating endpoint selection from resource selection. The chosen exchange contact has a matched conventional quantum realization. The work neither reports a laboratory detection nor claims an engine-specific axiom-only value of its coupling. Its operational advance is an explicit resource-selection criterion and a reconstruction that requires no coupling fit. Dependencies: QTT Physical Contact Selection and Predictive Transfer and Completed-Event Transport and Quantum Coherence. Independent benchmark: Garcez and colleagues, collective Dicke Otto engine. Corpus Tree. The PDF is the main paper and default preview. The ZIP contains the complete editable and executable reconstruction package.
AbstractRetained measurement records constrain recoverability, but their formation also depends on the available physical controls. We give exact, constructively attained answers to both questions in two specified models. For a balanced nondemolition qubit process with actual binary observer memories unavailable to the decoder, we determine the maximum recovery compatible with average readout accuracy and pair agreement. The finite-record solution includes its feasible region and a common memory-writing and recovery process, without assuming exchangeability of observed records. Under a complete conditional-pairwise-independence promise at fixed informative accuracy, the optimal coherence has a sharp inverse-square-root asymptotic; fully conditionally independent records instead give exponential decay. Thus identical single-record and pair-record calibrations need not justify the product-law recovery bound. We then fix a logical code in four spin-3/2 systems and sequential diagonal contacts with exact controlled-swap endpoints. Hard budgets for net contact action and added spectral control charge yield an exact peak-excursion frontier within a declared quadratic-plus-cubic control class. A single positive-amplitude preparation jointly attains the record, recovery and occupation requirements, connecting the two results through an exact finite-dimensional optimization. A closed three-record example distinguishes fixed complete records from fixed averaged data. Separately calibrated imperfect contacts admit one-sided finite-error extensions. Together, the results characterize both informational compatibility and control-dependent formation through common attaining apparatuses.Preprint status and related materialsAuthor-submitted preprint; not peer reviewed or accepted for publication. This theoretical and computational work addresses the compatibility of retained binary quantum records with optimized accessible-system recovery, and the control-dependent resources required to form those records in a specified spin encoding. The article provides exact finite-record bounds, attainable recovery and resource frontiers, and calibrated finite-error qualifications. The manuscript has been submitted to Foundations of Physics for journal consideration; this Figshare record is not a journal publication. The technical supplement is included as a second PDF in this same record. Related software, verification code, exact certificates, and selected computational evidence are available separately at https://doi.org/10.6084/m9.figshare.34886079 under the MIT licence. When a journal version of record becomes available, a link to its DOI will be added here.AuthorKent Nimmo; Independent Researcher, Vancouver, British Columbia, Canada; ORCID 0009-0003-8503-8891.Reading and related workBrowse Quantum Foundations for related work on records, access and measurement, and Mathematics for exact bounds and certified constructions. The MIT software/certificate archive remains a distinct record from these manuscript PDFs.
A physical identification requires a domain of experiments, a realization, and an observation that distinguishes competing mechanisms. We construct these for the δ framework. Within finite causal quantum experiments, computable Choi data are equivalent to finite arithmetic programs producing valid instrument approximations at every requested accuracy. A separate pointer reader preserves the quantum posterior and supports adaptive composition. For the native two-atom census, the actual join update and common-mode retention select golden scaling and a signed contraction. Coherent return selects its minimal conserving completion; an independently calibrated spectral band then selects its constant interaction. A bright-mode construction and a stable short-time calibration procedure supply an explicit realization and uncertainty budget; measured duration and frequency supply the dimensional units. We derive a general endpoint identity between stored record energy and comparison imbalance, and distinguish the monotone fresh-record trajectory from coherent recurrence. The logical-to-physical bridge also has a sharp boundary: an explicit instance of the proposed completion generator has no effective value-reflecting physical reader or numerical comparison receipt. Sequence completion requires precisely the corresponding halting-oracle resource, not an unexplained scalar cost. This obstructs operational completion while leaving purely proof-language transport distinct. Native implementations of identical logical strength nevertheless carry different physical receipts. Joint covariance and the exact endpoint law state the valid relationship between those quantities. Finally, calibrated return and three-outcome tests distinguish the relevant phase and recording alternatives, with quantitative error bounds. First public preprint release, version 1.0. The files include the PDF and the main TeX file. AI-use disclosure: AI assistance was used for source analysis, mathematical exploration, manuscript drafting and revision, diagram preparation, and computational verification support. GPT-6 Astra reviews assessed arguments, scope, readability, and schematics. These were internal model reviews, not external peer review. Jonathan Washburn is the sole listed author and is responsible for the released manuscript.
This preprint studies a cycle-reflection operation on a supplied six-qubit realization of paired trigram configurations. A four-matched-pulse identity and a minimum within its stated serial grammar are separated from an ordinary-exchange endpoint construction. The raw full-source reflection and its full domain-safe alternative are different tasks: the latter is excluded by a collective-symmetry obstruction in the admitted source-only exchange model. Strict preservation of the addressable sector throughout the path is also excluded for the full task, while finite-action lower bounds quantify peak no-address population and time-integrated exposure. The paper presents an explicit low-excursion balanced word and a conditional joint clock–amplitude error certificate. Root settings and trajectory inputs remain tied to their supplied computer-assisted certificates. The second internal review reproduced all ten advertised numerical routes and twenty-four outputs using the original programs; this is same-program reproducibility, not independent implementation or external peer review. A separate Lean supplement covers the finite raw/safe operator algebra and the obstruction for arbitrary finite words of the declared algebraic factors. It does not formalize the numerical roots, matrix exponentials, continuous-time dynamics or resource theorems. No global pulse optimum, measured hardware feasibility, general noise tolerance, or automatic connection to the companion recovery code is claimed.
A quantum processor is controlled through a sequence of operations distributed across time. Its reliability therefore depends on more than the decay observed when the device is left undisturbed. Environmental correlations, stochastic timing, intervention history, acceptance rules, and the observable being computed can all change which errors matter and which protection strategy is justified. The Subordinator Renormalization Problem examines this dependence through an integrated treatment of stochastic clocks, fractional dynamics, multi-time quantum processes, task-specific protection, and finite-sample certification. Its central question is precise: how can temporal resolution be changed and environmental memory compressed while preserving the predictions required by a specified quantum task, including the effects of permitted interventions and their full physical cost? Scientific motivation Coherence time, average gate fidelity, qubit count, and scalar measures of non-Markovianity characterize different aspects of a quantum device. They do not individually determine whether a particular computation can deliver a reliable answer within a given resource budget. A reduced model may reproduce uncontrolled relaxation while omitting correlations that become consequential under pulses, measurements, resets, or subsequent gates. This manuscript investigates the information that must survive a reduction of the noise description. It develops task-sufficient memory as an operational requirement: two process descriptions may be treated as equivalent only when they preserve the declared output expectations, acceptance probabilities, and costs for every allowed future continuation. Stochastic clocks and fractional quantum dynamics The mathematical framework connects Lévy subordinators, Bernstein functions, inverse stable clocks, renewal processes, Caputo fractional derivatives, and Mittag–Leffler relaxation with completely positive quantum dynamics. A central distinction concerns direct and inverse time changes. Direct Bochner subordination of a quantum dynamical semigroup can preserve the semigroup composition law while modifying its generator. An inverse stable clock generally produces a fractional evolution family without that composition law. Fractional powers of generators and fractional derivatives in physical time consequently represent different constructions and cannot be interpreted interchangeably. The manuscript also separates a change of time units from a physical change of the clock law. It derives an exact scaling identity within a fixed stable family and specifies the dimensions of the corresponding relaxation parameter. This identifies what scale covariance establishes and what would require additional evidence of physical control over the environment. The clock-reset problem For inverse stable relaxation, uninterrupted evolution and evolution with an independently renewed hidden clock generally yield different predictions. The paper derives a short-time expansion quantifying the difference between the coherence multiplier after uninterrupted evolution for twice a given duration and the product obtained from two independently renewed intervals. This result makes an otherwise hidden modeling assumption experimentally meaningful. A reset assumption changes the predicted observable response. Whether a real operation renews the relevant environmental variables must therefore be part of the physical model. The analysis includes closed-form calculations for the half-order Mittag–Leffler relaxation, checks of scale covariance, and verification of the deterministic-clock limit. Identical decoherence curves and different control responses An explicit Gaussian dephasing construction provides a separate identification counterexample. A continuum of noise processes produces exactly the same uncontrolled quantum channel at every time, while displaying different responses to spin echo. The entire family has zero Breuer–Laine–Piilo backflow in its uncontrolled reduced dynamics. Nevertheless, its temporal correlations determine whether an echo helps or harms once pulse imperfections are included. The construction shows why uncontrolled channel information alone can be insufficient for an intervention-dependent decision. The relevant distinction is operational: noise processes that look identical during idle evolution can require different control choices. The Gaussian construction and the inverse stable clock analysis are distinct models. Together, they expose complementary requirements on a predictive description, without identifying either construction as a universal microscopic model of a quantum device. Task-sufficient representations and mathematical guarantees The paper formulates exact equivalence of multi-time processes relative to a specified family of interventions, terminal observables, acceptance rules, and resource costs. For a finite linear family, it characterizes the corresponding task quotient and establishes its minimal dimension within linear encoders admitting exact recovery of the contract predictions. Approximate reductions are treated through explicit stability bounds. These bounds show how errors in unnormalized output moments, acceptance probabilities, and attempt costs propagate into conditional expectations and cost per accepted outcome. Low acceptance can amplify a small modeling error and erase an apparent resource advantage. A robust-selection result identifies the feasibility margins required when choosing a policy from approximate predictions. The framework thereby connects process reduction to a concrete accuracy requirement. Finite-sample certification and resource accounting The manuscript derives simultaneous finite-sample certificates for conditional task bias and expected cost per accepted outcome. The guarantees remain valid after data-dependent selection within a fixed finite candidate family, under the stated assumptions of independent reset attempts, bounded observations and costs, and an independently trusted ideal reference. The accounting includes rejected attempts and distinguishes systematic task bias from statistical sampling uncertainty. It also charges characterization, compilation, classical computation, and revalidation to the total resource objective. This distinction matters because a nominal reduction in the cost of one execution can require an unaffordable calibration campaign. A useful controller must improve the complete calculation at matched task accuracy and confidence. Reproducible numerical investigation A classical numerical study evaluates ten pulse policies across three correlation regimes and two contracted observables. The calculations include analytic population predictions, Gaussian trajectory sampling, density-matrix consistency checks, and repeated finite-shot calibration experiments. The results exhibit task-dependent protection choices: a sequence beneficial for one observable can introduce unnecessary error for another. They also distinguish the absence of a certified policy from a general claim that no feasible control exists. Conventional calibrated Hahn echo and the corresponding two-pulse sequence match the best control performance in this benchmark. The study establishes identification and certification results within its declared models; scalable compression, hardware advantage, and reductions in fault-tolerance overhead remain open research objectives. Meaning of the subordinator renormalization problem The title names an operational research problem: construct a change of temporal resolution together with a compressed memory representation and a consistent update rule that preserve all contracted predictions under the permitted controls. The challenge includes causality, complete positivity where applicable, normalization, conditional updates, approximation error, and total resource cost. A small collection of fitted moments is insufficient unless these properties can be maintained through subsequent interventions. The manuscript uses renormalization in the sense of scale change and retention of operationally relevant information. It formulates the conditions a useful reduction must satisfy rather than claiming a completed Wilsonian flow or a new universality class. Relevance and readership The work is intended for researchers in quantum computing, open quantum systems, quantum control, noise characterization, quantum error correction, stochastic processes, fractional calculus, and mathematical model reduction. Its broader engineering relevance is the connection between a model’s predictive sufficiency and the reliable computational output obtained for the resources consumed. The proposed research direction is to identify physical families in which the memory relevant to a useful task can be represented, learned, and updated more efficiently than a full process description. Manuscript contents Version 2.0 comprises 23 pages, four figures, four propositions, one corollary, a finite-sample certification theorem, mathematical appendices, a glossary of 47 terms, and 49 bibliographic references. The bibliography covers stochastic clocks and fractional analysis, quantum dynamical semigroups, environmental memory, process tensors, noise spectroscopy, control, fault tolerance, and statistical certification. About the author Dr. Marcos Eduardo Elias is a Brazilian engineer, mathematician, computer scientist, and entrepreneur based in São Paulo. He is Chairman of Instituto Ramanujan and works with Holosystems on quantum algorithms, stochastic modeling, and the connection between mathematical research and physical computation. His interests include open quantum systems, adaptive quantum–classical optimization, cryptography, and decision-making under uncertainty. Acknowledgments The author gratefully acknowledges Holosystems Quantum Computing Systems for the institutional and intellectual setting in which the
From independently qualified work to one interaction and several observations Lker⁡B={0}.\boxed{L\ker B=\{0\}.}LkerB={0}.​ When does a device's independently specified work already determine its interaction? In a finite affine constructor, the answer is exact: every unresolved calibration direction must disappear from the observable interaction. The paper proves necessity and sufficiency, constructs a dual certificate, and counts the additional linear probes needed when selection fails. The QTT source-to-contact construction connects geometry, supported work, mode participation and the actual electrode waveform to a single coupling. That same coupling predicts one-excitation transfer, two-excitation redistribution, phase response and parity controls. A finite future-memory theorem identifies what must remain in the retained packet so that later operations cannot reveal something the model discarded. For independently specified insertion magnitudes, the cross-occupation prediction is P11=cos⁡2(FΘ),F2=f2,a2+f2,b2.P_{11}=\cos^2(F\Theta),\qquad F^2=f_{2,a}^2+f_{2,b}^2.P11​=cos2(FΘ),F2=f2,a2​+f2,b2​. For symmetric-slot modes, the corresponding frequency ratio obeys (Ω22Ω1)2=1−12Ka−12Kb.\boxed{\left(\frac{\Omega_2}{2\Omega_1}\right)^2=1-\frac{1}{2K_a}-\frac{1}{2K_b}.}(2Ω1​Ω2​​)2=1−2Ka​1​−2Kb​1​.​ Version 2.0 adds complete feasible-set selection, a harmonic three-dimensional drive, unequal-capacity transfer, and the full preparation-to-detector calculation. A cross-Kerr counterexample shows why a perfect one-excitation calibration alone cannot settle the two-excitation prediction. The package contains the manuscript, proofs, executable checks, synthetic examples and a reproducible audit of the public Hou trapped-ion tables. The selection and transfer results are proved within their stated finite classes. The canonical realization shares laboratory probabilities with matched microscopic quantum mechanics; finite-slot discrimination requires independently qualified physical capacities and instruments. The archive is a retrospective eligibility audit. The separate prospective test commits the measurement design before a laboratory supplies its physical capsule. Companion: Artian's Physical Contact Transfer Test. Source dependencies: Completed-Event Transport and Quantum Coherence; QTT Main Book. Independent experimental context: Hou et al., Nature Physics (2024). Browse the corpus. The main PDF is the preview; the ZIP contains the full reconstruction package.
The uncontrolled endpoint channel can conceal how well a quantum process can protect a logical task under time-resolved control. We formulate a fixed-task resource theory of continuous process tensors with physical access interfaces, entrance-erasing free objects, and budgeted free conversions. Complete-record total-variation error measures performance; the calibrated capability is monotone under conversions that preserve a common free baseline. For unknown-state transmission the baseline is exactly 1−d−21-d^{-2}1−d−2. Two qubit processes with the same endpoint channel have optimal errors 000 and p=sin⁡2(2gh)p=\sin^2(2gh)p=sin2(2gh) at the same finite pulse budget in an ideal-transparent system-only window architecture, forcing any endpoint-only predictor to err by at least p/2p/2p/2 on one of them. An exactly solvable family shows how the allocation of a fixed interaction phase around a control window sets the attainable error, and a nontrivial perfect echo requires and attains total control action πππ in that architecture. The separation extends directly to every qubit unitary target at a budget that includes its boundary gate, while unitary tasks in any dimension have baseline 1−d−21-d^{-2}1−d−2 whenever a budget-feasible free realization gives the depolarizing output. Complete-record implementation bounds quantify coherent and dissipative control imperfections. Continuous-process randomized compilation supplies physical instrument pullbacks; compatible completion conditions extend their action, and certified dynamical bounds yield achievable task-error and capability guarantees. The resulting theory identifies temporal structure and control investment that endpoint characterization alone cannot resolve.