Shintaro Minagawa

Abstract The inevitable accumulation of errors in near-future quantum devices represents a key obstacle in delivering practical quantum advantages, motivating the development of various quantum error-mitigation methods. Here, we derive fundamental bounds concerning how error-mitigation algorithms can reduce the computation error as a function of their sampling overhead. Our bounds place universal performance limits on a general error-mitigation protocol class. We use them to show (1) that the sa

Von Neumann obtained the formula for the entropy of a quantum state by assuming the validity of the second law of thermodynamics in a thought experiment involving semipermeable membranes and an ideal gas of quantum-labeled particles. Despite being operational for the most part, von Neumann's argument departs from an operational narrative in its use of the spectral theorem. In this work, we show that the role of the spectral theorem in von Neumann's argument can be taken over by the operational a

Adiabatic measurements, followed by feedback and erasure protocols, have often been considered as a model to embody Maxwell’s Demon paradox and to study the interplay between thermodynamics and information processing. Such studies have led to the conclusion, now widely accepted in the community, that Maxwell’s Demon and the second law of thermodynamics can peacefully coexist because any gain provided by the demon must be offset by the cost of performing the measurement and resetting the demon’s

Adiabatic measurements, followed by feedback and erasure protocols, have often been considered as a model to embody Maxwell's Demon paradox and to study the interplay between thermodynamics and information processing. Such studies have led to the conclusion, now widely accepted in the community, that Maxwell's Demon and the second law of thermodynamics can peacefully coexist because any gain provided by the demon must be offset by the cost of performing the measurement and resetting the demon's

With the recent development of quantum information theory, some attempts exist to construct information theory beyond quantum theory. Here we consider hypothesis testing relative entropy and one-shot classical capacity, that is, the optimal rate of classical information transmitted by using a single channel under a constraint of a certain error probability, in general physical theories where states and measurements are operationally defined. Then we obtain the upper bound of one-shot classical c

With the recent development of quantum information theory, some attempts have been made to construct information theory beyond quantum theory. Here, we consider hypothesis-testing relative entropy and one-shot classical capacity, that is, the optimal rate of classical information transmitted by using a single channel under the constraint of a certain error probability, in general physical theories where states and measurements are operationally defined. Then we obtain the upper bound of the one-

Certifying that quantum randomness generated by untrusted devices is unpredictable to an attacker (say, Eve) is crucial for device-independent security. Bipartite protocols where only one of the parties is trusted are termed one-sided device-independent (1SDI) or steering-based protocols, where the untrusted party (say, Alice) performs measurements on her part of a bipartite entangled state to steer the subsystem of the trusted party (say, Bob) into different ensembles (collectively, an assembla

Certifying that quantum randomness generated by untrusted devices is unpredictable to an attacker (say, Eve) is crucial for device-independent security. Bipartite protocols where only one of the parties is trusted are termed one-sided device-independent (1SDI) or steering-based protocols, where the untrusted party (say, Alice) performs measurements on her part of a bipartite entangled state to steer the subsystem of the trusted party (say, Bob) into different ensembles (collectively, an assembla