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

Workload–Mereology Quantum Computing: When Computational Demand Changes the Preferred Quantum Subsystem Structure

Md. Amir Khusru Akhtar

Published Sep 30, 2026• 0 citations
Publisher

Abstract

Quantum subsystem structure is typically specified independently of the workload, yet the decomposition that best preserves locality under a Hamiltonian need not be the one that best supports repeated computation. We develop workload–mereology quantum computing, a framework in which generalized tensor-product structure is selected by an explicit competition between dynamical naturalness and computational demand. Physical cost is quantified using the Gaussian scrambling criterion of operational quantum mereology, while task cost measures workload interactions cut by a candidate bipartition. After dimensionless normalization, their competition is captured by Jλ(F) = Ŝ(F) + λĈₜ(F). We prove that a factorization is uniquely optimal for some workload pressure precisely when its cost pair is an exposed point of the lower convex hull, and that a genuine compromise remains optimal over a nonempty interval precisely when it forms a strict intermediate lower-hull vertex. A four-qubit construction yields the transition threshold in closed form. Exhaustive reproducible simulations show that compromise factorizations are not exceptional: at n = 10 and λ = 1, they occur in 61.33% of 300 commuting Pauli-ZZ instances for uniform and lognormal couplings (60.67% for normal couplings) and in 59.00% of generic noncommuting XX+YY+ZZ instances. These results identify a task-dependent regime of quantum subsystem organization in which workload does more than act on a predetermined decomposition: it becomes a variational ingredient in determining which decomposition is preferred.

DOI
10.5281/zenodo.23053232

Related papers

Relational Emergence Model (REM 5.12): Variational Selection of Tensor-Product Structure in Quantum Systems

Yoshifumi Maruko

Quantum theory does not uniquely determine subsystem structure. This paper proposes a variational principle on factorization space to select preferred tensor-product structure. The optimization objective balances informational articulation (mutual information across subsystem boundaries) and dynamical separability (interaction coupling across the partition). The framework is formulated on the coset manifold F ≅ U(N)/(U(n_A)⊗U(n_B)) and provides a generative extension of relational quantum mechanics (Rovelli 1996), in which subsystem structure itself is treated as a variational degree of freedom rather than a primitive assumption. A three-qubit illustration demonstrates regime competition with crossover at λ* ≈ 0.28, consistent with results in the REM series (REM2–REM4). This paper is the fifth in the Relational Emergence Model (REM) series.

•Apr 18, 2026•0 citations

Operational Quantum Mereology and Minimal Scrambling

Paolo Zanardi, Emanuel Dallas, Faidon Andreadakis +1 more

In this paper we will attempt to answer the following question: what are the natural quantum subsystems which emerge out of a system's dynamical laws? To answer this question we first define generalized tensor product structures (gTPS) in terms of observables, as dual pairs of an operator subalgebra A and its commutant. Second, we propose an operational criterion of minimal information scrambling at short time scales to dynamically select gTPS. In this way the emergent subsystems are those which maintain the longest informational identity. This strategy is made quantitative by defining a Gaussian scrambling rate in terms of the short-time expansion of an algebraic version of the Out of Time Order Correlation (OTOC) function i.e., the A -OTOC. The Gaussian scrambling rate is computed analytically for physically important cases of general division into subsystems, and is shown to have an intuitive and compelling physical interpretation in terms of minimizing the interaction strength between subsystems.

arXiv:2212.14340•Quantum•Jul 11, 2024•17 citations

Quantum mereology: Factorizing Hilbert space into subsystems with quasiclassical dynamics

Sean M. Carroll, Ashmeet Singh

We study the question of how to decompose Hilbert space into a preferred tensor-product factorization without any preexisting structure other than a Hamiltonian operator, in particular the case of a bipartite decomposition into ``system'' and ``environment.'' Such a decomposition can be defined by looking for subsystems that exhibit quasiclassical behavior. The correct decomposition is one in which pointer states of the system are relatively robust against environmental monitoring (their entanglement with the environment does not continually and dramatically increase) and remain localized around approximately classical trajectories. We present an in-principle algorithm for finding such a decomposition by minimizing a combination of entanglement growth and internal spreading of the system. Both of these properties are related to locality in different ways. This formalism is relevant to questions in the foundations of quantum mechanics and the emergence of spacetime from quantum entanglement.

arXiv:2005.12938•Physical Review A•Feb 16, 2021•74 citations

Performance Model for Hybrid Quantum-Classical Workflows

Pooja Rao, Dimitar Trenev, Jerome Gonthier +13 more

Hybrid quantum-classical workflows are expected to underpin practical quantum computing applications, yet the quantum and HPC communities lack a shared framework for reasoning about where and when their integration requirements matter most. Such a framework must separate two distinct levels of analysis: the application level, where communication overhead affects runtime performance, and the real-time level, where it determines feasibility. To address this, we introduce a runtime model that decomposes workflow execution into quantum compute, classical compute, and communication costs. At the application level, a communication-to-computation ratio from this decomposition quantifies whether a workflow is communication-bound or compute-bound; at the real-time level, a feasibility constraint determines whether timing requirements can be met at all, with the reaction time setting the logical clock speed of fault-tolerant computation once they are. Application of this model to representative workflows demonstrates that co-location of quantum processors with HPC infrastructure offers negligible performance benefit for compute-intensive applications today, while tight integration remains crucial for real-time tasks such as quantum error correction needed for large scale quantum computations. However, we discuss how even at the application level these assessments may shift with hardware evolution, illustrating how the model can identify specific crossover conditions, and how, under fault tolerance, the reaction time can set application-level performance.

quant-pharXiv:2607.15426•Jul 20, 2026•5 citations

Evidence of Structure Selection in Hilbert Space Decompositions

Patrick Panella

The tensor-product decomposition of Hilbert space is not fixed by quantum formalism alone, so any claim that locality or subsystem structure is intrinsic requires a nontrivial selection principle. I test whether decomposition space develops reproducible preference structure under a graph-agnostic selector rewarding low Pauli support complexity, weak one-body leakage, and concentrated two-body partner structure. Two four-qubit exact controls are carried out by exhaustive evaluation over distinct 729-member gauge-fixed families: a matched line-brickwork family and a non-line matching family. In both controls, the designated structured reference--the native frame in local instances and the hidden frame in planted instances--lies far below the half-rank null, whereas scrambled references do not. I then extend the same selector to a six-qubit scalable benchmark using a graph-agnostic depth-four matching search, where local and planted references again concentrate near the bottom of the sampled family while scrambled controls return to the half-rank regime. Taken together, these results provide concrete evidence of structure selection in the decomposition families studied here. The paper does not claim uniqueness or full geometric reconstruction, but it shows that decomposition space is already internally differentiated once dynamics and operator organization are taken seriously.

•Apr 14, 2026•0 citations

Local Quantitative Identifiability of Preferred Decomposition for Graph-Local Hamiltonians

Patrick Panella

A finite Hilbert space supports many inequivalent tensor-product decompositions, so any Hilbert-space-first account of locality must explain more than why a single candidate performs well in a discrete search; it must also determine whether that preference governs nearby continuous refactorizations. Earlier work in this area established three key ingredients: that decomposition space is empirically non-flat under simple support-based selectors in explicit few-qubit studies; that the physically meaningful object in exact finite searches is a quotient class rather than a uniquely labeled factorization, defined modulo local gauge transformations and subsystem permutations; and that, for exactly graph-local Hamiltonians, the associated quadratic form has a kernel precisely given by the local gauge Lie algebra under explicit visibility and genericity conditions. Building on these results, the present paper proves a local theorem showing that, in a neighborhood of the graph-local class, the static selector is quantitatively equivalent to the square of the quotient distance. As a consequence, the preferred decomposition class is a strictly isolated local minimum: small selector values enforce closeness in the quotient sense, and no sufficiently small nongauge refactorization can replicate the preferred structure. The result is intentionally local in scope. It does not assert global uniqueness, a global spectral gap, or a full reconstruction of geometry, but instead isolates the strongest quantitative statement currently supported by the available analytic framework.

•Apr 15, 2026•0 citations
Quantum subsystem structure is typically specified independently of the workload, yet the decomposition that best preserves locality under a Hamiltonian need not be the one that best supports repeated computation. We develop workload–mereology quantum computing, a framework in which generalized tensor-product structure is selected by an explicit competition between dynamical naturalness and computational demand. Physical cost is quantified using the Gaussian scrambling criterion of operational quantum mereology, while task cost measures workload interactions cut by a candidate bipartition. After dimensionless normalization, their competition is captured by Jλ(F) = Ŝ(F) + λĈₜ(F). We prove that a factorization is uniquely optimal for some workload pressure precisely when its cost pair is an exposed point of the lower convex hull, and that a genuine compromise remains optimal over a nonempty interval precisely when it forms a strict intermediate lower-hull vertex. A four-qubit construction yields the transition threshold in closed form. Exhaustive reproducible simulations show that compromise factorizations are not exceptional: at n = 10 and λ = 1, they occur in 61.33% of 300 commuting Pauli-ZZ instances for uniform and lognormal couplings (60.67% for normal couplings) and in 59.00% of generic noncommuting XX+YY+ZZ instances. These results identify a task-dependent regime of quantum subsystem organization in which workload does more than act on a predetermined decomposition: it becomes a variational ingredient in determining which decomposition is preferred.
Quantum theory does not uniquely determine subsystem structure. This paper proposes a variational principle on factorization space to select preferred tensor-product structure. The optimization objective balances informational articulation (mutual information across subsystem boundaries) and dynamical separability (interaction coupling across the partition). The framework is formulated on the coset manifold F ≅ U(N)/(U(n_A)⊗U(n_B)) and provides a generative extension of relational quantum mechanics (Rovelli 1996), in which subsystem structure itself is treated as a variational degree of freedom rather than a primitive assumption. A three-qubit illustration demonstrates regime competition with crossover at λ* ≈ 0.28, consistent with results in the REM series (REM2–REM4). This paper is the fifth in the Relational Emergence Model (REM) series.
In this paper we will attempt to answer the following question: what are the natural quantum subsystems which emerge out of a system's dynamical laws? To answer this question we first define generalized tensor product structures (gTPS) in terms of observables, as dual pairs of an operator subalgebra A and its commutant. Second, we propose an operational criterion of minimal information scrambling at short time scales to dynamically select gTPS. In this way the emergent subsystems are those which maintain the longest informational identity. This strategy is made quantitative by defining a Gaussian scrambling rate in terms of the short-time expansion of an algebraic version of the Out of Time Order Correlation (OTOC) function i.e., the A -OTOC. The Gaussian scrambling rate is computed analytically for physically important cases of general division into subsystems, and is shown to have an intuitive and compelling physical interpretation in terms of minimizing the interaction strength between subsystems.
We study the question of how to decompose Hilbert space into a preferred tensor-product factorization without any preexisting structure other than a Hamiltonian operator, in particular the case of a bipartite decomposition into ``system'' and ``environment.'' Such a decomposition can be defined by looking for subsystems that exhibit quasiclassical behavior. The correct decomposition is one in which pointer states of the system are relatively robust against environmental monitoring (their entanglement with the environment does not continually and dramatically increase) and remain localized around approximately classical trajectories. We present an in-principle algorithm for finding such a decomposition by minimizing a combination of entanglement growth and internal spreading of the system. Both of these properties are related to locality in different ways. This formalism is relevant to questions in the foundations of quantum mechanics and the emergence of spacetime from quantum entanglement.
Hybrid quantum-classical workflows are expected to underpin practical quantum computing applications, yet the quantum and HPC communities lack a shared framework for reasoning about where and when their integration requirements matter most. Such a framework must separate two distinct levels of analysis: the application level, where communication overhead affects runtime performance, and the real-time level, where it determines feasibility. To address this, we introduce a runtime model that decomposes workflow execution into quantum compute, classical compute, and communication costs. At the application level, a communication-to-computation ratio from this decomposition quantifies whether a workflow is communication-bound or compute-bound; at the real-time level, a feasibility constraint determines whether timing requirements can be met at all, with the reaction time setting the logical clock speed of fault-tolerant computation once they are. Application of this model to representative workflows demonstrates that co-location of quantum processors with HPC infrastructure offers negligible performance benefit for compute-intensive applications today, while tight integration remains crucial for real-time tasks such as quantum error correction needed for large scale quantum computations. However, we discuss how even at the application level these assessments may shift with hardware evolution, illustrating how the model can identify specific crossover conditions, and how, under fault tolerance, the reaction time can set application-level performance.
The tensor-product decomposition of Hilbert space is not fixed by quantum formalism alone, so any claim that locality or subsystem structure is intrinsic requires a nontrivial selection principle. I test whether decomposition space develops reproducible preference structure under a graph-agnostic selector rewarding low Pauli support complexity, weak one-body leakage, and concentrated two-body partner structure. Two four-qubit exact controls are carried out by exhaustive evaluation over distinct 729-member gauge-fixed families: a matched line-brickwork family and a non-line matching family. In both controls, the designated structured reference--the native frame in local instances and the hidden frame in planted instances--lies far below the half-rank null, whereas scrambled references do not. I then extend the same selector to a six-qubit scalable benchmark using a graph-agnostic depth-four matching search, where local and planted references again concentrate near the bottom of the sampled family while scrambled controls return to the half-rank regime. Taken together, these results provide concrete evidence of structure selection in the decomposition families studied here. The paper does not claim uniqueness or full geometric reconstruction, but it shows that decomposition space is already internally differentiated once dynamics and operator organization are taken seriously.
A finite Hilbert space supports many inequivalent tensor-product decompositions, so any Hilbert-space-first account of locality must explain more than why a single candidate performs well in a discrete search; it must also determine whether that preference governs nearby continuous refactorizations. Earlier work in this area established three key ingredients: that decomposition space is empirically non-flat under simple support-based selectors in explicit few-qubit studies; that the physically meaningful object in exact finite searches is a quotient class rather than a uniquely labeled factorization, defined modulo local gauge transformations and subsystem permutations; and that, for exactly graph-local Hamiltonians, the associated quadratic form has a kernel precisely given by the local gauge Lie algebra under explicit visibility and genericity conditions. Building on these results, the present paper proves a local theorem showing that, in a neighborhood of the graph-local class, the static selector is quantitatively equivalent to the square of the quotient distance. As a consequence, the preferred decomposition class is a strictly isolated local minimum: small selector values enforce closeness in the quotient sense, and no sufficiently small nongauge refactorization can replicate the preferred structure. The result is intentionally local in scope. It does not assert global uniqueness, a global spectral gap, or a full reconstruction of geometry, but instead isolates the strongest quantitative statement currently supported by the available analytic framework.