Differential privacy provides a mathematical framework for guaranteeing privacy for sensitive data. In quantum information processing, the interaction of privacy constraints with quantum resources such as entanglement remains a question of interest. Given that the utility of many protocols, and often the presence of a quantum advantage, relies on quantum resources such as entanglement, it is crucial to understand when a privacy requirement for a quantum channel is compatible with the channel’s ability to preserve entanglement. We study this question for quantum local differential privacy (QLDP). Our main result shows that every ε-QLDP channel with a d-dimensional input is entanglement-breaking whenever ε≤logdd−1. We also prove an approximate version for (ε,δ)-QLDP, where channels in the same high-privacy regime are close in diamond norm to an entanglement-breaking channel. We further prove a composition result for a collection of private quantum channels having entangled inputs and global measurements in the high-privacy regime. Finally, we apply our results to private quantum learning theory. We prove that any learning protocol using arbitrary quantum memory on copies of the output of an entanglement-breaking channel can be simulated by a protocol that measures the corresponding unprocessed input copies one at a time while storing only classical information. Combining this result with our high-privacy entanglement-breaking theorem, we show that under sufficiently private local noise, a learning protocol with quantum memory for purity testing and bipartite product testing is subject to the sample complexity lower bounds for protocols with single-copy measurements on the noiseless tasks. We also obtain stronger sample complexity lower bounds when a single highly private channel acts on the entire multipartite input.
@article{bhalerao2026high,author={Bhalerao, Sujeet and Nuradha, Theshani and Leditzky, Felix},title={High quantum local differential privacy breaks entanglement},journal={arXiv preprint},year={2026},month=sep,url={https://arxiv.org/abs/2609.13418},archiveprefix={arXiv},primaryclass={quant-ph}}
IEEE ToIT
Improving quantum communication rates with permutation-invariant codes
In this work we improve the quantum communication rates of various quantum channels of interest using permutation-invariant quantum codes. We focus in particular on parametrized families of quantum channels and aim to improve bounds on their quantum capacity threshold, defined as the lowest noise level at which the quantum capacity of the channel family vanishes. These thresholds are important quantities as they mark the noise level up to which faithful quantum communication is theoretically possible. Our method exploits the fact that independent and identically distributed quantum channels preserve any permutation symmetry present at the input. The resulting symmetric output states can be described succinctly using the representation theory of the symmetric and general linear groups, which we use to derive an efficient algorithm for computing the channel coherent information of a permutation-invariant code. Our approach allows us to evaluate coherent information values for a large number of channel copies, e.g., at least 100 channel copies for qubit channels. We apply this method to various physically relevant channel models, including general Pauli channels, the dephrasure channel, the generalized amplitude damping channel, and the damping-dephasing channel. For each channel family we obtain improved lower bounds on their quantum capacities. For example, for the 2-Pauli and BB84 channel families we significantly improve the best known quantum capacity thresholds derived in [Fern, Whaley 2008]. These threshold improvements are achieved using a repetition code-like input state with non-orthogonal code states, which we further analyze in our representation-theoretic framework.
@article{bhalerao2025improving,author={Bhalerao, Sujeet and Leditzky, Felix},title={Improving quantum communication rates with permutation-invariant codes},journal={IEEE Transactions on Information Theory},year={2026},month=sep,doi={10.1109/TIT.2026.3730244},archiveprefix={arXiv},primaryclass={quant-ph},}
arXiv
Tight Universal Bounds on Quantum Data Hiding with Multipartite Werner States
Quantum data hiding concerns pairs of states which are highly distinguishable with global measurements, yet nearly indistinguishable when restricted to local operations and classical communication. More than two decades after Eggeling and Werner introduced a multipartite hiding scheme based on Werner states, the optimal dependence of its uniform security guarantee on the number of parties and local dimension remained unknown. We resolve this problem by showing that the distinguishing bias of any pair of n-qudit Werner states is O(n2/d) under measurements whose effects remain positive under partial transposition (PPT) across every bipartition. An explicit pair attains this scaling using only nonadaptive local measurements, establishing worst-case optimality and showing that the PPT relaxation preserves the optimal dependence on both the number of parties and the local dimension. At fixed security, this extends the certified hiding regime from n=O(d1/4) to n=O(d−−√). Beyond data hiding, the same bound implies that testing any nontrivial unitarily invariant property with adaptive single-copy measurements requires Ω(d−−√) copies, yielding separations for any property with dimension-independent sample complexity under collective measurements. Our proof reduces the distinguishing bias to trace norms of partially transposed operators and analyzes them using mixed Schur-Weyl duality, demonstrating the utility of representation theoretic methods developed for port-based teleportation to data hiding and quantum property testing.
@article{akresh2026tight,author={Akresh, Oren and Beckey, Jacob and Leditzky, Felix},title={Tight Universal Bounds on Quantum Data Hiding with Multipartite Werner States},journal={arXiv preprint},year={2026},month=sep,url={https://arxiv.org/abs/2609.40332},archiveprefix={arXiv},primaryclass={quant-ph}}
arXiv
Compatibility of quantum instruments
Chloe Kim, Yujie Zhang, Eric Chitambar, and 2 more authors
Measurement compatibility asks whether a family of quantum measurements can be simulated by one parent measurement followed by classical post-processing. We extend this measurement compatibility to the notion of d-compatibility for measurements, channels, and instruments whose parent passes a d-dimensional quantum system and unlimited classical information to the post-processing. We formulate d-compatibility as a common linear factorization of operator spaces and operator systems and show that d-compatible families form a closed set, even with infinitely many settings and a separable infinite-dimensional input. To certify d-incompatibility, we define the compatibility functional as the smallest product of completely bounded norms over common factorizations through a d-dimensional register. Using factorization theory of operator spaces, we show that measure-and-prepare channels defined in terms of mutually unbiased bases and pinching channels defined in terms of Heisenberg-Weyl operators are d-incompatible in certain regimes of d. We also link d-compatibility of multi-instruments to the preparability of Choi assemblages using channel-state duality, and use this connection to show that for bipartite states the (in)compatibility of instruments can be used to certify Schmidt numbers and the implementability of the instrument using one-way LOCC protocols. Finally, our compatibility functional also bounds the generalized robustness of compatibility, which we interpret through a memory-bounded nontransient preparation game.
@article{kim2026compatibility,author={Kim, Chloe and Zhang, Yujie and Chitambar, Eric and Junge, Marius and Leditzky, Felix},title={Compatibility of quantum instruments},journal={arXiv preprint},year={2026},month=sep,url={https://arxiv.org/abs/2609.40266},archiveprefix={arXiv},primaryclass={quant-ph}}
arXiv
Randomness of exact unitary designs under symmetry
We define the unitary design strength of a finite unitary ensemble to be the maximal integer t for which its t-th statistical moment is identical to that of the unitary group. In the presence of physical symmetry, not all operators of an ensemble are symmetry-compatible. This motivates us to define the symmetric design strength of a finite unitary ensemble to be the maximal integer t for which the t-th moments of its symmetry-compatible sub-ensemble match those of the group of symmetry-compatible unitaries. We show that in sufficiently high dimension and for a broad family of symmetries, which includes the global on-site U(1) and SU(d) symmetries, there exist finite unitary ensembles of arbitrarily high design strength whose symmetric design strength is strictly higher. Ensembles with this property may be more versatile under symmetry constraints for protocols that rely on unitary randomization than they are without symmetry. Our results extend the previous work [Mitsuhashi and Yoshioka, PRX Quantum 4.4 (Nov. 2023)] showing that the symmetric design strength of the Clifford group is strictly upper bounded by its unitary design strength for symmetries that do not trivialize the symmetry-compatible unitaries. Due to the special significance of unitary designs with a group structure, we also derive a variety of bounds on the unitary and symmetric design strengths of finite unitary ensembles whose operators form a group. In particular, we provide a simple proof that an arbitrary ensemble of operators forming a finite group must have a symmetric design strength of at most two under the global on-site U(1) and SU(d) symmetries. Along the way, we show that there exist uniformly weighted groups of arbitrarily high symmetric design strength in arbitrary dimension and analyze their structure.
@article{vairogs2026randomness,author={Vairogs, Christopher and Leditzky, Felix},title={Randomness of exact unitary designs under symmetry},journal={arXiv preprint},year={2026},month=sep,url={https://arxiv.org/abs/2609.40227},archiveprefix={arXiv},primaryclass={quant-ph}}
arXiv
A mixing time method for estimating the sample complexity of quantum state discrimination
We develop a mixing time method for estimating the sample complexity of quantum state discrimination. We start with considering the minimum-error discrimination of geometrically uniform pure state ensembles, and prove that its sample complexity has a tight estimate given by a quantum homogeneous mixing time [George et al., 2026] and a quantum version of the generalized Dobrushin coefficient [Wolfer, 2020]. This quantum mixing time further reduces to a classical one when the generating group G forms a Gelfand pair with the stabilizer subgroup H of the generator state. In this case the generalized Dobrushin coefficient can be fully expressed by representation-theoretic quantities of the commutative Hecke algebra EndG(C[G/H]). In particular, this method reduces the sample complexity estimation of learning quantum coupon collector states [Arunachalam et al., 2020] and learning phase states to classical mixing time problems. We apply this framework to answer the open problems of learning degree-d phase states over Fq in [Alrabiah et al., 2026] and generalized Boolean phase states over Zq [Arunachalam et al., 2023]. The framework also applies to hypergraph state ensembles, giving estimates expressed fully in terms of hypergraph data and recovering estimates for graph state ensembles in [Montanaro and Shao, 2022]. Finally, we extend the discussion to arbitrary mixed state ensembles with uniform priors, prove a sandwiched bound for minimum-error discrimination sample complexity by a quantum weakly mixing time, and provide a tight estimate for the minimax discrimination sample complexity from [D’Ariano et al., 2005] by a Dobrushin-type coefficient. We also discuss the method of strengthened data processing inequality [Gao and Rouzé, 2022] and give an upper bound in terms of a strengthened data processing inequality constant.
@article{zhou2026mixing,author={Zhou, Juntai and Leditzky, Felix},title={A mixing time method for estimating the sample complexity of quantum state discrimination},journal={arXiv preprint},year={2026},month=sep,url={https://arxiv.org/abs/2609.40182},archiveprefix={arXiv},primaryclass={quant-ph}}
arXiv
A depolarizing choir sings in Gaussian harmony
Rabsan Galib Ahmed, Sujeet Bhalerao, Sungjai Lee, and 4 more authors
We study the noise threshold for positive quantum capacity for the qubit depolarizing channel. We explore analytically the action of the qubit depolarizing channel on the symmetric subspaces of the input qubits, in the limit of asymptotically many uses of the channel. We observe the emergence of a bosonic Gaussian channel. Furthermore, the codes previously developed for the depolarizing channel can be translated to codes for the emergent Gaussian channel, and it is easier to further optimize these codes for the simpler emergent Gaussian channel. Translating these codes back to the depolarizing channel leads to extremely good input states for the coherent information of the depolarizing channel producing new lower bounds on the noise threshold for positive capacity. In addition to improved lower bounds on the threshold, this newly found link between depolarizing noise and Gaussian channels offers a novel perspective contributing to our understanding of these symmetric codes.
@article{ahmed2026depolarizing,author={Ahmed, Rabsan Galib and Bhalerao, Sujeet and Lee, Sungjai and Leditzky, Felix and Leung, Debbie and Schaeffer, Luke and Smith, Graeme},title={A depolarizing choir sings in Gaussian harmony},journal={arXiv preprint},year={2026},month=sep,url={https://arxiv.org/abs/2609.39747},archiveprefix={arXiv},primaryclass={quant-ph},}
Quantum
An Operational Framework for Nonclassicality in Quantum Communication Networks
Brian Doolittle, Felix Leditzky, and Eric Chitambar
@article{doolittle2026nonclassical,author={Doolittle, Brian and Leditzky, Felix and Chitambar, Eric},title={An {O}perational {F}ramework for {N}onclassicality in {Q}uantum {C}ommunication {N}etworks},journal={{Quantum}},year={2026},volume={10},month=apr,pages={2052},issn={2521-327X},doi={10.22331/q-2026-04-08-2052},url={https://doi.org/10.22331/q-2026-04-08-2052},archiveprefix={arXiv},primaryclass={quant-ph},publisher={{Verein zur F{\"{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}}}
IEEE ToIT
Capacities of Entanglement Distribution From a Central Source
Xinan Chen, Stefano Chessa, Ian George, and 2 more authors
@article{chen2026capacities,author={Chen, Xinan and Chessa, Stefano and George, Ian and Leditzky, Felix and Chitambar, Eric},title={Capacities of Entanglement Distribution From a Central Source},journal={IEEE Transactions on Information Theory},year={2026},volume={72},number={6},month=apr,pages={4001-4011},archiveprefix={arXiv},primaryclass={quant-ph}}
NJP
A resource theory of asynchronous quantum information processing
@article{kim2026resourcetheory,author={Kim, Chloe and Chitambar, Eric and Leditzky, Felix},title={A resource theory of asynchronous quantum information processing},journal={New Journal of Physics},year={2026},volume={28},number={3},month=mar,pages={034512},doi={10.1088/1367-2630/ae49b7},archiveprefix={arXiv},primaryclass={quant-ph},publisher={IOP Publishing}}
arXiv
Privacy-Utility Tradeoffs in Quantum Information Processing
Theshani Nuradha, Sujeet Bhalerao, and Felix Leditzky
@article{nuradha2026privacy,author={Nuradha, Theshani and Bhalerao, Sujeet and Leditzky, Felix},title={Privacy-Utility Tradeoffs in Quantum Information Processing},journal={arXiv preprint},year={2026},month=feb,archiveprefix={arXiv},primaryclass={quant-ph}}
Quantum
Localizing multipartite entanglement with local and global measurements
Christopher Vairogs, Samihr Hermes, and Felix Leditzky
@article{vairogs2026localizing,author={Vairogs, Christopher and Hermes, Samihr and Leditzky, Felix},title={Localizing multipartite entanglement with local and global measurements},journal={{Quantum}},year={2026},volume={10},month=feb,pages={2007},issn={2521-327X},doi={10.22331/q-2026-02-23-2007},url={https://doi.org/10.22331/q-2026-02-23-2007},archiveprefix={arXiv},day={23},primaryclass={quant-ph},publisher={{Verein zur F{\"{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}}}
CMP
Approximate Unitary k-Designs from Shallow, Low-Communication Circuits
Random unitaries are useful in quantum information and related fields, but hard to generate with limited resources. An approximate unitary k-design is an ensemble of unitaries with an underlying measure over which the average is close to a Haar random ensemble up to the first k moments. A particularly strong notion of approximation bounds the distance from Haar randomness in relative error. Such relative-error approximate designs are secure against queries by an adaptive adversary trying to distinguish it from a Haar ensemble. We construct relative-error approximate unitary k-design ensembles for which communication between subsystems is O(1) in the system size. These constructions use the alternating projection method to analyze overlapping Haar averages, giving a bound on the convergence speed to the full averaging with respect to the 2-norm. Using von Neumann subalgebra indices to replace system dimension, the 2-norm distance converts to relative error without introducing any additional dimension dependence. We use these constructions as the building blocks of a two-step protocol that achieves a relative-error design in O((logm+log(1/ϵ)+klogk)kpolylog(k)) depth, where m is the number of qudits in the complete system and ϵ the approximation error. This sublinear depth construction answers a variant of [Harrow and Mehraban 2023, Section 1.5, Open Questions 1 and 7]. Moreover, entanglement generated by the sublinear depth scheme follows area laws on spatial lattices up to corrections logarithmic in the full system size.
@article{laracuente2026approximate,author={LaRacuente, Nicholas and Leditzky, Felix},title={Approximate Unitary k-Designs from Shallow, Low-Communication Circuits},journal={Communications in Mathematical Physics},year={2026},volume={407},number={3},month=feb,pages={51},issn={1432-0916},doi={10.1007/s00220-025-05542-9},url={https://doi.org/10.1007/s00220-025-05542-9},archiveprefix={arXiv},day={5},primaryclass={quant-ph},}
2025
arXiv
Product testing with single-copy measurements
Jacob Beckey, Luke Coffman, Ariel Shlosberg, and 2 more authors
@article{beckey2025product,author={Beckey, Jacob and Coffman, Luke and Shlosberg, Ariel and Schatzki, Louis and Leditzky, Felix},title={Product testing with single-copy measurements},journal={arXiv preprint},year={2025},month=oct,url={https://arxiv.org/abs/2510.07820},archiveprefix={arXiv},primaryclass={quant-ph}}
JPhysA
On the distinguishability of geometrically uniform quantum states
Juntai Zhou, Stefano Chessa, Eric Chitambar, and 1 more author
Journal of Physics A: Mathematical and Theoretical, Oct 2025
@article{zhou2025geometricallyuniform,author={Zhou, Juntai and Chessa, Stefano and Chitambar, Eric and Leditzky, Felix},title={On the distinguishability of geometrically uniform quantum states},journal={Journal of Physics A: Mathematical and Theoretical},year={2025},volume={58},number={41},month=oct,pages={415303},doi={10.1088/1751-8121/ae0a95},url={https://doi.org/10.1088/1751-8121/ae0a95},archiveprefix={arXiv},primaryclass={quant-ph},publisher={IOP Publishing}}
JPhysA
Multivariate Fidelities
Theshani Nuradha, Hemant K. Mishra, Felix Leditzky, and 1 more author
Journal of Physics A: Mathematical and Theoretical, Apr 2025
@article{nuradha2024multivariate,author={Nuradha, Theshani and Mishra, Hemant K. and Leditzky, Felix and Wilde, Mark M.},title={Multivariate Fidelities},journal={Journal of Physics A: Mathematical and Theoretical},year={2025},volume={58},number={16},month=apr,pages={165304},doi={10.1088/1751-8121/adc645},url={https://dx.doi.org/10.1088/1751-8121/adc645},archiveprefix={arXiv},primaryclass={quant-ph},publisher={IOP Publishing}}
ITCS
Approximate Unitary k-Designs from Shallow, Low-Communication Circuits
Nicholas LaRacuente and Felix Leditzky
In 16th Innovations in Theoretical Computer Science Conference (ITCS 2025), Jan 2025
Quantum teleportation is a quantum communication primitive that allows a long-distance quantum channel to be built using pre-shared entanglement and one-way classical communication. However, the quality of the established channel crucially depends on the quality of the pre-shared entanglement. In this work, we revisit the problem of using noisy entanglement for the task of teleportation. We first show how this problem can be rephrased as a state discrimination problem. In this picture, a quantitative duality between teleportation and dense coding emerges in which every Alice-to-Bob teleportation protocol can be repurposed as a Bob-to-Alice dense coding protocol, and the quality of each protocol can be measured by the success probability in the same state discrimination problem. One of our main results provides a complete characterization of the states that offer no advantage in one-way teleportation protocols over classical states, thereby offering a new and intriguing perspective on the long-standing open problem of identifying such states. This also yields a new proof of the known fact that bound entangled states cannot exceed the classical teleportation threshold. Moreover, our established duality between teleportation and dense coding can be used to show that the exact same states are unable to provide a non-classical advantage for dense coding as well. We also discuss the duality from a communication capacity point of view, deriving upper and lower bounds on the accessible information of a dense coding protocol in terms of the fidelity of its associated teleportation protocol. A corollary of this discussion is a simple proof of the previously established fact that bound entangled states do not provide any advantage in dense coding.
@article{chitambar2024teleportation,author={Chitambar, Eric and Leditzky, Felix},title={On the Duality of Teleportation and Dense Coding},journal={IEEE Transactions on Information Theory},year={2024},volume={70},number={5},month=may,pages={3529-3537},doi={10.1109/TIT.2023.3331821},archiveprefix={arXiv},primaryclass={quant-ph},}
CMP
Probing Multipartite Entanglement Through Persistent Homology
@article{hamilton2024probing,author={Hamilton, Gregory A. and Leditzky, Felix},title={Probing Multipartite Entanglement Through Persistent Homology},journal={Communications in Mathematical Physics},year={2024},volume={405},number={5},month=may,pages={125},issn={1432-0916},doi={10.1007/s00220-024-04953-4},archiveprefix={arXiv},primaryclass={quant-ph}}
2023
IEEE ToIT
On the Separation of Correlation-Assisted Sum Capacities of Multiple Access Channels
Akshay Seshadri, Felix Leditzky, Vikesh Siddhu, and 1 more author
@article{seshadri2023separation,author={Seshadri, Akshay and Leditzky, Felix and Siddhu, Vikesh and Smith, Graeme},title={On the Separation of Correlation-Assisted Sum Capacities of Multiple Access Channels},journal={IEEE Transactions on Information Theory},year={2023},volume={69},number={9},month=sep,pages={5805-5844},doi={10.1109/TIT.2023.3274434},archiveprefix={arXiv},day={30},primaryclass={cs.IT}}
IEEE ToIT
The Platypus of the Quantum Channel Zoo
Felix Leditzky, Debbie Leung, Vikesh Siddhu, and 2 more authors
@article{leditzky2023platypus,author={Leditzky, Felix and Leung, Debbie and Siddhu, Vikesh and Smith, Graeme and Smolin, John A.},title={The Platypus of the Quantum Channel Zoo},journal={IEEE Transactions on Information Theory},year={2023},volume={69},number={6},month=jun,pages={3825-3849},doi={10.1109/TIT.2023.3245985},archiveprefix={arXiv},primaryclass={quant-ph}}
PRL
Generic Nonadditivity of Quantum Capacity in Simple Channels
Felix Leditzky, Debbie Leung, Vikesh Siddhu, and 2 more authors
@article{leditzky2023generic,author={Leditzky, Felix and Leung, Debbie and Siddhu, Vikesh and Smith, Graeme and Smolin, John A.},title={Generic Nonadditivity of Quantum Capacity in Simple Channels},journal={Physical Review Letters},year={2023},volume={130},issue={20},month=may,pages={200801},doi={10.1103/PhysRevLett.130.200801},url={https://link.aps.org/doi/10.1103/PhysRevLett.130.200801},archiveprefix={arXiv},numpages={8},primaryclass={quant-ph},publisher={American Physical Society}}
Quantum
Adaptive estimation of quantum observables
Ariel Shlosberg, Andrew J. Jena, Priyanka Mukhopadhyay, and 3 more authors
@article{shlosberg2023adaptive,author={Shlosberg, Ariel and Jena, Andrew J. and Mukhopadhyay, Priyanka and Haase, Jan F. and Leditzky, Felix and Dellantonio, Luca},title={Adaptive estimation of quantum observables},journal={{Quantum}},year={2023},volume={7},month=jan,pages={906},issn={2521-327X},doi={10.22331/q-2023-01-26-906},url={https://doi.org/10.22331/q-2023-01-26-906},archiveprefix={arXiv},primaryclass={quant-ph},publisher={{Verein zur F{\"{o}}rderung des Open Access Publizierens in den Quantenwissenschaften}}}
IEEE ToIT
Bounding Quantum Capacities via Partial Orders and Complementarity
@article{hirche2023bounding,author={Hirche, Christoph and Leditzky, Felix},title={Bounding Quantum Capacities via Partial Orders and Complementarity},journal={IEEE Transactions on Information Theory},year={2023},volume={69},number={1},month=jan,pages={283-297},doi={10.1109/TIT.2022.3199578},archiveprefix={arXiv},primaryclass={quant-ph}}
2022
LMP
Optimality of the pretty good measurement for port-based teleportation
@article{leditzky2022pgm,author={Leditzky, Felix},title={Optimality of the pretty good measurement for port-based teleportation},journal={Letters in Mathematical Physics},year={2022},volume={112},number={5},month=sep,pages={98},issn={1573-0530},doi={10.1007/s11005-022-01592-5},archiveprefix={arXiv},primaryclass={quant-ph}}
2021
IEEE ToIT
Upper bounds on device-independent quantum key distribution rates and a revised Peres conjecture
@article{arnonfriedman2021upper,author={Arnon-Friedman, Rotem and Leditzky, Felix},title={Upper bounds on device-independent quantum key distribution rates and a revised Peres conjecture},journal={IEEE Transactions on Information Theory},year={2021},volume={67},number={10},month=oct,pages={6606--6618},doi={10.1109/TIT.2021.3086505},archiveprefix={arXiv},primaryclass={quant-ph}}
PRL
Efficient and Low-Backaction Quantum Measurement Using a Chip-Scale Detector
Eric I. Rosenthal, Christian M. F. Schneider, Maxime Malnou, and 13 more authors
@article{rosenthal2021efficient,author={Rosenthal, Eric I. and Schneider, Christian M. F. and Malnou, Maxime and Zhao, Ziyi and Leditzky, Felix and Chapman, Benjamin J. and Wustmann, Waltraut and Ma, Xizheng and Palken, Daniel A. and Zanner, Maximilian F. and Vale, Leila R. and Hilton, Gene C. and Gao, Jiansong and Smith, Graeme and Kirchmair, Gerhard and Lehnert, K. W.},title={Efficient and Low-Backaction Quantum Measurement Using a Chip-Scale Detector},journal={Physical Review Letters},year={2021},volume={126},issue={9},month=mar,pages={090503},doi={10.1103/PhysRevLett.126.090503},url={https://link.aps.org/doi/10.1103/PhysRevLett.126.090503},archiveprefix={arXiv},numpages={8},primaryclass={quant-ph},publisher={American Physical Society}}
@article{bausch2021error,author={Bausch, Johannes and Leditzky, Felix},title={Error Thresholds for Arbitrary Pauli Noise},journal={SIAM Journal on Computing},year={2021},volume={50},number={4},month=jan,pages={1410-1460},doi={10.1137/20M1337375},archiveprefix={arXiv},primaryclass={quant-ph}}
CMP
Asymptotic Performance of Port-Based Teleportation
Matthias Christandl, Felix Leditzky, Christian Majenz, and 3 more authors
@article{christandl2021asymptotic,author={Christandl, Matthias and Leditzky, Felix and Majenz, Christian and Smith, Graeme and Speelman, Florian and Walter, Michael},title={Asymptotic Performance of Port-Based Teleportation},journal={Communications in Mathematical Physics},year={2021},volume={381},number={1},month=jan,pages={379--451},issn={1432-0916},doi={10.1007/s00220-020-03884-0},archiveprefix={arXiv},primaryclass={quant-ph}}
2020
NatComm
Playing Games with Multiple Access Channels
Felix Leditzky, Mohammad A. Alhejji, Joshua Levin, and 1 more author
@article{leditzky2020playing,author={Leditzky, Felix and Alhejji, Mohammad A. and Levin, Joshua and Smith, Graeme},title={Playing Games with Multiple Access Channels},journal={Nature Communications},year={2020},volume={11},eid={1497},month=mar,doi={10.1038/s41467-020-15240-w},archiveprefix={arXiv},primaryclass={quant-ph}}
@article{bausch2020neural,author={Bausch, Johannes and Leditzky, Felix},title={Quantum codes from neural networks},journal={New Journal of Physics},year={2020},volume={22},number={2},eid={023005},month=feb,doi={10.1088/1367-2630/ab6cdd},archiveprefix={arXiv},primaryclass={quant-ph},publisher={{IOP} Publishing}}
2018
PRL
Dephrasure Channel and Superadditivity of Coherent Information
@article{leditzky2018dephrasure,author={Leditzky, Felix and Leung, Debbie and Smith, Graeme},title={Dephrasure Channel and Superadditivity of Coherent Information},journal={Physical Review Letters},year={2018},volume={121},issue={16},month=oct,pages={160501},doi={10.1103/PhysRevLett.121.160501},archiveprefix={arXiv},primaryclass={quant-ph},publisher={American Physical Society}}
@article{leditzky2018useful,author={Leditzky, Felix and Datta, Nilanjana and Smith, Graeme},title={Useful states and entanglement distillation},journal={IEEE Transactions on Information Theory},year={2018},volume={64},number={7},month=jul,pages={4689-4708},doi={10.1109/TIT.2017.2776907},archiveprefix={arXiv},primaryclass={quant-ph}}
PRL
Quantum and Private Capacities of Low-Noise Channels
@article{leditzky2018low,author={Leditzky, Felix and Leung, Debbie and Smith, Graeme},title={Quantum and Private Capacities of Low-Noise Channels},journal={Physical Review Letters},year={2018},volume={120},issue={16},month=apr,pages={160503},doi={10.1103/PhysRevLett.120.160503},archiveprefix={arXiv},numpages={5},primaryclass={quant-ph},publisher={American Physical Society}}
PRA
Approaches for approximate additivity of the Holevo information of quantum channels
Felix Leditzky, Eneet Kaur, Nilanjana Datta, and 1 more author
@article{leditzky2018approaches,author={Leditzky, Felix and Kaur, Eneet and Datta, Nilanjana and Wilde, Mark M.},title={Approaches for approximate additivity of the {Holevo} information of quantum channels},journal={Physical Review A},year={2018},volume={97},issue={1},month=jan,pages={012332},doi={10.1103/PhysRevA.97.012332},archiveprefix={arXiv},numpages={20},primaryclass={quant-ph},publisher={American Physical Society}}
2017
IEEE ToIT
Corrections to “Second-Order Asymptotics for Source Coding, Dense Coding, and Pure-State Entanglement Conversions”
@article{datta2017corrections,author={Datta, Nilanjana and Leditzky, Felix},title={Corrections to ``Second-Order Asymptotics for Source Coding, Dense Coding, and Pure-State Entanglement Conversions''},journal={IEEE Transactions on Information Theory},year={2017},volume={64},number={4},month=apr,pages={2625-2627},doi={10.1109/TIT.2017.2661311},}
LMP
Data processing for the sandwiched Rényi divergence: a condition for equality
Felix Leditzky, Cambyse Rouzé, and Nilanjana Datta
@article{leditzky2017dpi,author={Leditzky, Felix and Rouzé, Cambyse and Datta, Nilanjana},title={Data processing for the sandwiched {Rényi} divergence: a condition for equality},journal={Letters in Mathematical Physics},year={2017},volume={107},number={1},month=jan,pages={61--80},doi={10.1007/s11005-016-0896-9},archiveprefix={arXiv},primaryclass={quant-ph},timestamp={2016.05.06}}
2016
JMP
Decoding Quantum Information via the Petz recovery map
@article{beigi2016decoding,author={Beigi, Salman and Datta, Nilanjana and Leditzky, Felix},title={Decoding Quantum Information via the Petz recovery map},journal={Journal of Mathematical Physics},year={2016},volume={57},number={8},eid={082203},month=aug,doi={10.1063/1.4961515},archiveprefix={arXiv},primaryclass={quant-ph},timestamp={2015.04.27}}
JMP
Strong converse theorems using Rényi entropies
Felix Leditzky, Mark M. Wilde, and Nilanjana Datta
@article{leditzky2016strong,author={Leditzky, Felix and Wilde, Mark M. and Datta, Nilanjana},title={Strong converse theorems using {Rényi} entropies},journal={Journal of Mathematical Physics},year={2016},volume={57},number={8},eid={082202},month=aug,doi={10.1063/1.4960099},archiveprefix={arXiv},primaryclass={quant-ph},timestamp={2015.06.16}}
IEEE ToIT
Second order asymptotics of visible mixed quantum source coding via universal codes
@article{leditzky2016second,author={Leditzky, Felix and Datta, Nilanjana},title={Second order asymptotics of visible mixed quantum source coding via universal codes},journal={IEEE Transactions on Information Theory},year={2016},volume={62},number={7},month=jul,pages={4347--4355},doi={10.1109/TIT.2016.2571662},archiveprefix={arXiv},primaryclass={quant-ph},timestamp={2015.01.10}}
2015
IEEE ToIT
Second-Order Asymptotics for Source Coding, Dense Coding, and Pure-State Entanglement Conversions
@article{datta2015second,author={Datta, Nilanjana and Leditzky, Felix},title={Second-Order Asymptotics for Source Coding, Dense Coding, and Pure-State Entanglement Conversions},journal={IEEE Transactions on Information Theory},year={2015},volume={61},number={1},month=jan,pages={582-608},doi={10.1109/TIT.2014.2366994},archiveprefix={arXiv},primaryclass={quant-ph}}
2014
JPhysA
A limit of the quantum Rényi divergence
Nilanjana Datta and Felix Leditzky
Journal of Physics A: Mathematical and Theoretical, Jan 2014
@article{datta2014limit,author={Datta, Nilanjana and Leditzky, Felix},title={A limit of the quantum {Rényi} divergence},journal={Journal of Physics A: Mathematical and Theoretical},year={2014},volume={47},number={4},month=jan,pages={045304},issn={1751-8113},doi={10.1088/1751-8113/47/4/045304},url={http://iopscience.iop.org/1751-8121/47/4/045304/},archiveprefix={arXiv},primaryclass={quant-ph},publisher={IOP Publishing},timestamp={2014.03.12}}