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

A rational quantum channel beyond finite tracial baths

Nidhal Mghirbi, Seth Douglas

Published Oct 2, 2026• 0 citations
Publisher

Abstract

A quantum channel can always be implemented by a unitary interaction with an environment that starts in a pure state. With a finite, maximally mixed environment, the implementable channels are the noisy operations. A tracial von Neumann algebra as environment gives the factorizable channels, and by a theorem of Haagerup and Musat combined with MIP* = RE, some of these lie outside the closure of the noisy operations. Version 1.0 of this record wrote down explicit rational channels of this kind, with no value for their distance from the closure. This version gives explicit lower bounds. Using Wang and Zhi's dimension-uniform reflection estimate, it constructs a factorizable unital channel on twelve qubits with Kraus entries in {0, 1, ±3/5, 4/5}, whose normalized Choi and diamond distances from the closure are at least 2^-(2J+50), with J = 2^(2^1122000). The bound comes from a compiler theorem: group relations that are rigid uniformly in the matrix dimension give a rational channel with an explicit distance bound. For the channels of version 1.0, a new spectral certificate for the root groups of their presentation gives explicit gaps: 2^-(2J+41) for the fifteen-qubit channel and its two variants and, by the bound of version 1.0, 2^-(2J+36) in Choi distance and 2^-(2J+21) in diamond distance for the fully referenced channel. The numbers are tiny because Wang and Zhi's tolerance is 2^-J. The results depend on recent preprints of Wang and Zhi, Thom, and Alekseev, Liu and Thom, which are not yet refereed. This archive includes the paper, the channel data, the certificates, and programs that rebuild and check them; python verify_all.py ends with OK ALL.

DOI
10.5281/zenodo.23093838

Related papers

Causal quantum-channel simulation: memory beyond entropy

Seth Douglas, Nidhal Mghirbi

How much memory does it take to apply the same quantum channel many times, when each output must be released before the next input arrives and every retained qubit counts? One-use invariants do not decide it. Two explicit channels on dimension 1664 have identical normalized Choi spectra (32 eigenvalues 1/32), the same maximal complementary entropy 5, and zero asymptotic purity cost. At the same optimal exchange rate, one is implemented exactly with five memory qubits for any number of uses, while the other needs Omega(n^(1/(2 log_2(107)+2))) memory qubits for n uses, at every fixed error at most 1/16 and whatever purity is available; memory O(n^(1/3) log^(4/3) n) suffices for it. The hard channel is built from Houghton's group H_3. Behind the example is a general theory: the achievable exchange and purity rates, the purity cost kappa, which vanishes exactly on the closure of finite tracial factorizations, and memory bounds from how well a channel's environment is approximated by finite ones, and, for channels built from finite presentations, from the approximation profile of the group. Version 1.1 adds where the expensive channels lie: on the relative boundary of the closure; any fixed depolarizing admixture brings them down to polylogarithmic memory at the rank rate; on a face containing the Houghton channel a single moment of a trace on the group decides expense; and one free fermion per site already forces polynomial memory. Version 1.1.1 adds a map of what the main separation depends on (published inputs, companion results and new arguments), sets finite-budget and asymptotic-rate statements side by side, cites the companion papers at their published versions, pins the tested software versions, and makes every check refuse to run under optimized Python. The mathematical results are unchanged. Version 1.1.2 corrects attributions and makes two headline statements precise. The separation of Theorem A is stated at the exchange budget 5n/2, and the channels that need polynomial memory at every exchange rate are those with purity limited to O(log n). Credits added or corrected: Bisio, D'Ariano, Perinotti and Chiribella, and Bisio, D'Ariano, Perinotti and Sedlak; Boes et al. for the square-root dephasing construction; Lie, Son, Boes, Ng and Wilming for the exact case of the tracialization lemma; Faist, Berta and Brandao for the relation to the thermodynamic capacity; Haagerup, Musat and Rordam for the moment criteria; Thoma, Johnson, Watrous, Horodecki-Oppenheim-Winter and Lie-Jeong; Cornulier for the Baumslag-Solitar bound. Known results are moved out of numbered statements. The mathematical results and the numbering are unchanged. All operational bounds use complete-experiment error against adaptive observers with quantum references. The general rate-region achievability result uses a cited closed-device theorem; the explicit separation does not. This preprint archive includes the PDF, TeX source, finite verification scripts, and scoped Lean arithmetic proofs. The artifacts do not formally verify the entire manuscript; their scope and external dependencies are documented in verification/README.md.

•Sep 29, 2026•1 citation

Unital qubit channels are 333-noisy

Indu Bala, Preeti Parashar, Swapan Rana

The algebraic and environmental characteristics of mixed unitary quantum operations are investigated. It is established that the composition of two uniformly n-mixed unitary channels is itself n-noisy, and this n-noisy property is shown to be an invariant under unitary equivalence. Furthermore, by utilizing majorization and the divisibility of Kraus rank-four unital qubit channels, we demonstrate that any unital qubit channel can be physically simulated using a three-dimensional maximally mixed environment. Together, these results advance the classification and physical realization of noisy quantum channels.

quant-pharXiv:2611.03894•Nov 4, 2026•0 citations

On the undecidability of quantum channel capacities

Archishna Bhattacharyya, Arthur Mehta, Yuming Zhao

An important distinction in our understanding of capacities of classical versus quantum channels is marked by the following question: is there an algorithm which can compute (or even efficiently compute) the capacity? While there is overwhelming evidence suggesting that quantum channel capacities may be uncomputable, a formal proof of any such statement is elusive. We initiate the study of the hardness of computing quantum channel capacities. We show that, for a general quantum channel, it is QMA-hard to compute its quantum capacity, and that the entanglement-assisted zero-error capacity under some restrictions is uncomputable; indicative of the fact that quantum channel capacities may generally be undecidable.

quant-pharXiv:2601.22471•Feb 2, 2026•2 citations

Quantum Galois Machine: Exact Rational Dilations and Denominator Costs

Hutan Ashrafian

When a quantum operation is specified exactly, irrational amplitudes in its unitary description can disappear from its action on density matrices, leaving an operation with rational coefficients whose implementation still requires additional resources. I develop a Quantum Galois Machine that determines whether an algebraically specified quantum channel can be executed using rational matrices and a finite environment initially prepared in a computational basis state. For every unitary channel with rational coefficients, the minimum dimension of an environment that may be discarded is exactly the least number of rational squares needed to represent a positive rational parameter extracted from the channel. This gives a complete classification with possible dimensions one, two, three and four, each attained by an explicit example. The associated square class multiplies under parallel and sequential composition, so two identical operations admit a joint implementation without an environment even when one operation requires four dimensions. Returning the environment to its initial basis state or retaining a specified coherent control imposes different arithmetic obstructions. Although unrestricted approximation removes this exact environment requirement, a bound on rational denominators restores a quantitative obstruction: a nonsquare output probability with reduced denominator S forces diamond-norm error at least 2/(SB^2) when every entry denominator of an environment-free implementation is at most B. A constructive Householder approximation supplies a complementary upper bound, giving logarithmic denominator bit cost in inverse precision for each fixed channel with nonsquare parameter. These results provide finite certificates that account for the coefficient field, phase convention, auxiliary systems and numerical description size.

•Oct 29, 2026•0 citations

Greatest Quantum Channels with Prescribed Maximal Information

Harjas Sandhu

Two quantum channels can have identical information geometry while allowing different physical simulations. This paper asks whether a complete RLD information profile has a greatest realization: a channel from which every other realization of that profile can be produced by deterministic postprocessing. Equality of right logarithmic derivative (RLD) Fisher information for every faithful input, tangent and finite quantum reference determines a labelled von Neumann algebra, a normalized channel and a faithful normal state. The same equivalence relation is obtained from complete maximal f-divergences. Every finite-dimensional invariant has a greatest representative of minimum possible effective output dimension, without requiring the invariant state to be tracial. For separable trace-class outputs with a faithful normal tracial invariant state, an exact greatest member exists precisely when the algebra is a countable product of finite matrix algebras. Arbitrarily accurate greatest members within the same exact profile class exist precisely when the algebra is injective. Existence of a single sequence approximating every fixed target already implies existence of a sequence whose diamond-norm error is uniform over all targets. Spectral pinching and finite-dimensional Haar averaging connect these operational requirements to established operator-algebraic approximation theory. The paper gives diffuse binary examples, an explicit free-group class with a finite quantitative obstruction, polynomial-time exact profile comparison and polynomial-bit faithful witnesses for rational finite channels, and finite probe identification with conditioned stability. A fixed full-support family shows that capacity optimized over an exact profile class can be discontinuous even while every physical channel in the family is antidegradable and has zero quantum capacity. The infinite-output classification requires the stated tracial hypothesis. It supplies neither an effective general filtration nor an experimental convergence rate. The atomic/injective distinction, reverse-test and sufficiency theory, amenability machinery and finite identification methods are credited to their primary sources. RLD-profile equality is distinct from the SLD, Umegaki and Holevo comparison problems studied in Complete information orders of quantum channels: equivalence and undecidability.

•Nov 6, 2026•0 citations

No algorithm can tell how much memory a repeated quantum channel needs

Seth Douglas, Nidhal Mghirbi

A device that applies a quantum channel over and over must release each output before the next input arrives. How much memory does it need? Suppose every fresh qubit the device receives is maximally mixed. In companion work we showed that the answer then turns on one set: the channels that a unitary with a finite, maximally mixed bath implements, exactly or in the limit. A channel in this set with a flat probe, an input that leaves its environment maximally mixed, can be served with sublinear memory. A channel outside the set needs linear memory at small error, however many qubits the device exchanges. No algorithm can decide on which side of this line a channel lies. A computable map sends each program to an explicit Schur channel with Gaussian-rational entries. If the program halts, logarithmic memory suffices; if it runs forever, linear memory is needed at an error computed from the program. The same line recasts Connes' embedding problem. It has a positive answer exactly when every factorizable channel with a flat probe can be served with sublinear memory; Schur channels already suffice. Just past the line, the cost switches on at the statistical scale. Take the qutrit Werner-Holevo family at distance h/sqrt(n) beyond its boundary point. Independent uses of the boundary channel imitate it with error tending to 2 Phi(h/(2 sigma)) - 1, where Phi is the standard normal distribution function and sigma = 5 sqrt(2)/27. We prove that no device drawing on purity that grows more slowly than sqrt(n) does better, whatever its memory. This archive includes the paper, its LaTeX source, an exact certificate and the finite numerical checks; they support but do not replace the proofs.

•Oct 7, 2026•0 citations
A quantum channel can always be implemented by a unitary interaction with an environment that starts in a pure state. With a finite, maximally mixed environment, the implementable channels are the noisy operations. A tracial von Neumann algebra as environment gives the factorizable channels, and by a theorem of Haagerup and Musat combined with MIP* = RE, some of these lie outside the closure of the noisy operations. Version 1.0 of this record wrote down explicit rational channels of this kind, with no value for their distance from the closure. This version gives explicit lower bounds. Using Wang and Zhi's dimension-uniform reflection estimate, it constructs a factorizable unital channel on twelve qubits with Kraus entries in {0, 1, ±3/5, 4/5}, whose normalized Choi and diamond distances from the closure are at least 2^-(2J+50), with J = 2^(2^1122000). The bound comes from a compiler theorem: group relations that are rigid uniformly in the matrix dimension give a rational channel with an explicit distance bound. For the channels of version 1.0, a new spectral certificate for the root groups of their presentation gives explicit gaps: 2^-(2J+41) for the fifteen-qubit channel and its two variants and, by the bound of version 1.0, 2^-(2J+36) in Choi distance and 2^-(2J+21) in diamond distance for the fully referenced channel. The numbers are tiny because Wang and Zhi's tolerance is 2^-J. The results depend on recent preprints of Wang and Zhi, Thom, and Alekseev, Liu and Thom, which are not yet refereed. This archive includes the paper, the channel data, the certificates, and programs that rebuild and check them; python verify_all.py ends with OK ALL.
How much memory does it take to apply the same quantum channel many times, when each output must be released before the next input arrives and every retained qubit counts? One-use invariants do not decide it. Two explicit channels on dimension 1664 have identical normalized Choi spectra (32 eigenvalues 1/32), the same maximal complementary entropy 5, and zero asymptotic purity cost. At the same optimal exchange rate, one is implemented exactly with five memory qubits for any number of uses, while the other needs Omega(n^(1/(2 log_2(107)+2))) memory qubits for n uses, at every fixed error at most 1/16 and whatever purity is available; memory O(n^(1/3) log^(4/3) n) suffices for it. The hard channel is built from Houghton's group H_3. Behind the example is a general theory: the achievable exchange and purity rates, the purity cost kappa, which vanishes exactly on the closure of finite tracial factorizations, and memory bounds from how well a channel's environment is approximated by finite ones, and, for channels built from finite presentations, from the approximation profile of the group. Version 1.1 adds where the expensive channels lie: on the relative boundary of the closure; any fixed depolarizing admixture brings them down to polylogarithmic memory at the rank rate; on a face containing the Houghton channel a single moment of a trace on the group decides expense; and one free fermion per site already forces polynomial memory. Version 1.1.1 adds a map of what the main separation depends on (published inputs, companion results and new arguments), sets finite-budget and asymptotic-rate statements side by side, cites the companion papers at their published versions, pins the tested software versions, and makes every check refuse to run under optimized Python. The mathematical results are unchanged. Version 1.1.2 corrects attributions and makes two headline statements precise. The separation of Theorem A is stated at the exchange budget 5n/2, and the channels that need polynomial memory at every exchange rate are those with purity limited to O(log n). Credits added or corrected: Bisio, D'Ariano, Perinotti and Chiribella, and Bisio, D'Ariano, Perinotti and Sedlak; Boes et al. for the square-root dephasing construction; Lie, Son, Boes, Ng and Wilming for the exact case of the tracialization lemma; Faist, Berta and Brandao for the relation to the thermodynamic capacity; Haagerup, Musat and Rordam for the moment criteria; Thoma, Johnson, Watrous, Horodecki-Oppenheim-Winter and Lie-Jeong; Cornulier for the Baumslag-Solitar bound. Known results are moved out of numbered statements. The mathematical results and the numbering are unchanged. All operational bounds use complete-experiment error against adaptive observers with quantum references. The general rate-region achievability result uses a cited closed-device theorem; the explicit separation does not. This preprint archive includes the PDF, TeX source, finite verification scripts, and scoped Lean arithmetic proofs. The artifacts do not formally verify the entire manuscript; their scope and external dependencies are documented in verification/README.md.
The algebraic and environmental characteristics of mixed unitary quantum operations are investigated. It is established that the composition of two uniformly n-mixed unitary channels is itself n-noisy, and this n-noisy property is shown to be an invariant under unitary equivalence. Furthermore, by utilizing majorization and the divisibility of Kraus rank-four unital qubit channels, we demonstrate that any unital qubit channel can be physically simulated using a three-dimensional maximally mixed environment. Together, these results advance the classification and physical realization of noisy quantum channels.
An important distinction in our understanding of capacities of classical versus quantum channels is marked by the following question: is there an algorithm which can compute (or even efficiently compute) the capacity? While there is overwhelming evidence suggesting that quantum channel capacities may be uncomputable, a formal proof of any such statement is elusive. We initiate the study of the hardness of computing quantum channel capacities. We show that, for a general quantum channel, it is QMA-hard to compute its quantum capacity, and that the entanglement-assisted zero-error capacity under some restrictions is uncomputable; indicative of the fact that quantum channel capacities may generally be undecidable.
When a quantum operation is specified exactly, irrational amplitudes in its unitary description can disappear from its action on density matrices, leaving an operation with rational coefficients whose implementation still requires additional resources. I develop a Quantum Galois Machine that determines whether an algebraically specified quantum channel can be executed using rational matrices and a finite environment initially prepared in a computational basis state. For every unitary channel with rational coefficients, the minimum dimension of an environment that may be discarded is exactly the least number of rational squares needed to represent a positive rational parameter extracted from the channel. This gives a complete classification with possible dimensions one, two, three and four, each attained by an explicit example. The associated square class multiplies under parallel and sequential composition, so two identical operations admit a joint implementation without an environment even when one operation requires four dimensions. Returning the environment to its initial basis state or retaining a specified coherent control imposes different arithmetic obstructions. Although unrestricted approximation removes this exact environment requirement, a bound on rational denominators restores a quantitative obstruction: a nonsquare output probability with reduced denominator S forces diamond-norm error at least 2/(SB^2) when every entry denominator of an environment-free implementation is at most B. A constructive Householder approximation supplies a complementary upper bound, giving logarithmic denominator bit cost in inverse precision for each fixed channel with nonsquare parameter. These results provide finite certificates that account for the coefficient field, phase convention, auxiliary systems and numerical description size.
Two quantum channels can have identical information geometry while allowing different physical simulations. This paper asks whether a complete RLD information profile has a greatest realization: a channel from which every other realization of that profile can be produced by deterministic postprocessing. Equality of right logarithmic derivative (RLD) Fisher information for every faithful input, tangent and finite quantum reference determines a labelled von Neumann algebra, a normalized channel and a faithful normal state. The same equivalence relation is obtained from complete maximal f-divergences. Every finite-dimensional invariant has a greatest representative of minimum possible effective output dimension, without requiring the invariant state to be tracial. For separable trace-class outputs with a faithful normal tracial invariant state, an exact greatest member exists precisely when the algebra is a countable product of finite matrix algebras. Arbitrarily accurate greatest members within the same exact profile class exist precisely when the algebra is injective. Existence of a single sequence approximating every fixed target already implies existence of a sequence whose diamond-norm error is uniform over all targets. Spectral pinching and finite-dimensional Haar averaging connect these operational requirements to established operator-algebraic approximation theory. The paper gives diffuse binary examples, an explicit free-group class with a finite quantitative obstruction, polynomial-time exact profile comparison and polynomial-bit faithful witnesses for rational finite channels, and finite probe identification with conditioned stability. A fixed full-support family shows that capacity optimized over an exact profile class can be discontinuous even while every physical channel in the family is antidegradable and has zero quantum capacity. The infinite-output classification requires the stated tracial hypothesis. It supplies neither an effective general filtration nor an experimental convergence rate. The atomic/injective distinction, reverse-test and sufficiency theory, amenability machinery and finite identification methods are credited to their primary sources. RLD-profile equality is distinct from the SLD, Umegaki and Holevo comparison problems studied in Complete information orders of quantum channels: equivalence and undecidability.
A device that applies a quantum channel over and over must release each output before the next input arrives. How much memory does it need? Suppose every fresh qubit the device receives is maximally mixed. In companion work we showed that the answer then turns on one set: the channels that a unitary with a finite, maximally mixed bath implements, exactly or in the limit. A channel in this set with a flat probe, an input that leaves its environment maximally mixed, can be served with sublinear memory. A channel outside the set needs linear memory at small error, however many qubits the device exchanges. No algorithm can decide on which side of this line a channel lies. A computable map sends each program to an explicit Schur channel with Gaussian-rational entries. If the program halts, logarithmic memory suffices; if it runs forever, linear memory is needed at an error computed from the program. The same line recasts Connes' embedding problem. It has a positive answer exactly when every factorizable channel with a flat probe can be served with sublinear memory; Schur channels already suffice. Just past the line, the cost switches on at the statistical scale. Take the qutrit Werner-Holevo family at distance h/sqrt(n) beyond its boundary point. Independent uses of the boundary channel imitate it with error tending to 2 Phi(h/(2 sigma)) - 1, where Phi is the standard normal distribution function and sigma = 5 sqrt(2)/27. We prove that no device drawing on purity that grows more slowly than sqrt(n) does better, whatever its memory. This archive includes the paper, its LaTeX source, an exact certificate and the finite numerical checks; they support but do not replace the proofs.