arXiv subjects

Shinichiro Yamano

Publications and source records attributed to Shinichiro Yamano.

6 recordsLinked to original sources

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

Trade-off between Gradient Measurement Efficiency and Expressivity in Deep Quantum Neural Networks

Quantum neural networks (QNNs) require an efficient training algorithm to achieve practical quantum advantages. A promising approach is gradient-based optimization, where gradients are estimated by quantum measurements. However, QNNs currently lack general quantum algorithms for efficiently measuring gradients, which limits their scalability. To elucidate the fundamental limits and potentials of efficient gradient estimation, we rigorously prove a trade-off between gradient measurement efficiency (the mean number of simultaneously measurable gradient components) and expressivity in deep QNNs. This trade-off indicates that more expressive QNNs require higher measurement costs per parameter for gradient estimation, while reducing QNN expressivity to suit a given task can increase gradient measurement efficiency. We further propose a general QNN ansatz called the stabilizer-logical product ansatz (SLPA), which achieves the trade-off upper bound by exploiting the symmetric structure of the quantum circuit. Numerical experiments show that the SLPA drastically reduces the sample complexity needed for training while maintaining accuracy and trainability compared to well-designed circuits based on the parameter-shift method.

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↗

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

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↗