arXiv subjects

Yui Kuramochi

Publications and source records attributed to Yui Kuramochi.

At least 19 recordsLinked to original sources

arXiv2026

W*-algebraic Integration Theory

Given a pair of $\mathrm{W}^*$-algebras $(\mathcal{M}_\mathcal{S},\mathcal{M}_\mathcal{R})$ with $(\mathcal{M}_\mathcal{S})_*$ separable, a measurable space $(Σ, \mathcal{F})$ and a POVM $\mathsf{E}: \mathcal{F} \to \mathcal{E}(\mathcal{M}_\mathcal{R})$, the integral of a function $f: Σ\to \mathcal{M}_\mathcal{S}$ is defined as an element of the spatial tensor product $\int f \otimes d\mathsf{E} \in \mathcal{M}_\mathcal{S} \bar{\otimes} \mathcal{M}_\mathcal{R}$. The space $B_b(Σ,\mathcal{F},\mathcal{M}_\mathcal{S})$ of uniformly bounded ultraweakly measurable functions is the universal domain of integration; once $\mathsf{E}$ is fixed it refines to the quotient $L^\infty_\mathsf{E}(Σ,\mathcal{M}_\mathcal{S}) = B_b(Σ,\mathcal{F},\mathcal{M}_\mathcal{S})/\mathcal{N}_\mathsf{E}$ by $\mathsf{E}$-null functions. When $(\mathcal{M}_\mathcal{R})_*$ is also separable, $L^\infty_\mathsf{E}(Σ,\mathcal{M}_\mathcal{S}) \cong \mathcal{M}_\mathcal{S} \bar{\otimes} L^\infty_\mathsf{E}(Σ)$ is a $\mathrm{W}^*$-algebra. The integration map is a faithful normal unital completely positive (CP) map, a $*$-homomorphism for PVMs and an isometry for localizable POVMs. It can be identified with the spatial tensor product $\boldsymbol{1}_{\mathcal{M}_\mathcal{S}} \hat{\otimes} Φ_\mathsf{E}$ where $Φ_\mathsf{E}: L^\infty_\mathsf{E}(Σ) \to \mathcal{M}_\mathcal{R}$ is the faithful normal positive map corresponding to $\mathsf{E}$. Complete positivity of integration maps is derived from Stinespring factorization through Naimark dilation. We establish an operator-valued Leibniz rule and Fubini theorem.

math-ph↗

arXiv2026

Asymptotically tight security analysis of quantum key distribution based on universal source compression

Practical quantum key distribution (QKD) protocols require a finite-size security proof. The phase error correction (PEC) approach is one of the general strategies for security analyses that has successfully proved finite-size security for many protocols. However, the conventional PEC approach cannot achieve the asymptotically optimal key rate in general, as long as the failure probability of PEC is estimated through the phase error rate. In this work, we propose a new PEC-type strategy that can provably achieve the asymptotically optimal key rate. The key piece for this is a virtual protocol based on universal source compression with quantum side information, which is of independent interest. A universal source compression with quantum side information protocol is first constructed for fixed-length independent and identically distributed (i.i.d.)~setups and then extended to adaptive-length setups with the restrictions on possible states imposed by joint random variables. Combined with the reduction method to collective attacks, this enables us to tightly evaluate the failure probability of PEC for permutation-symmetric QKD protocols, and thus leads to asymptotically tight analyses. As a result, the security of any permutation-symmetrizable QKD protocol gets reduced to the estimation problem of a single conditional Rényi entropy, which can be efficiently solved by a convex optimization.

quant-ph↗

arXiv2025

Universal tradeoff relations between resource cost and irreversibility of channels: General-resource Wigner-Araki-Yanase theorems and beyond

Quantum technologies offer exceptional -- sometimes almost magical -- speed and performance, yet every quantum process costs physical resources. Designing next-generation quantum devices, therefore, depends on solving the following question: which resources, and in what amount, are required to implement a desired quantum process? Casting the problem in the language of quantum resource theories, we prove a universal cost-irreversibility tradeoff: the lower the irreversibility of a quantum process, the greater the required resource cost for its realization. The trade-off law holds for a broad range of resources -- energy, magic, asymmetry, coherence, athermality, and others -- yielding lower bounds on resource cost of any quantum channel. Its broad scope positions this result as a foundation for deriving the following key results: (1) we show a universal relation between the energetic cost and the irreversibility for arbitrary channels, encompassing the energy-error tradeoff for any measurement or unitary gate; (2) we extend the energy-error tradeoff to free energy and work costs; (3) we extend the Wigner-Araki-Yanase theorem, which is the universal limitation on measurements under conservation laws, to a wide class of resource theories: the probability of failure in distinguishing resourceful states via a measurement is inversely proportional to its resource cost; (4) we prove that infinitely many resource-non-increasing operations in fact require an infinite implementation cost. These findings reveal a universal relationship between quantumness and irreversibility, providing a first step toward a general theory that explains when -- and how -- quantumness can suppress irreversibility.

quant-ph↗

arXiv2025

Universal trade-off structure between symmetry, irreversibility, and quantum coherence in quantum processes

Symmetry, irreversibility, and quantum coherence are foundational concepts in physics. Here, we present a universal tradeoff relation between these three concepts. This particularly reveals that (1) under a global symmetry, any attempt to change the local conserved charge causes inevitable irreversibility, and (2) such irreversibility can be mitigated by quantum coherence. Our tradeoff relation follows solely from the unitarity and global symmetry of the total dynamics, allowing for general applicability. For non-equilibrium physics, it relates the coherence cost and the entropy production -- representing thermodynamic irreversibility -- in arbitrary quantum processes. It also provides fundamental limitations on the capability of a number of quantum information processing tasks -- such as gate and measurement implementation and error correction -- that involve symmetry restrictions. Furthermore, it predicts how many bits of classical information thrown into a black hole become unreadable under energy conservation. Our tradeoff relation is based on quantum uncertainty relation, showcasing intimate connections between fundamental physical principles and ultimate operational capability of quantum processes.

quant-ph↗

arXiv2024

Tight concentration inequalities for quantum adversarial setups exploiting permutation symmetry

We developed new concentration inequalities for a quantum state on an $N$-qudit system or measurement outcomes on it that apply to an adversarial setup, where an adversary prepares the quantum state. Our one-sided concentration inequalities for a quantum state require the $N$-qudit system to be permutation invariant and are thus de-Finetti type, but they are tighter than the one previously obtained. We show that the bound can further be tightened if each qudit system has an additional symmetry. Furthermore, our concentration inequality for the outcomes of independent and identical measurements on an $N$-qudit quantum system has no assumption on the adversarial quantum state and is much tighter than the conventional one obtained through Azuma's inequality. We numerically demonstrate the tightness of our bounds in simple quantum information processing tasks.

quant-ph↗

arXiv2024

Nonstandard derivation of the Gorini-Kossakowski-Sudarshan-Lindblad master equation of a quantum dynamical semigroup from the Kraus representation

We give a new nonstandard proof of the well-known theorem that the generator $L$ of a quantum dynamical semigroup $\exp(tL)$ on a finite-dimensional quantum system has a specific form called a Gorini-Kossakowski-Sudarshan-Lindblad (GKSL) generator (also known as a Lindbladian) and vice versa. The proof starts from the Kraus representation of the quantum channel $\exp (δt L)$ for an infinitesimal hyperreal number $δt>0$ and then estimates the orders of the traceless components of the Kraus operators. The jump operators naturally arise as the standard parts of the traceless components of the Kraus operators divided by $\sqrt{δt}$. We also give a nonstandard proof of a related fact that close completely positive maps have close Kraus operators.

quant-ph↗

arXiv2023

Wigner-Araki-Yanase theorem for continuous and unbounded conserved observables

The Wigner-Araki-Yanase (WAY) theorem states that additive conservation laws imply the commutativity of exactly implementable projective measurements and the conserved observables of the system. Known proofs of this theorem are only restricted to bounded or discrete-spectrum conserved observables of the system and are not applicable to unbounded and continuous observables like a momentum operator. In this Letter, we present the WAY theorem for possibly unbounded and continuous conserved observables under the Yanase condition, which requires that the probe positive operator-valued measure should commute with the conserved observable of the probe system. As a result of this WAY theorem, we show that exact implementations of the projective measurement of the position under momentum conservation and of the quadrature amplitude using linear optical instruments and photon counters are impossible. We also consider implementations of unitary channels under conservation laws and find that the conserved observable $L_S$ of the system commute with the implemented unitary $U_S$ if $L_S$ is semi-bounded, while $U_S^\dagger L_S U_S$ can shift up to possibly non-zero constant factor if the spectrum of $L_S$ is upper and lower unbounded. We give simple examples of the latter case, where $L_S$ is a momentum operator.

quant-ph↗

arXiv2023

Refined finite-size analysis of binary-modulation continuous-variable quantum key distribution

Recent studies showed the finite-size security of binary-modulation CV-QKD protocols against general attacks. However, they gave poor key-rate scaling against transmission distance. Here, we extend the security proof based on complementarity, which is used in the discrete-variable QKD, to the previously developed binary-modulation CV-QKD protocols with the reverse reconciliation under the finite-size regime and obtain large improvements in the key rates. Notably, the key rate in the asymptotic limit scales linearly against the attenuation rate, which is known to be optimal scaling but is not achieved in previous finite-size analyses. This refined security approach may offer full-fledged security proofs for other discrete-modulation CV-QKD protocols.

quant-ph↗

arXiv2023

Standard quantum limit of finite-size optical lattice clock in estimating gravitational potential

We evaluated the accuracy limit for estimating gravitational potential using optical lattice clocks by utilizing the quantum Cramér--Rao bound. We then compared the results for single-layer and multilayer optical lattice clocks. The results indicate that the lower bound of variance of the estimator of gravitational potential using finite-size optical lattice clocks diverges and recovers repeatedly as a function of time. Namely, the accuracy of the gravitational potential estimation is not a monotonic function of time owing to the effect of gravitational dephasing in finite-size optical lattice clock. Further, this effect creates an estimation accuracy limit when attempting to avoid the divergence of the lower bound. When the number of layers in the optical lattice clock is sufficiently large, the limit is independent of the optical lattice clock details. The time required to reach this limit is calculated to be approximately 33 hours for a three-dimensional optical lattice clock consisting of one million cadmium atoms due to Earth's gravity, and approximately the same for other atoms.

quant-ph↗

arXiv2023

General treatment of Gaussian trusted noise in continuous variable quantum key distribution

Continuous Variable (CV) quantum key distribution (QKD) is a promising candidate for practical implementations due to its compatibility with the existing communication technology. A trusted device scenario assuming that an adversary has no access to imperfections such as electronic noises in the detector is expected to provide significant improvement in the key rate, but such an endeavor so far was made separately for specific protocols and for specific proof techniques. Here, we develop a simple and general treatment that can incorporate the effects of Gaussian trusted noises for any protocol that uses homodyne/heterodyne measurements. In our method, a rescaling of the outcome of a noisy homodyne/heterodyne detector renders it equivalent to the outcome of a noiseless detector with a tiny additional loss, thanks to a noise-loss equivalence well-known in quantum optics. Since this method is independent of protocols and security proofs, it is applicable to Gaussian-modulation and discrete-modulation protocols, to the finite-size regime, and to any proof techniques developed so far and yet to be discovered as well.

quant-ph↗

arXiv2022

Finite-size security proof of binary-modulation continuous-variable quantum key distribution using only heterodyne measurement

Continuous-variable quantum key distribution (CV-QKD) has many practical advantages including compatibility with current optical communication technology. Implementation using heterodyne measurements is particularly attractive since it eliminates the need for active phase locking of the remote pair of local oscillators, but the full security of CV QKD with discrete modulation was only proved for a protocol using homodyne measurements. Here we propose an all-heterodyne CV-QKD protocol with binary modulation and prove its security against general attacks in the finite-key regime. Although replacing a homodyne measurement with a heterodyne measurement would be naively expected to incur a 3-dB penalty in the rate-distance curve, our proof achieves a key rate with only a 1-dB penalty.

quant-ph↗

arXiv2022

Infinite dimensionality of the post-processing order of measurements on a general state space

For a partially ordered set $(S, \mathord\preceq)$, the order (monotone) dimension is the minimum cardinality of total orders (respectively, real-valued order monotone functions) on $S$ that characterize the order $\preceq$. In this paper we consider an arbitrary generalized probabilistic theory and the set of finite-outcome measurements on it, which can be described by effect-valued measures, equipped with the classical post-processing orders. We prove that the order and order monotone dimensions of the post-processing order are (countably) infinite if the state space is not a singleton (and is separable in the norm topology). This result gives a negative answer to the open question for quantum measurements posed in [Guff T \textit{et al.\/} 2021 \textit{J.\ Phys.\ A: Math.\ Theor.} \textbf{54} 225301]. We also consider the quantum post-processing relation of channels with a fixed input quantum system described by a separable Hilbert space $\mathcal{H}$ and show that the order (monotone) dimension is countably infinite when $\dim \mathcal{H} \geq 2$.

quant-ph↗

arXiv2020

Compact convex structure of measurements and its applications to simulability, incompatibility, and convex resource theory of continuous-outcome measurements

We introduce the post-processing preorder and equivalence relations for general measurements on a possibly infinite-dimensional general probabilistic theory described by an order unit Banach space $E$ with a Banach predual. We define the measurement space $\mathfrak{M}(E)$ as the set of post-processing equivalence classes of continuous measurements on $E .$ We define the weak topology on $\mathfrak{M} (E)$ as the weakest topology in which the state discrimination probabilities for any finite-label ensembles are continuous and show that $\mathfrak{M}(E)$ equipped with the convex operation corresponding to the probabilistic mixture of measurements can be regarded as a compact convex set regularly embedded in a locally convex Hausdorff space. We also prove that the measurement space $\mathfrak{M}(E) $ is infinite-dimensional except when the system is $1$-dimensional and give a characterization of the post-processing monotone affine functional. We apply these general results to the problems of simulability and incompatibility of measurements. We show that the robustness measures of unsimulability and incompatibility coincide with the optimal ratio of the state discrimination probability of measurement(s) relative to that of simulable or compatible measurements, respectively. The latter result for incompatible measurements generalizes the recent result for finite-dimensional quantum measurements. Throughout the paper, the fact that any weakly$\ast$ continuous measurement can be arbitrarily approximated in the weak topology by a post-processing increasing net of finite-outcome measurements is systematically used to reduce the discussions to finite-outcome cases.

math.FA↗

arXiv2020

Compatibility of any pair of 2-outcome measurements characterizes the Choquet simplex

For a compact convex subset $K $ of a locally convex Hausdorff space, a measurement on $A(K)$ is a finite family of positive elements in $A(K)$ normalized to the unit constant $1_K$, where $A(K)$ denotes the set of continuous real affine functionals on $K$. It is proved that a compact convex set $K$ is a Choquet simplex if and only if any pair of $2$-outcome measurements are compatible, i.e.\ the measurements are given as the marginals of a single measurement. This generalizes the finite-dimensional result of [Plávala M 2016 Phys.\ Rev.\ A \textbf{94}, 042108] obtained in the context of the foundations of quantum theory.

math.FA↗

arXiv2018

Entanglement-breaking channels with general outcome operator algebras

A unit-preserving and completely positive linear map, or a channel, $Λ\colon \mathcal{A} \to \mathcal{A}_{\mathrm{in}}$ between $C^\ast$-algebras $\mathcal{A}$ and $\mathcal{A}_{\mathrm{in}}$ is called entanglement-breaking (EB) if $ω\circ( Λ\otimes \mathrm{id}_{\mathcal{B}} ) $ is a separable state for any $C^\ast$-algebra $\mathcal{B}$ and any state $ω$ on the injective $C^\ast$-tensor product $\mathcal{A}_{\mathrm{in}} \otimes \mathcal{B} .$ In this paper, we establish the equivalence of the following conditions for a channel $Λ$ with a quantum input space and with a general outcome $C^\ast$-algebra, generalizing known results in finite dimensions: (i) $Λ$ is EB; (ii) $Λ$ has a measurement-prepare form (Holevo form); (iii) $n$ copies of $Λ$ are compatible for all $2 \leq n < \infty ;$ (iv) countably infinite copies of $Λ$ are compatible. By using this equivalence, we also show that the set of randomization-equivalence classes of normal EB channels with a fixed input von Neumann algebra is upper and lower Dedekind-closed, i.e. the supremum or infimum of any randomization-increasing or decreasing net of EB channels is also EB. As an example, we construct an injective normal EB channel with an arbitrary outcome operator algebra $\mathcal{M}$ acting on an infinite-dimensional separable Hilbert space by using the coherent states and the Bargmann measure.

quant-ph↗

arXiv2018

Post-processing minimal joint observables

A finite set of quantum observables (positive operator valued measures) is called compatible if these observables are marginals of a some observable, called a joint observable of them. For a given set of compatible observables, their joint observable is in general not unique and it is desirable to take a minimal joint observable in the post-processing order since a less informative observable disturbs less the system. We address the question of the minimality of finite-outcome joint observables and prove that any joint observable is lower bounded by a minimal joint observable in the post-processing order. We also give characterizations of the minimality of a joint observable that can be checked by finite-step algorithms and apply them to the case of non-commuting dichotomic qubit observables.

quant-ph↗

arXiv2018

Directed-completeness of quantum statistical experiments in the randomization order

A parametrized family of normal states on a von Neumann algebra is called a statistical experiment, which generalizes the corresponding concepts in classical statistics and finite-dimensional quantum systems. We introduce randomization preorder and equivalence relations for statistical experiments with a fixed parameter set and for normal channels with a fixed input space by post-processing completely positive channels. In this paper, we prove that the set of equivalence classes of statistical experiments or those of normal channels is an upper and lower directed-complete partially ordered set with respect to the randomization order, i.e. any increasing or decreasing net of statistical experiments or channels has its supremum or infimum in the randomization order. We also show that if the outcome space of each statistical experiment or channel of a randomization-monotone net is commutative, the outcome space of the supremum or infimum can also be taken to be commutative. We consider two examples of homogeneous Markov processes of channels on infinite-dimensional separable Hilbert spaces, namely block-diagonalization with irrational translation and ideal quantum linear amplifier channels, and explicitly derive their infima. Throughout the paper, the concept of channel conjugation is used to obtain results for decreasing channels from those for increasing channels.

quant-ph↗

arXiv2018

Quantum incompatibility of channels with general outcome operator algebras

A pair of quantum channels are said to be incompatible if they cannot be realized as marginals of a single channel. This paper addresses the general structure of the incompatibility of completely positive channels with a fixed quantum input space and with general outcome operator algebras. We define a compatibility relation for such channels by identifying the composite outcome space as the maximal (projective) $C^\ast$-tensor product of outcome algebras. We show theorems that characterize this compatibility relation in terms of the concatenation and conjugation of channels, generalizing the recent result for channels with quantum outcome spaces. These results are applied to the positive operator valued measures (POVMs) by identifying each of them with the corresponding quantum-classical (QC) channel. We also give a characterization of the maximality of a POVM with respect to the post-processing preorder in terms of the conjugate channel of the QC channel. We consider another definition of compatibility of normal channels by identifying the composite outcome space with the normal tensor product of the outcome von Neumann algebras. We prove that for a given normal channel the class of normally compatible channels is upper bounded by a special class of channels called tensor conjugate channels. We show the inequivalence of the $C^\ast$- and normal compatibility relations for QC channels, which originates from the possibility and impossibility of copying operations for commutative von Neumann algebras in $C^\ast$- and normal compatibility relations, respectively.

quant-ph↗