arXiv subjects

Masaki Owari

Publications and source records attributed to Masaki Owari.

At least 19 recordsLinked to original sources

arXiv2026

Lie-Algebraic Bounds on Quantum Control Time via the Baker-Campbell-Hausdorff Formula

The time required to implement a desired unitary operation is a central issue in quantum control, especially for many-body systems with limited control access. While controllability theory determines whether a target unitary is reachable in principle, it does not directly quantify the implementation time. Here we derive a Baker-Campbell-Hausdorff (BCH)-based inequality that connects these two questions at the operator level. Whenever a target unitary is implemented by the available Hamiltonians, an effective logarithmic generator can be chosen within the corresponding dynamical Lie algebra, and its normalized traceless Hilbert-Schmidt norm is bounded by the time integral of the same norm of the applied Hamiltonian. This induces a global-phase-insensitive distance on the reachable subgroup and yields a protocol-independent lower bound on the control time that explicitly respects Lie-algebraic restrictions. We compare the resulting bound with familiar quantum-speed-limit estimates and show that it refines a stabilizer-based control-time bound for an XY spin chain in the single-excitation subspace. Our result thus provides an algebraic link between controllability and quantitative bounds on unitary implementation time.

quant-ph↗

arXiv2026

Multicast quantum network coding as optimal symmetric universal cloning over a quantum network

We study the problem of perfectly multicasting symmetric universal clones of unknown quantum states over quantum networks with free classical communication. We construct a protocol that multicasts symmetric universal clones of input states from multiple source nodes by extending the quantum network coding protocol proposed by Kobayashi et al. We further establish a sufficient condition for perfect multicast in the single-source setting. Specifically, we show that when a single copy of a $q^r$-dimensional input state is available at the source node, where $q$ is a sufficiently large prime power, perfect multicast of the corresponding symmetric universal clone is achievable using a small amount of entanglement shared among the target nodes. This result holds for quantum networks represented by an undirected graph $G$, where each edge corresponds to a noiseless $q$-dimensional quantum channel, provided that there exists an acyclic directed graph $G'$ obtained by assigning directions to the edges of $G$ such that the minimum cut of $G'$ is at least $r$.

quant-ph↗

arXiv2025

Progress in Chromatic Calorimetry Concept: Improved Techniques for Energy Resolution and Particle Discrimination

This study introduces chromatic calorimetry, a novel particle detection method that uses strategically layered scintillators with different emission wavelengths. This approach aims to enhance energy measurement by capturing particle interactions at different shower depths through wavelength-based discrimination. Our experimental validation of this novel method utilizes an arrangement of scintillator materials to improve energy resolution and particle identification. The stacking arrangement of scintillators is organized by their emission wavelengths to track the development of electromagnetic and hadronic showers. By testing electrons and pions with energies up to 100 GeV, the setup demonstrated better discrimination and provided detailed measurements of shower profiles. The results indicate that our experimental validation significantly aims to enhance particle identification and energy resolution, highlighting its potential value in high-energy particle detection. Future work will explore the integration of Quantum Dots (QD) technology to advance these capabilities in chromatic calorimetry further.

physics.ins-det↗

arXiv2024

Enhancing Energy Resolution and Particle Identification via Chromatic Calorimetry: A Concept Validation Study

In particle physics, homogeneous calorimeters are used to measure the energy of particles as they interact with the detector material. Although not as precise as trackers or muon detectors, these calorimeters provide valuable insights into the properties of particles by analyzing their energy deposition patterns. Recent advances in material science, notably in nanomaterial scintillators with tunable emission bandwidths, have led to the proposal of the chromatic calorimetry concept. This proposed concept aims to track electromagnetic or hadronic shower progression within a module, enhancing particle identification and energy resolution by layering scintillators with different emission wavelengths. The idea is to use the emission spectra of the inorganic scintillators to reconstruct the shower progression. Our study validates this proposed concept using inorganic scintillators strategically stacked by decreasing emission wavelength. Using electrons and pions with up to 100 GeV, we achieved analytical discrimination and longitudinal shower measurement. This proof of concept underscores chromatic calorimetry's potential for broader applications.

physics.ins-det↗

arXiv2022

Verifiable homodyne measurement for detecting non-local properies of light

The homodyne detection is one of the most basic tools for identifying the quantum state of light. It has been used to detect useful non-local properties, such as entanglement for the quantum teleportation and distillability of a secret key in quantum key distribution. In so doing, the detection scheme employs a bright optical pulse, called the local oscillator (LO) pulse, and the LO pulse is usually transmitted along with the signal pulses. The LO pulse is presumed to be a coherent state with an infinite intensity. However, it is difficult in practice to hold this presumption owing to noise in the optical transmission channels or an intervention by a malicious third party. As a result, the implementation may no longer be the homodyne detection, and those outcomes may merely disguise successful detection of entanglement or a secret key. Here, we present an alternative scheme that works as the homodyne detection to detect the non-local properties of light in a verifiable manner, without any presumption for the LO pulses. This scheme is essentially based on the same setup as the conventional implementation for the homodyne detection. This result contributes to close any possible loophole in the homodyne detection caused by the deviation from the ideal LO pulses.

quant-ph↗

arXiv2022

Characterizing quantum pseudorandomness by machine learning

Random dynamics in isolated quantum systems is of practical use in quantum information and is of theoretical interest in fundamental physics. Despite a large number of theoretical studies, it has not been addressed how random dynamics can be verified from experimental data. In this paper, based on an information-theoretic formulation of random dynamics, i.e., unitary $t$-designs, we propose a method for verifying random dynamics from the data that is experimentally easy-to-access. More specifically, we use measurement probabilities estimated by a finite number of measurements of quantum states generated by a given random dynamics. Based on a supervised learning method, we construct classifiers of random dynamics and show that the classifiers succeed to characterize random dynamics. We then apply the classifiers to the data set generated by local random circuits (LRCs), which are canonical quantum circuits with growing circuit complexity, and show that the classifiers successfully characterize the growing features. We further apply the classifiers to noisy LRCs, showing the possibility of using them for verifying noisy quantum devices, and to monitored LRCs, indicating that the measurement-induced phase transition may possibly not be directly related to randomness.

quant-ph↗

arXiv2020

Single-Shot Secure Quantum Network Coding for General Multiple Unicast Network with Free One-Way Public Communication

It is natural in a quantum network system that multiple users intend to send their quantum message to their respective receivers, which is called a multiple unicast quantum network. We propose a canonical method to derive a secure quantum network code over a multiple unicast quantum network from a secure classical network code. Our code correctly transmits quantum states when there is no attack. It also guarantees the secrecy of the transmitted quantum state even with the existence of an attack when the attack satisfies a certain natural condition. In our security proof, the eavesdropper is allowed to modify wiretapped information dependently on the previously wiretapped messages. Our protocol guarantees the secrecy by utilizing one-way classical information transmission (public communication) in the same direction as the quantum network although the verification of quantum information transmission requires two-way classical communication. Our secure network code can be applied to several networks including the butterfly network.

quant-ph↗

arXiv2020

Reduction Theorem for Secrecy over Linear Network Code for Active Attacks

We discuss the effect of sequential error injection on information leakage under a network code. We formulate a network code for the single transmission setting and the multiple transmission setting. Under this formulation, we show that the eavesdropper cannot improve the power of eavesdropping by sequential error injection when the operations in the network are linear operations. We demonstrate the usefulness of this reduction theorem by applying a concrete example of network.

cs.IT↗

arXiv2019

Algebra and Hilbert space structures induced by quantum probes

In the general setting of quantum controls, it is unrealistic to control all of the degrees of freedom of a quantum system. We consider a scenario where our direct access is restricted to a small subsystem $S$ that is constantly interacting with the rest of the system $E$. What we investigate here is the fundamental structure of the Hilbert space that is caused solely by the restrictedness of the direct control. We clarify the intrinsic space structure of the entire system and that of the operations which could be activated through $S$. The structures hereby revealed would help us make quantum control problems more transparent and provide a guide for understanding what we can implement. They can be deduced by considering an algebraic structure, which is the Jordan algebra formed from Hermitian operators, naturally induced by the setting of limited access. From a few very simple assumptions about direct operations, we elucidate rich structures of the operator algebras and Hilbert spaces that manifest themselves in quantum control scenarios.

quant-ph↗

arXiv2019

Asymmetric quantum multicast network coding: asymmetric optimal cloning over quantum networks

In this study, we consider a quantum version of multicast network coding as a multicast protocol for sending universal quantum clones (UQCs) from a source node to the target nodes on a quantum network. By extending Owari et al.'s previous results for symmetric UQCs, we derive a protocol for multicasting $1\rightarrow 2$ ($1\rightarrow 3$) {\it asymmetric} UQCs of a $q^r$-dimensional state to two (three) target nodes.Our protocol works under the condition that each edge on a quantum network represented by an undirected graph $G$ transmits a $q$-dimensional state. There exists a classical solvable linear multicast network code with a source rate of $r$ on a classical network $G'$, where $G$ is an undirected underlying graph of an acyclic directed graph $G'$. We also assume free classical communication over a quantum network.

quant-ph↗

arXiv2018

Secrecy and Robustness for Active Attack in Secure Network Coding and its Application to Network Quantum Key Distribution

In network coding, we discuss the effect of sequential error injection on information leakage. We show that there is no improvement when the operations in the network are linear operations. However, when the operations in the network contains non-linear operations, we find a counterexample to improve Eve's obtained information. Furthermore, we discuss the asymptotic rate in a linear network under the secrecy and robustness conditions as well as under the secrecy condition alone. Finally, we apply our results to network quantum key distribution, which clarifies the type of network that enables us to realize secure long distance communication via short distance quantum key distribution.

cs.IT↗

arXiv2017

Entanglement-assisted classical communication can simulate classical communication without causal order

Phenomena induced by the existence of entanglement, such as nonlocal correlations, exhibit characteristic properties of quantum mechanics distinguishing from classical theories. When entanglement is accompanied by classical communication, it enhances the power of quantum operations jointly performed by two spatially separated parties. Such a power has been analyzed by the gap between the performances of joint quantum operations implementable by local operations at each party connected by classical communication with and without the assistance of entanglement. In this work, we present a new formulation for joint quantum operations connected by classical communication beyond special relativistic causal order but without entanglement and still within quantum mechanics. Using the formulation, we show that entanglement assisting classical communication necessary for implementing a class of joint quantum operations called separable maps can be interpreted to simulate "classical communication" not respecting causal order. Our results reveal a new counter-intuitive aspect of entanglement related to spacetime.

quant-ph↗

arXiv2017

Secure Quantum Network Coding on Butterfly Network

Quantum network coding on the butterfly network has been studied as a typical example of quantum multiple cast network. We propose secure quantum network coding on the butterfly network in the multiple unicast setting based on a secure classical network coding. This protocol certainly transmits quantum states when there is no attack. We also show the secrecy even when the eavesdropper wiretaps one of the channels in the butterfly network.

quant-ph↗

arXiv2016

Tight asymptotic bounds on local hypothesis testing between a pure bipartite state and the white noise state

We consider asymptotic hypothesis testing (or state discrimination with asymmetric treatment of errors) between an arbitrary fixed bipartite pure state $\ketΨ$ and the completely mixed state under one-way LOCC (local operations and classical communications), two-way LOCC, and separable POVMs. As a result, we derive the Hoeffding bounds under two-way LOCC POVMs and separable POVMs. Further, we derive a Stein's lemma type of optimal error exponents under one-way LOCC, two-way LOCC, and separable POVMs up to the third order, which clarifies the difference between one-way and two-way LOCC POVM. Our study gives a very rare example in which the optimal performance under the infinite-round two-way LOCC is also equal to that under separable operations and can be attained with two-round communication, but not attained with the one-way LOCC.

quant-ph↗

arXiv2014

Asymptotic local hypothesis testing between a pure bipartite state and the completely mixed state

In this paper, we treat an asymptotic hypothesis testing (or state discrimination with asymmetric treatment of errors) between an arbitrary fixed bipartite pure state and the completely mixed state by one-way LOCC, two-way LOCC, and separable POVMs. As a result, we derive single-letterized formulas for the Stein's lemma type of optimal error exponents under one-way LOCC, two-way LOCC and separable POVMs, the Chernoff bounds under one-way LOCC POVMs and separable POVMs, and the Hoeffding bounds under one-way LOCC POVMs in the whole region of a parameter and under separable POVMs on a restricted region of a parameter. We also numerically calculate the Chernoff and the Hoeffding bounds under a class of three-step LOCC protocols in low-dimensional systems and show that these bounds not only outperform the bounds for one-way LOCC POVMs but also almost approximates the bounds for separable POVMs in the parameter region where analytical bounds for separable POVMs are derived.

quant-ph↗

arXiv2014

Probing untouchable environment as a resource for quantum computing

When manipulating a quantum system $S$, its surrounding system, or \textit{environment}, $E$ induces unwanted effects. It is mainly due to its vastness and the lack of knowledge about the Hamiltonian $H_{SE}$ that governs the dynamics inside $E$ and the interaction with $S$. The detail of $H_{SE}$ is usually extremely hard to identify, since $E$ can hardly be measured or controlled directly. Nevertheless, here we show that it is possible to probe and control a part of, if not all, the dynamics involving $E$, within the timescale in which its effective dimension can be seen finite. That is, we may be able to let a noisy environment work in our favor as a part of quantum computer.

quant-ph↗

arXiv2010

Local hypothesis testing between a pure bipartite state and the white noise state

In this paper, we treat a local discrimination problem in the framework of asymmetric hypothesis testing. We choose a known bipartite pure state $\ketΨ$ as an alternative hypothesis, and the completely mixed state as a null hypothesis. As a result, we analytically derive an optimal type 2 error and an optimal POVM for one-way LOCC POVM and Separable POVM. For two-way LOCC POVM, we study a family of simple three-step LOCC protocols, and show that the best protocol in this family has strictly better performance than any one-way LOCC protocol in all the cases where there may exist difference between two-way LOCC POVM and one-way LOCC POVM.

quant-ph↗

arXiv2009

The geometric measure of entanglement for a symmetric pure state with positive amplitudes

In this paper for a class of symmetric multiparty pure states we consider a conjecture related to the geometric measure of entanglement: 'for a symmetric pure state, the closest product state in terms of the fidelity can be chosen as a symmetric product state'. We show that this conjecture is true for symmetric pure states whose amplitudes are all non-negative in a computational basis. The more general conjecture is still open.

quant-ph↗