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:2308.06084 · Quantum Information Processing

Generating quantum channels from functions on discrete sets

Alice C. Quillen, Nathan Skerrett

Published Feb 8, 2024• 2 citations
arXivHTMLPDF
DOI
10.1007/s11128-023-04254-0

Related papers

A model of discrete quantum computation

Laura Gatti, Jesús García López de Lacalle

Quantum Information Processing•Jun 21, 2018•10 citations

Quantifying magic resource for quantum channels via channel-state duality

Xiaohui Li, Shunlong Luo, Zijian Zhang

According to the celebrated Gottesman-Knill theorem, magic resource (nonstabilizerness) is necessary to drive universal quantum computation. Thus characterization and quantification of magic resource for quantum states and quantum channels are significant issues. In this work, we propose a method to construct quantifiers of magic resource for quantum channels from those for quantum states by employing the channel-state duality to convert quantum channels to the corresponding Choi states. We focus on a specific quantifier of magic resource based on characteristic functions (Fourier transforms) of quantum states. This quantifier is well defined for all dimensions and easy to calculate, as opposed to those defined via discrete Wigner functions. It satisfies some desirable properties and provides an upper bound to the mana (a kind of logarithmic negativity of discrete Wigner functions) of quantum channels. Using this quantity, we evaluate the amount of magic resource for some typical quantum channels and compare them with some existing quantifiers of generating-power of magic resource. For the dephasing channels in prime dimensional systems, our quantifier of magic resource essentially characterizes the average generating power of magic resource, while, for general channels, they are quite different and some challenging issues arise.

Physical Review A•May 13, 2025•5 citations

On diagonal quantum channels

Amir R. Arab

arXiv:2011.00237•Reports on Mathematical Physics•Aug 1, 2021•2 citations

Sequential transmission at short times

Bhattacharyya, Archishna

We show that it is possible to transmit and preserve information at short time scales over an n-fold composition of quantum channels $(Ξ^n)_{n \in \mathbb{N}}$ modelled as a discrete quantum Markov semigroup, long enough to generate entanglement at some finite $n$. This is achieved by interspersing the action of noise with quantum error correction in succession. We show this by means of a non-trivial lower bound on the one-shot quantum capacity in the sequential setting as a function of $n$, in an attempt to model a linear quantum network and assess its capabilities to distribute entanglement. Intriguingly, the rate of transmission of such a network turns out to be a property of the spectrum of the channels composed in sequence, and the maximum possible error in transmission can be bounded as a function of the noise model only. As an application, we derive an exact error bound for the infinite dimensional pure-loss channel believed to be the dominant source of noise in networks precluding the distribution of entanglement. We exemplify our results by analysing the amplitude damping channel and its bosonic counterpart.

arXiv:2506.10285•Jun 12, 2025•1 citation

Optimal Representation of Quantum Channels

Paulina Lewandowska, Ryszard Kukulski, Łukasz Pawela

arXiv:2002.05507•Lecture notes in computer science•Jan 1, 2020•2 citations

Quantum hypothesis testing with group structure

Zane M. Rossi, Isaac L. Chuang

The problem of discriminating between many quantum channels with certainty is analyzed under the assumption of prior knowledge of algebraic relations among possible channels. It is shown, by explicit construction of a novel family of quantum algorithms, that when the set of possible channels faithfully represents a finite subgroup of SU(2) (e.g., ${C}_{n}, {D}_{2n}, {A}_{4}, {S}_{4}, {A}_{5}$) the recently developed techniques of quantum signal processing can be modified to constitute subroutines for quantum hypothesis testing. These algorithms, for group quantum hypothesis testing, intuitively encode discrete properties of the channel set in SU(2) and improve query complexity at least quadratically in $n$, the size of the channel set and group, compared to na\"{\i}ve repetition of binary hypothesis testing. Intriguingly, performance is completely defined by explicit group homomorphisms; these in turn inform simple constraints on polynomials embedded in unitary matrices. These constructions demonstrate a flexible technique for mapping questions in quantum inference to the well-understood subfields of functional approximation and discrete algebra. Extensions to larger groups and noisy settings are discussed, as well as paths by which improved protocols for quantum hypothesis testing against structured channel sets have application in the transmission of reference frames, proofs of security in quantum cryptography, and algorithms for property testing.

arXiv:2102.02194•Physical Review A•Jul 27, 2021•7 citations
According to the celebrated Gottesman-Knill theorem, magic resource (nonstabilizerness) is necessary to drive universal quantum computation. Thus characterization and quantification of magic resource for quantum states and quantum channels are significant issues. In this work, we propose a method to construct quantifiers of magic resource for quantum channels from those for quantum states by employing the channel-state duality to convert quantum channels to the corresponding Choi states. We focus on a specific quantifier of magic resource based on characteristic functions (Fourier transforms) of quantum states. This quantifier is well defined for all dimensions and easy to calculate, as opposed to those defined via discrete Wigner functions. It satisfies some desirable properties and provides an upper bound to the mana (a kind of logarithmic negativity of discrete Wigner functions) of quantum channels. Using this quantity, we evaluate the amount of magic resource for some typical quantum channels and compare them with some existing quantifiers of generating-power of magic resource. For the dephasing channels in prime dimensional systems, our quantifier of magic resource essentially characterizes the average generating power of magic resource, while, for general channels, they are quite different and some challenging issues arise.
We show that it is possible to transmit and preserve information at short time scales over an n-fold composition of quantum channels (Ξn)n∈N(Ξ^n)_{n \in \mathbb{N}}(Ξn)n∈N​ modelled as a discrete quantum Markov semigroup, long enough to generate entanglement at some finite nnn. This is achieved by interspersing the action of noise with quantum error correction in succession. We show this by means of a non-trivial lower bound on the one-shot quantum capacity in the sequential setting as a function of nnn, in an attempt to model a linear quantum network and assess its capabilities to distribute entanglement. Intriguingly, the rate of transmission of such a network turns out to be a property of the spectrum of the channels composed in sequence, and the maximum possible error in transmission can be bounded as a function of the noise model only. As an application, we derive an exact error bound for the infinite dimensional pure-loss channel believed to be the dominant source of noise in networks precluding the distribution of entanglement. We exemplify our results by analysing the amplitude damping channel and its bosonic counterpart.
The problem of discriminating between many quantum channels with certainty is analyzed under the assumption of prior knowledge of algebraic relations among possible channels. It is shown, by explicit construction of a novel family of quantum algorithms, that when the set of possible channels faithfully represents a finite subgroup of SU(2) (e.g., Cn,D2n,A4,S4,A5{C}_{n}, {D}_{2n}, {A}_{4}, {S}_{4}, {A}_{5}Cn​,D2n​,A4​,S4​,A5​) the recently developed techniques of quantum signal processing can be modified to constitute subroutines for quantum hypothesis testing. These algorithms, for group quantum hypothesis testing, intuitively encode discrete properties of the channel set in SU(2) and improve query complexity at least quadratically in nnn, the size of the channel set and group, compared to na\"{\i}ve repetition of binary hypothesis testing. Intriguingly, performance is completely defined by explicit group homomorphisms; these in turn inform simple constraints on polynomials embedded in unitary matrices. These constructions demonstrate a flexible technique for mapping questions in quantum inference to the well-understood subfields of functional approximation and discrete algebra. Extensions to larger groups and noisy settings are discussed, as well as paths by which improved protocols for quantum hypothesis testing against structured channel sets have application in the transmission of reference frames, proofs of security in quantum cryptography, and algorithms for property testing.