Christoph Hirche

Christoph Hirche

Auto-generated profile, based on publicly available information

Christoph Hirche

Institute for Information Processing (tnt/L3S) Leibniz Universität Hannover Germany

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 April 2017 in Physical Review X
Verified
Journal Article
Open access
PDF file
YNYoshifumi Nakata
Yoshifumi Nakata
CHChristoph Hirche
Christoph Hirche
MKMasato Koashi
Masato Koashi
AWAndreas Winter
Andreas Winter
Quantum randomness is an essential key to understanding the dynamics of complex many-body systems and also a powerful tool for quantum engineering. However, exact realizations of quantum randomness take an extremely long time and are infeasible in many-body systems, leading to the notion of quantum pseudorandomness, also known as unitary designs. Here, to explore microscopic dynamics of generating quantum pseudorandomness in many-body systems, we provide new efficient constructions of unitary designs and propose a design Hamiltonian, a random Hamiltonian of which dynamics always forms a unitary design after a threshold time. The new constructions are based on the alternate applications of random potentials in the generalized position and momentum spaces, and we provide explicit quantum circuits generating quantum pseudorandomness significantly more efficient than previous ones. We then provide a design Hamiltonian in disordered systems with periodically changing spin-glass-type interactions. The design Hamiltonian generates quantum pseudorandomness in a constant time even in the system composed of a large number of spins. We also point out the close relationship between the design Hamiltonian and quantum chaos.

4 May 2023 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
CHChristoph Hirche
Christoph Hirche
CRCambyse Rouzé
Cambyse Rouzé
DFDaniel Stilck França
Daniel Stilck França
Differential privacy has been an exceptionally successful concept when it comes to providing provable security guarantees for classical computations. More recently, the concept was generalized to quantum computations. While classical computations are essentially noiseless and differential privacy is often achieved by artificially adding noise, near-term quantum computers are inherently noisy and it was observed that this leads to natural differential privacy as a feature. In this work we discuss quantum differential privacy in an information theoretic framework by casting it as a quantum divergence. A main advantage of this approach is that differential privacy becomes a property solely based on the output states of the computation, without the need to check it for every measurement. This leads to simpler proofs and generalized statements of its properties as well as several new bounds for both, general and specific, noise models. In particular, these include common representations of quantum circuits and quantum machine learning concepts. Here, we focus on the difference in the amount of noise required to achieve certain levels of differential privacy versus the amount that would make any computation useless. Finally, we also generalize the classical concepts of local differential privacy, Rényi differential privacy and the hypothesis testing interpretation to the quantum setting, providing several new properties and insights.

23 November 2016 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
LLLudovico Lami
Ludovico Lami
CHChristoph Hirche
Christoph Hirche
GAGerardo Adesso
Gerardo Adesso
AWAndreas Winter
Andreas Winter
We derive fundamental constraints for the Schur complement of positive matrices, which provide an operator strengthening to recently established information inequalities for quantum covariance matrices, including strong subadditivity. This allows us to prove general results on the monogamy of entanglement and steering quantifiers in continuous variable systems with an arbitrary number of modes per party. A powerful hierarchical relation for correlation measures based on the log-determinant of covariance matrices is further established for all Gaussian states, which has no counterpart among quantities based on the conventional von Neumann entropy.

1 May 2017 in Journal of Mathematical Physics
Verified
Journal Article
Closed access
PDF file
YNYoshifumi Nakata
Yoshifumi Nakata
CHChristoph Hirche
Christoph Hirche
CMCiara Morgan
Ciara Morgan
AWAndreas Winter
Andreas Winter
Unitary 2-designs are random unitaries simulating up to the second order statistical moments of the uniformly distributed random unitaries, often referred to as Haar random unitaries. They are used in a wide variety of theoretical and practical quantum information protocols and also have been used to model the dynamics in complex quantum many-body systems. Here, we show that unitary 2-designs can be approximately implemented by alternately repeating random unitaries diagonal in the Pauli-Z basis and Pauli-X basis. We also provide a converse about the number of repetitions needed to achieve unitary 2-designs. These results imply that the process after ℓ repetitions achieves a Θ(d−ℓ) -approximate unitary 2-design. Based on the construction, we further provide quantum circuits that efficiently implement approximate unitary 2-designs. Although a more efficient implementation of unitary 2-designs is known, our quantum circuit has its own merit that it is divided into a constant number of commuting parts, which enables us to apply all commuting gates simultaneously and leads to a possible reduction of an actual execution time. We finally interpret the result in terms of the dynamics generated by time-dependent Hamiltonians and provide for the first time a random disordered time-dependent Hamiltonian that generates a unitary 2-design after switching interactions only a few times.

10 June 2021 in Communications in Mathematical Physics
Verified
Journal Article
Open access
PDF file
MBMario Berta
Mario Berta
FBFernando G. S. L. Brandão
Fernando G. S. L. Brandão
CHChristoph Hirche
Christoph Hirche
We extend quantum Stein’s lemma in asymmetric quantum hypothesis testing to composite null and alternative hypotheses. As our main result, we show that the asymptotic error exponent for testing convex combinations of quantum states $$\rho ^{\otimes n}$$ ρ ⊗ n against convex combinations of quantum states $$\sigma ^{\otimes n}$$ σ ⊗ n can be written as a regularized quantum relative entropy formula. We prove that in general such a regularization is needed but also discuss various settings where our formula as well as extensions thereof become single-letter. This includes an operational interpretation of the relative entropy of coherence in terms of hypothesis testing. For our proof, we start from the composite Stein’s lemma for classical probability distributions and lift the result to the non-commutative setting by using elementary properties of quantum entropy. Finally, our findings also imply an improved recoverability lower bound on the conditional quantum mutual information in terms of the regularized quantum relative entropy—featuring an explicit and universal recovery map.

6 May 2021 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
EVEsteban Martínez Vargas
Esteban Martínez Vargas
CHChristoph Hirche
Christoph Hirche
GSGael Sentís
Gael Sentís
MSMichalis Skotiniotis
Michalis Skotiniotis
MCMarta Carrizo
Marta Carrizo
JCJohn Calsamiglia
John Calsamiglia
We introduce sequential analysis in quantum information processing, by focusing on the fundamental task of quantum hypothesis testing. In particular, our goal is to discriminate between two arbitrary quantum states with a prescribed error threshold ε when copies of the states can be required on demand. We obtain ultimate lower bounds on the average number of copies needed to accomplish the task. We give a block-sampling strategy that allows us to achieve the lower bound for some classes of states. The bound is optimal in both the symmetric as well as the asymmetric setting in the sense that it requires the least mean number of copies out of all other procedures, including the ones that fix the number of copies ahead of time. For qubit states we derive explicit expressions for the minimum average number of copies and show that a sequential strategy based on fixed local measurements outperforms the best collective measurement on a predetermined number of copies. Whereas for general states the number of copies increases as log1/ε, for pure states sequential strategies require a finite average number of samples even in the case of perfect discrimination, i.e., ε=0.