Christoph Hirche
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Christoph Hirche has a total of 44 co-authors. Here are the top co-authors by number of shared publications:
Ciara Morgan
Institut für Theoretische Physik, Leibniz Universität Hannover, Appelstraße 2, 30167 Hannover, Germany
5 shared publicationsAndreas Winter
Grup dInformaci Quntica, Universitat Autnoma de Barcelona, Bellaterra (Barcelona), 08193, Spain
4 shared publications- John Calsamiglia
Universitat Autónoma de Barcelona
4 shared publications - Yoshifumi Nakata
Yukawa Institute for Theoretical Physics, Kyoto University, Kitashirakawa, Sakyo-ku, Kyoto 606-8502, Japan
3 shared publications - Andreas Winter
Departament de Física Grup d'Informació Quàntica Universitat Autònoma de Barcelona 08193 Bellaterra (Barcelona Spain
2 shared publications - Bodo Rosenhahn
Leibniz University Hannover
2 shared publications
Latest Publications
- Open Access
- 7 September 2026
- Published by Springer Nature in Quantum Machine Intelligence
- Vol. 8 (2) , 98
Stochastic neural networks for quantum devices
This work presents a formulation to express and optimize stochastic neural networks as quantum circuits in gate-based quantum computing. Motivated by a classical perceptron, stochastic artificial neurons are introduced and combined into a quantum neural network. The Kiefer-Wolfowitz algorithm in combination with simulated annealing is used for training the network weights. Several topologies and models are presented, including shallow fully connected networks, Hopfield Networks, Restricted Boltzmann Machines, Autoencoders and convolutional neural networks. We also demonstrate the combination of our optimized neural networks as an oracle for the Grover algorithm to realize a quantum generative AI model.
- 7 September 2026
- Published by Springer Nature in Quantum Machine Intelligence
- Vol. 8 (2) , 98
Open AccessStochastic neural networks for quantum devices
This work presents a formulation to express and optimize stochastic neural networks as quantum circuits in gate-based quantum computing. Motivated by a classical perceptron, stochastic artificial neurons are introduced and combined into a quantum neural network. The Kiefer-Wolfowitz algorithm in combination with simulated annealing is used for training the network weights. Several topologies and models are presented, including shallow fully connected networks, Hopfield Networks, Restricted Boltzmann Machines, Autoencoders and convolutional neural networks. We also demonstrate the combination of our optimized neural networks as an oracle for the Grover algorithm to realize a quantum generative AI model.
- Open Access
- 13 May 2026
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 59 (20)
On the complexity of quantum states and circuits from the orthogonal and symplectic groups
Understanding the complexity of quantum states and circuits is a central challenge in quantum information science, with broad implications in many-body physics, high-energy physics and quantum learning theory. A common way to model the behaviour of typical states and circuits involves sampling unitary transformations from the Haar measure on the unitary group. In this work, we depart from this standard approach and instead study structured unitaries drawn from other compact connected groups, namely the symplectic and special orthogonal groups. By leveraging the concentration of measure phenomenon, we establish two main results. We show that random quantum states generated using symplectic or orthogonal unitaries typically exhibit an exponentially large strong state complexity, and are nearly orthogonal to one another. Similar behavior is observed for designs over these groups. Additionally, we demonstrate the average-case hardness of learning circuits composed of gates drawn from such classical groups of unitaries. Taken together, our results demonstrate that structured subgroups can exhibit a complexity comparable to that of the full unitary group.
- 13 May 2026
- Published by IOP Publishing in Journal of Physics A: Mathematical and Theoretical
- Vol. 59 (20)
Open AccessOn the complexity of quantum states and circuits from the orthogonal and symplectic groups
Understanding the complexity of quantum states and circuits is a central challenge in quantum information science, with broad implications in many-body physics, high-energy physics and quantum learning theory. A common way to model the behaviour of typical states and circuits involves sampling unitary transformations from the Haar measure on the unitary group. In this work, we depart from this standard approach and instead study structured unitaries drawn from other compact connected groups, namely the symplectic and special orthogonal groups. By leveraging the concentration of measure phenomenon, we establish two main results. We show that random quantum states generated using symplectic or orthogonal unitaries typically exhibit an exponentially large strong state complexity, and are nearly orthogonal to one another. Similar behavior is observed for designs over these groups. Additionally, we demonstrate the average-case hardness of learning circuits composed of gates drawn from such classical groups of unitaries. Taken together, our results demonstrate that structured subgroups can exhibit a complexity comparable to that of the full unitary group.
- Open Access
Information Contraction under $(\varepsilon,δ)$-Differentially Private Mechanisms
The distinguishability quantified by information measures after being processed by a private mechanism has been a useful tool in studying various statistical and operational tasks while ensuring privacy. To this end, standard data-processing inequalities and strong data-processing inequalities (SDPI) are employed. Most of the previously known and even tight characterizations of contraction of information measures, including total variation distance, hockey-stick divergences, and $f$-divergences, are applicable for $(\varepsilon,0)$-local differential private (LDP) mechanisms. In this work, we derive both linear and non-linear strong data-processing inequalities for hockey-stick divergence and $f$-divergences that are valid for all $(\varepsilon,δ)$-LDP mechanisms even when $δ\neq 0$. Our results either generalize or improve the previously known bounds on the contraction of these distinguishability measures.Open AccessInformation Contraction under $(\varepsilon,δ)$-Differentially Private Mechanisms
The distinguishability quantified by information measures after being processed by a private mechanism has been a useful tool in studying various statistical and operational tasks while ensuring privacy. To this end, standard data-processing inequalities and strong data-processing inequalities (SDPI) are employed. Most of the previously known and even tight characterizations of contraction of information measures, including total variation distance, hockey-stick divergences, and $f$-divergences, are applicable for $(\varepsilon,0)$-local differential private (LDP) mechanisms. In this work, we derive both linear and non-linear strong data-processing inequalities for hockey-stick divergence and $f$-divergences that are valid for all $(\varepsilon,δ)$-LDP mechanisms even when $δ\neq 0$. Our results either generalize or improve the previously known bounds on the contraction of these distinguishability measures. - Open Access
Non-Linear Strong Data-Processing for Quantum Hockey-Stick Divergences
Data-processing is a desired property of classical and quantum divergences and information measures. In information theory, the contraction coefficient measures how much the distinguishability of quantum states decreases when they are transmitted through a quantum channel, establishing linear strong data-processing inequalities (SDPI). However, these linear SDPI are not always tight and can be improved in most of the cases. In this work, we establish non-linear SDPI for quantum hockey-stick divergence for noisy channels that satisfy a certain noise criterion. We also note that our results improve upon existing linear SDPI for quantum hockey-stick divergences and also non-linear SDPI for classical hockey-stick divergence. We define $F_γ$ curves generalizing Dobrushin curves for the quantum setting while characterizing SDPI for the sequential composition of heterogeneous channels. In addition, we derive reverse-Pinsker type inequalities for $f$-divergences with additional constraints on hockey-stick divergences. We show that these non-linear SDPI can establish tighter finite mixing times that cannot be achieved through linear SDPI. Furthermore, we find applications of these in establishing stronger privacy guarantees for the composition of sequential private quantum channels when privacy is quantified by quantum local differential privacy.Open AccessNon-Linear Strong Data-Processing for Quantum Hockey-Stick Divergences
Data-processing is a desired property of classical and quantum divergences and information measures. In information theory, the contraction coefficient measures how much the distinguishability of quantum states decreases when they are transmitted through a quantum channel, establishing linear strong data-processing inequalities (SDPI). However, these linear SDPI are not always tight and can be improved in most of the cases. In this work, we establish non-linear SDPI for quantum hockey-stick divergence for noisy channels that satisfy a certain noise criterion. We also note that our results improve upon existing linear SDPI for quantum hockey-stick divergences and also non-linear SDPI for classical hockey-stick divergence. We define $F_γ$ curves generalizing Dobrushin curves for the quantum setting while characterizing SDPI for the sequential composition of heterogeneous channels. In addition, we derive reverse-Pinsker type inequalities for $f$-divergences with additional constraints on hockey-stick divergences. We show that these non-linear SDPI can establish tighter finite mixing times that cannot be achieved through linear SDPI. Furthermore, we find applications of these in establishing stronger privacy guarantees for the composition of sequential private quantum channels when privacy is quantified by quantum local differential privacy. - 20 October 2025
- Published by Springer Nature
- p. 112-120
Rényi Partial Orders for BISO Channels
- Open Access
- 1 October 2025
- Published by IOP Publishing in New Journal of Physics
- Vol. 27 (10) , 104509
Optimization driven quantum circuit reduction
Implementing a quantum circuit on specific hardware with a reduced available gate set is often associated with a substantial increase in the length of the equivalent circuit. This process is also known as transpilation and due to decoherence, it is mandatory to keep quantum circuits as short as possible, without affecting functionality. In this work we propose three different transpilation approaches, based on a localized term-replacement scheme, to substantially reduce circuit lengths while preserving the unitary operation implemented by the circuit. The first variant is based on a stochastic search scheme, and the other variants are driven by a database retrieval scheme and a machine learning based decision support. We show that our proposed methods generate short quantum circuits for restricted gate sets, superior to the typical results obtained by using various qiskit and Berkley quantum synthesis toolkit optimization levels. Our method can be applied to different gate sets and scales well with an arbitrary number of qubits.
- 1 October 2025
- Published by IOP Publishing in New Journal of Physics
- Vol. 27 (10) , 104509
Open AccessOptimization driven quantum circuit reduction
Implementing a quantum circuit on specific hardware with a reduced available gate set is often associated with a substantial increase in the length of the equivalent circuit. This process is also known as transpilation and due to decoherence, it is mandatory to keep quantum circuits as short as possible, without affecting functionality. In this work we propose three different transpilation approaches, based on a localized term-replacement scheme, to substantially reduce circuit lengths while preserving the unitary operation implemented by the circuit. The first variant is based on a stochastic search scheme, and the other variants are driven by a database retrieval scheme and a machine learning based decision support. We show that our proposed methods generate short quantum circuits for restricted gate sets, superior to the typical results obtained by using various qiskit and Berkley quantum synthesis toolkit optimization levels. Our method can be applied to different gate sets and scales well with an arbitrary number of qubits.
- Open Access
Renyi partial orders for BISO channels
A fundamental question in information theory is to quantify the loss of information under a noisy channel. Partial orders are typical tools to that end, however, they are often also challenging to evaluate. For the special class of binary input symmetric output (BISO) channels, Geng et al. showed that among channels with the same capacity, the binary symmetric channel (BSC) and binary erasure channel (BEC) are extremal with respect to the more capable order. Here we extend on this result by considering partial orders based on Renyi mutual information. We establish the extremality of the BSC and BEC in this setting with respect to the generalized Renyi capacity. In the process, we also generalize the needed tools and introduce $α$-Lorenz curves.
Open AccessRenyi partial orders for BISO channels
A fundamental question in information theory is to quantify the loss of information under a noisy channel. Partial orders are typical tools to that end, however, they are often also challenging to evaluate. For the special class of binary input symmetric output (BISO) channels, Geng et al. showed that among channels with the same capacity, the binary symmetric channel (BSC) and binary erasure channel (BEC) are extremal with respect to the more capable order. Here we extend on this result by considering partial orders based on Renyi mutual information. We establish the extremality of the BSC and BEC in this setting with respect to the generalized Renyi capacity. In the process, we also generalize the needed tools and introduce $α$-Lorenz curves.
- Open Access
On Strong Converse Bounds for the Private and Quantum Capacities of Anti-degradable Channels
We establish a strong converse bound for the private classical capacity of anti-degradable quantum channels. Specifically, we prove that this capacity is zero whenever the error $ε> 0$ and privacy parameter $δ> 0$ satisfy the inequality $δ(1-ε^2)^{\frac{1}{2}}+ε(1-δ^2)^{\frac{1}{2}}<1$. This result strengthens previous understandings by sharply defining the boundary beyond which reliable and private communication is impossible. Furthermore, we present a ``pretty simple'' proof of the ``pretty strong'' converse for the quantum capacity of anti-degradable channels, valid for any error $ε< \frac{1}{\sqrt{2}}$. Our approach offers clarity and technical simplicity, shedding new light on the fundamental limits of quantum communication.Open AccessOn Strong Converse Bounds for the Private and Quantum Capacities of Anti-degradable Channels
We establish a strong converse bound for the private classical capacity of anti-degradable quantum channels. Specifically, we prove that this capacity is zero whenever the error $ε> 0$ and privacy parameter $δ> 0$ satisfy the inequality $δ(1-ε^2)^{\frac{1}{2}}+ε(1-δ^2)^{\frac{1}{2}}<1$. This result strengthens previous understandings by sharply defining the boundary beyond which reliable and private communication is impossible. Furthermore, we present a ``pretty simple'' proof of the ``pretty strong'' converse for the quantum capacity of anti-degradable channels, valid for any error $ε< \frac{1}{\sqrt{2}}$. Our approach offers clarity and technical simplicity, shedding new light on the fundamental limits of quantum communication. - Top Cited Papers
- 20 August 2024
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 405 (9) , 1-52
Quantum Rényi and f-Divergences from Integral Representations
- 20 August 2024
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 405 (9) , 1-52
Top Cited PapersQuantum Rényi and f-Divergences from Integral Representations
- Open Access
- 25 July 2023
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 7, 1064
Quantum Network Discrimination
Discrimination between objects, in particular quantum states, is one of the most fundamental tasks in (quantum) information theory. Recent years have seen significant progress towards extending the framework to point-to-point quantum channels. However, with technological progress the focus of the field is shifting to more complex structures: Quantum networks. In contrast to channels, networks allow for intermediate access points where information can be received, processed and reintroduced into the network. In this work we study the discrimination of quantum networks and its fundamental limitations. In particular when multiple uses of the network are at hand, the rooster of available strategies becomes increasingly complex. The simplest quantum network that capturers the structure of the problem is given by a quantum superchannel. We discuss the available classes of strategies when considering copies of a superchannel and give fundamental bounds on the asymptotically achievable rates in an asymmetric discrimination setting. Furthermore, we discuss achievability, symmetric network discrimination, the strong converse exponent, generalization to arbitrary quantum networks and finally an application to an active version of the quantum illumination problem.- 25 July 2023
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 7, 1064
Open AccessQuantum Network Discrimination
Discrimination between objects, in particular quantum states, is one of the most fundamental tasks in (quantum) information theory. Recent years have seen significant progress towards extending the framework to point-to-point quantum channels. However, with technological progress the focus of the field is shifting to more complex structures: Quantum networks. In contrast to channels, networks allow for intermediate access points where information can be received, processed and reintroduced into the network. In this work we study the discrimination of quantum networks and its fundamental limitations. In particular when multiple uses of the network are at hand, the rooster of available strategies becomes increasingly complex. The simplest quantum network that capturers the structure of the problem is given by a quantum superchannel. We discuss the available classes of strategies when considering copies of a superchannel and give fundamental bounds on the asymptotically achievable rates in an asymmetric discrimination setting. Furthermore, we discuss achievability, symmetric network discrimination, the strong converse exponent, generalization to arbitrary quantum networks and finally an application to an active version of the quantum illumination problem.