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

arXiv:2608.21436

Quantum Technologies: System-Level Performance and Validation Priorities

Slava G. Turyshev

Published Aug 17, 2026• 2 citations
arXivHTMLPDF

Abstract

Performance claims in quantum technology are not properties of hardware alone. They are properties of a declared task, system boundary, normalization denominator, uncertainty or security convention, and comparator. We perform a cross-domain analysis spanning quantum computing, simulation, communication, sensing, clocks, randomness generation, and their enabling technologies. The analysis changes substantive conclusions in several representative cases. For the longest direct finite-key quantum key distribution case analyzed here, the same final key gives rates differing by a factor of $1.91$ when normalized by complete acquisition rather than transmission-active time. In Advanced LIGO, $6.1\,\mathrm{dB}$ peak quantum-noise reduction coexists with a $0.534$ coincident analysis-ready fraction, separating detector-level gain from delivered observing service. In quantum computation and photonic sampling, matching the observable, error tolerance, loss model, sample count, amortization, and classical hardware moves or reverses published crossover claims. Across domains, the recurring limits are correlated error, multiplicative interface loss, thermal and nonequilibrium occupation, calibration covariance, measurement efficiency, fabrication yield, and control latency. A quantum advantage is therefore established only for a fixed task and boundary when the accepted output outperforms the best documented alternative at matched accuracy, elapsed time, availability, and lifecycle cost. The resulting framework identifies the measurements required to convert component records into reproducible system capability. Credible progress is defined by reproduced logical workloads, prospectively validated simulations, repeater links outperforming direct transmission, long-duration calibrated sensors and clocks, integrated hardware with predictable yield and reliability.

DOI
10.48550/arxiv.2608.21436

Related papers

Ledger-Valid Recovery Diagnostics for Quantum Computing: A Prespecified Sequential Audit for Claim-Limited Recovery Validation

David Reardon

This record contains a manuscript and supporting reproducibility materials for “Ledger-Valid Recovery Diagnostics for Quantum Computing: A Prespecified Sequential Audit for Claim-Limited Recovery Validation.” The paper proposes a methodological validation framework for quantum-computing recovery claims. Its central claim is that endpoint recovery success is necessary but not sufficient for a strong recovery claim when calibration failure, false-carrier acceptance, postselection artifacts, leakage, sentinel blindness, or hidden discard can carry failure modes out of view. The manuscript introduces a prespecified S0–S4 ledger audit that converts familiar diagnostic ingredients—label calibration, candidate recovery, false-carrier challenge tests, postselection/leakage accounting, and sentinel observability—into an ordered, claim-limiting taxonomy. A supportive recovery claim is permitted only when all required gates pass; otherwise, the first failed stage determines a lower claim ceiling and an interpretable failure class. The evaluation is based on synthetic endpoint-level validation suites rather than circuit-level simulation or hardware data. These suites test the behavior of the decision architecture under clean support, degraded observability, false-carrier artifacts, postselection/leakage artifacts, sentinel-blind cases, correlated artifacts, and adversarial overlap. The results show a strong specificity/sensitivity tradeoff: the full ledger protocol sharply reduces synthetic non-support supportive-call rates relative to endpoint-only reporting, but with substantial loss of mechanism-positive support sensitivity. The paper explicitly treats this as a conservative claim-validity architecture, not as a new quantum error-correcting code, new physical observable, hardware speedup, or proof of improved device performance. The supporting materials document the final synthetic validation protocol, endpoint definitions, decision-bound implementation, direction-aware threshold sensitivity analysis, latent-threshold eligibility analysis, mechanism-negative/latent-eligible boundary cases, and figure/table traceability. The archive is intended to support review of the manuscript’s aggregate numerical claims and methodological provenance. Hardware implementation, independent simulator validation, and full raw-event-ledger reproduction are identified as future extensions. Suggested keywords: quantum computing; quantum error correction; validation methodology; recovery diagnostics; leakage; postselection; benchmarking; synthetic validation; decision architecture; reproducibility.

•Aug 15, 2026•0 citations

A System-Level Survey of Architectures, Noise, and Network Co-Design in QISAC

Vikram Singh Thakur, Atul Kumar, Maurizio Magarini +2 more

Quantum integrated sensing and communication (QISAC) is emerging as a key paradigm for next-generation quantum technologies, in which entanglement, coherence, and non-classical correlations are jointly exploited to enable secure communication, distributed sensing, and networked quantum functionalities. As quantum systems transition from laboratory demonstrations to deployable infrastructures, performance is increasingly limited not by individual components but by cross-layer interactions among hardware noise, channel loss, error-management strategies, and network architecture. This survey presents a system-level architectural framework for QISAC, focusing on how physical-layer constraints, quantum channel characteristics, and error-mitigation mechanisms jointly determine end-to-end performance and architectural feasibility in scalable quantum networks. We analyze representative quantum hardware platforms-including superconducting circuits, trapped ions, neutral atoms, photonic systems, and solid-state spin qubits-through the lens of coherence time, fidelity, interface capability, and technology readiness, emphasizing their implications for networked sensing and communication rather than device-level operation. The roles of quantum error correction (QEC) and entanglement purification are examined as complementary error-management layers, highlighting trade-offs among resource overhead, latency, and achievable entanglement fidelity under realistic noise and memory constraints. We further connect these architectural considerations to QISAC-enabled applications such as distributed quantum sensing, quantum key distribution (QKD), and repeater-assisted entanglement distribution, clarifying how hardware limitations and error-management choices propagate to application-level performance. By synthesizing noise, error management, and network co-design into a unified system perspective, this survey provides design-oriented insights and architectural guidelines for building scalable, noise-resilient QISAC networks.

IEEE Open Journal of the Communications Society•Jan 1, 2026•2 citations

Quantum Computing in Space: Engineering Challenges, Fundamental Limits, and Perspectives

Qurban Ali Memon

Quantum computer deployment in space remains constrained by demanding hardware, environmental, and communications requirements. This paper reviews the opportunities and challenges of using quantum computing in space systems. It focuses on payload integration, radiation protection, quantum-memory stability, autonomous hybrid classical–quantum control, and quantum-network performance. The work is integrative, not novel in algorithms, architecture, optimization, or experiments. It organizes reviewed literature around system-level deployment barriers and highlights open research gaps. Compared with existing reviews, this paper adds a category taxonomy, a system-level constraint framing, updated coverage, and an integration of rate–loss fundamentals. The analysis highlights the need for standardized interfaces, autonomous classical–quantum control, and evolutionary qualification of subsystems in orbit. Modular, radiation-adaptive payloads and calibration-aware classical processing are identified as important strategies for improving reliability and mission resilience. The industrial outlook indicates a gradual transition from subsystem demonstrations toward standardized, interoperable, and vertically integrated quantum-communication services, including LEO QKD constellations, space-qualified protocol stacks, and CubeSat-scale photonic devices. Readiness claims are classified using a multi-stage ladder: launch, power-on, communication, calibration, quantum operation, and peer-reviewed useful computational performance. Fully fault-tolerant quantum computing in orbit remains a longer-term objective requiring advances in logical-qubit overhead, radiation tolerance, low-power control, memory performance, and repeater architectures.

Quantum Reports•Oct 10, 2026•0 citations

Quantum artificial intelligence: A comprehensive survey

Hanqi Jiang, Yi Pan, Junhao Chen +14 more

Quantum Artificial Intelligence (QAI) has emerged at the nexus of quantum computing and AI, promising to redefine computational frontiers. This survey critically synthesizes the state-of-the- art through 2024, elucidating the profound bidirectional synergy between these fields. We analyze how classical machine learning is accelerating quantum hardware control, circuit optimization, and error correction. Conversely, we assess the potential quantum advantage of algorithms, including variational and kernel-based methods, across domains such as drug discovery, financial modeling, and cybersecurity. Our analysis reveals a critical trade-of between the utility of near-term Noisy Intermediate-Scale Quantum (NISQ) devices and the long-term promise of fault-tolerant architectures. We identify fundamental obstacles to QAI’s advancement, including hardware decoherence, algorithmic barren plateaus, and data-encoding bottlenecks. While QAI’s potential is transformative, achieving practical quantum advantage requires a concerted effort to overcome these core challenges at the hardware-software interface. This work provides a roadmap for navigating the current landscape and prioritizing future research in this rapidly evolving discipline. • We introduce a bi-directional Quantum-AI framework, AI-for-QC and QC-for-AI, and provide a practical roadmap for integrating both paradigms across the full stack. • We quantify AI-enabled gains: calibration time drops from 8 hours to 2 hours, circuit depth falls by up to 42%, and ML decoders cut logical error rates by about half. • We synthesize comparative guidance on VQAs, quantum kernels, and hybrid/quantum Transformers, clarifying trainability limits and criteria for credible quantum advantage. • We deliver a clinically grounded playbook for radiology, covering small-data use cases, plug-in hybrid modules, OOD validation, fairness assessments, and TRIPOD/CONSORT-AI reporting.

Meta-Radiology•Feb 13, 2026•1 citation

A Review and Collection of Metrics and Benchmarks for Quantum Computers: definitions, methodologies and software

Deep Lall, Abhishek Agarwal, Weixi Zhang +15 more

Quantum computers have the potential to provide an advantage over classical computers in a number of areas. Numerous metrics to benchmark the performance of quantum computers, ranging from their individual hardware components to entire applications, have been proposed over the years. Objective comparisons are further hampered in practice as different variations of the same metric are used, and the data disclosed together with a reported metric value is often not sufficient to reproduce the measurements. In this poster, we present our recent article, where we address these challenges by providing a review of metrics and benchmarks for quantum computers [1], including 1) a comprehensive collection of benchmarks allowing holistic comparisons of quantum computers, 2) a consistent format of the definitions across all metrics including a transparent description of the methodology and of the main assumptions and limitations, and 3) a reproducible approach by linking the metrics to open-source software used to evaluate them . We identify five areas where international standardization working groups could be established, namely: i) the identification and agreement on the categories of metrics that comprehensively benchmark device performance; ii) the identification and agreement on a set of well-established metrics that together comprehensively benchmark performance; iii) the identification of metrics specific to hardware platforms, including non-gate-based quantum computers; iv) inter-laboratory comparison studies to develop best practice guides for measurement methodology; and v) agreement on what data and software should be reported together with a metric value to ensure trust, transparency and reproducibility. We provide potential routes to advancing these areas. We expect that this work will accelerate the progress of quantum computing hardware towards quantum advantage. [1] D. Lall et al., A Review and Collection of Metrics and Benchmarks for Quantum Computers: Definitions, Methodologies and Software, arXiv:2502.06717.

arXiv:2502.06717•Jan 1, 2025•28 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
Performance claims in quantum technology are not properties of hardware alone. They are properties of a declared task, system boundary, normalization denominator, uncertainty or security convention, and comparator. We perform a cross-domain analysis spanning quantum computing, simulation, communication, sensing, clocks, randomness generation, and their enabling technologies. The analysis changes substantive conclusions in several representative cases. For the longest direct finite-key quantum key distribution case analyzed here, the same final key gives rates differing by a factor of 1.911.911.91 when normalized by complete acquisition rather than transmission-active time. In Advanced LIGO, 6.1 dB6.1\,\mathrm{dB}6.1dB peak quantum-noise reduction coexists with a 0.5340.5340.534 coincident analysis-ready fraction, separating detector-level gain from delivered observing service. In quantum computation and photonic sampling, matching the observable, error tolerance, loss model, sample count, amortization, and classical hardware moves or reverses published crossover claims. Across domains, the recurring limits are correlated error, multiplicative interface loss, thermal and nonequilibrium occupation, calibration covariance, measurement efficiency, fabrication yield, and control latency. A quantum advantage is therefore established only for a fixed task and boundary when the accepted output outperforms the best documented alternative at matched accuracy, elapsed time, availability, and lifecycle cost. The resulting framework identifies the measurements required to convert component records into reproducible system capability. Credible progress is defined by reproduced logical workloads, prospectively validated simulations, repeater links outperforming direct transmission, long-duration calibrated sensors and clocks, integrated hardware with predictable yield and reliability.
This record contains a manuscript and supporting reproducibility materials for “Ledger-Valid Recovery Diagnostics for Quantum Computing: A Prespecified Sequential Audit for Claim-Limited Recovery Validation.” The paper proposes a methodological validation framework for quantum-computing recovery claims. Its central claim is that endpoint recovery success is necessary but not sufficient for a strong recovery claim when calibration failure, false-carrier acceptance, postselection artifacts, leakage, sentinel blindness, or hidden discard can carry failure modes out of view. The manuscript introduces a prespecified S0–S4 ledger audit that converts familiar diagnostic ingredients—label calibration, candidate recovery, false-carrier challenge tests, postselection/leakage accounting, and sentinel observability—into an ordered, claim-limiting taxonomy. A supportive recovery claim is permitted only when all required gates pass; otherwise, the first failed stage determines a lower claim ceiling and an interpretable failure class. The evaluation is based on synthetic endpoint-level validation suites rather than circuit-level simulation or hardware data. These suites test the behavior of the decision architecture under clean support, degraded observability, false-carrier artifacts, postselection/leakage artifacts, sentinel-blind cases, correlated artifacts, and adversarial overlap. The results show a strong specificity/sensitivity tradeoff: the full ledger protocol sharply reduces synthetic non-support supportive-call rates relative to endpoint-only reporting, but with substantial loss of mechanism-positive support sensitivity. The paper explicitly treats this as a conservative claim-validity architecture, not as a new quantum error-correcting code, new physical observable, hardware speedup, or proof of improved device performance. The supporting materials document the final synthetic validation protocol, endpoint definitions, decision-bound implementation, direction-aware threshold sensitivity analysis, latent-threshold eligibility analysis, mechanism-negative/latent-eligible boundary cases, and figure/table traceability. The archive is intended to support review of the manuscript’s aggregate numerical claims and methodological provenance. Hardware implementation, independent simulator validation, and full raw-event-ledger reproduction are identified as future extensions. Suggested keywords: quantum computing; quantum error correction; validation methodology; recovery diagnostics; leakage; postselection; benchmarking; synthetic validation; decision architecture; reproducibility.
Quantum integrated sensing and communication (QISAC) is emerging as a key paradigm for next-generation quantum technologies, in which entanglement, coherence, and non-classical correlations are jointly exploited to enable secure communication, distributed sensing, and networked quantum functionalities. As quantum systems transition from laboratory demonstrations to deployable infrastructures, performance is increasingly limited not by individual components but by cross-layer interactions among hardware noise, channel loss, error-management strategies, and network architecture. This survey presents a system-level architectural framework for QISAC, focusing on how physical-layer constraints, quantum channel characteristics, and error-mitigation mechanisms jointly determine end-to-end performance and architectural feasibility in scalable quantum networks. We analyze representative quantum hardware platforms-including superconducting circuits, trapped ions, neutral atoms, photonic systems, and solid-state spin qubits-through the lens of coherence time, fidelity, interface capability, and technology readiness, emphasizing their implications for networked sensing and communication rather than device-level operation. The roles of quantum error correction (QEC) and entanglement purification are examined as complementary error-management layers, highlighting trade-offs among resource overhead, latency, and achievable entanglement fidelity under realistic noise and memory constraints. We further connect these architectural considerations to QISAC-enabled applications such as distributed quantum sensing, quantum key distribution (QKD), and repeater-assisted entanglement distribution, clarifying how hardware limitations and error-management choices propagate to application-level performance. By synthesizing noise, error management, and network co-design into a unified system perspective, this survey provides design-oriented insights and architectural guidelines for building scalable, noise-resilient QISAC networks.
Quantum computer deployment in space remains constrained by demanding hardware, environmental, and communications requirements. This paper reviews the opportunities and challenges of using quantum computing in space systems. It focuses on payload integration, radiation protection, quantum-memory stability, autonomous hybrid classical–quantum control, and quantum-network performance. The work is integrative, not novel in algorithms, architecture, optimization, or experiments. It organizes reviewed literature around system-level deployment barriers and highlights open research gaps. Compared with existing reviews, this paper adds a category taxonomy, a system-level constraint framing, updated coverage, and an integration of rate–loss fundamentals. The analysis highlights the need for standardized interfaces, autonomous classical–quantum control, and evolutionary qualification of subsystems in orbit. Modular, radiation-adaptive payloads and calibration-aware classical processing are identified as important strategies for improving reliability and mission resilience. The industrial outlook indicates a gradual transition from subsystem demonstrations toward standardized, interoperable, and vertically integrated quantum-communication services, including LEO QKD constellations, space-qualified protocol stacks, and CubeSat-scale photonic devices. Readiness claims are classified using a multi-stage ladder: launch, power-on, communication, calibration, quantum operation, and peer-reviewed useful computational performance. Fully fault-tolerant quantum computing in orbit remains a longer-term objective requiring advances in logical-qubit overhead, radiation tolerance, low-power control, memory performance, and repeater architectures.
Quantum Artificial Intelligence (QAI) has emerged at the nexus of quantum computing and AI, promising to redefine computational frontiers. This survey critically synthesizes the state-of-the- art through 2024, elucidating the profound bidirectional synergy between these fields. We analyze how classical machine learning is accelerating quantum hardware control, circuit optimization, and error correction. Conversely, we assess the potential quantum advantage of algorithms, including variational and kernel-based methods, across domains such as drug discovery, financial modeling, and cybersecurity. Our analysis reveals a critical trade-of between the utility of near-term Noisy Intermediate-Scale Quantum (NISQ) devices and the long-term promise of fault-tolerant architectures. We identify fundamental obstacles to QAI’s advancement, including hardware decoherence, algorithmic barren plateaus, and data-encoding bottlenecks. While QAI’s potential is transformative, achieving practical quantum advantage requires a concerted effort to overcome these core challenges at the hardware-software interface. This work provides a roadmap for navigating the current landscape and prioritizing future research in this rapidly evolving discipline. • We introduce a bi-directional Quantum-AI framework, AI-for-QC and QC-for-AI, and provide a practical roadmap for integrating both paradigms across the full stack. • We quantify AI-enabled gains: calibration time drops from 8 hours to 2 hours, circuit depth falls by up to 42%, and ML decoders cut logical error rates by about half. • We synthesize comparative guidance on VQAs, quantum kernels, and hybrid/quantum Transformers, clarifying trainability limits and criteria for credible quantum advantage. • We deliver a clinically grounded playbook for radiology, covering small-data use cases, plug-in hybrid modules, OOD validation, fairness assessments, and TRIPOD/CONSORT-AI reporting.
Quantum computers have the potential to provide an advantage over classical computers in a number of areas. Numerous metrics to benchmark the performance of quantum computers, ranging from their individual hardware components to entire applications, have been proposed over the years. Objective comparisons are further hampered in practice as different variations of the same metric are used, and the data disclosed together with a reported metric value is often not sufficient to reproduce the measurements. In this poster, we present our recent article, where we address these challenges by providing a review of metrics and benchmarks for quantum computers [1], including 1) a comprehensive collection of benchmarks allowing holistic comparisons of quantum computers, 2) a consistent format of the definitions across all metrics including a transparent description of the methodology and of the main assumptions and limitations, and 3) a reproducible approach by linking the metrics to open-source software used to evaluate them . We identify five areas where international standardization working groups could be established, namely: i) the identification and agreement on the categories of metrics that comprehensively benchmark device performance; ii) the identification and agreement on a set of well-established metrics that together comprehensively benchmark performance; iii) the identification of metrics specific to hardware platforms, including non-gate-based quantum computers; iv) inter-laboratory comparison studies to develop best practice guides for measurement methodology; and v) agreement on what data and software should be reported together with a metric value to ensure trust, transparency and reproducibility. We provide potential routes to advancing these areas. We expect that this work will accelerate the progress of quantum computing hardware towards quantum advantage. [1] D. Lall et al., A Review and Collection of Metrics and Benchmarks for Quantum Computers: Definitions, Methodologies and Software, arXiv:2502.06717.
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