Searcharxiv⌕ Search

arXiv subjects

Tsubasa Ichikawa

Publications and source records attributed to Tsubasa Ichikawa.

At least 19 recordsLinked to original sources
arXiv2025

Bayesianism, Conditional Probability and Laplace Law of Succession in Quantum Mechanics

We present a comparative study between classical probability and quantum probability from the Bayesian viewpoint, where probability is construed as our rational degree of belief on whether a given statement is true. From this viewpoint, including conditional probability, three issues are discussed: i) Given a measure of the rational degree of belief, does it satisfy the axioms of the probability? ii) Given the probability satisfying these axioms, is it seen as the measure of the rational degree of belief? iii) Can the measure of the rational degree of belief be evaluated in terms of the relative frequency of events occurring? Here we show that as with the classical probability, all these issues can be resolved affirmatively in the quantum probability, provided that the relation to the relative frequency is slightly modified from the Laplace law of succession in case of a small number of observations. This implies that the relation between the Bayesian probability and the relative frequency in quantum mechanics is the same as that in the classical probability theory, including conditional probability.

quant-ph↗
arXiv2024

Indistinguishability between quantum randomness and pseudo-randomness under efficiently calculable randomness measures

We present a no-go theorem for the distinguishability between quantum random numbers (i.e., random numbers generated quantum mechanically) and pseudo-random numbers (i.e., random numbers generated algorithmically). The theorem states that one cannot distinguish these two types of random numbers if the quantum random numbers are efficiently classically simulatable and the randomness measure used for the distinction is efficiently computable. We derive this theorem by using the properties of cryptographic pseudo-random number generators, which are believed to exist in the field of cryptography. Our theorem is found to be consistent with the analyses on the actual data of quantum random numbers generated by the IBM Quantum and also those obtained in the Innsbruck experiment for the Bell test, where the degrees of randomness of these two set of quantum random numbers turn out to be essentially indistinguishable from those of the corresponding pseudo-random numbers. Previous observations on the algorithmic randomness of quantum random numbers are also discussed and reinterpreted in terms of our theorems and data analyses.

quant-ph↗
arXiv2023

A comprehensive survey on quantum computer usage: How many qubits are employed for what purposes?

Quantum computers (QCs), which work based on the law of quantum mechanics, are expected to be faster than classical computers in several computational tasks such as prime factoring and simulation of quantum many-body systems. In the last decade, research and development of QCs have rapidly advanced. Now hundreds of physical qubits are at our disposal, and one can find several remarkable experiments actually outperforming the classical computer in a specific computational task. On the other hand, it is unclear what the typical usages of the QCs are. Here we conduct an extensive survey on the papers that are posted in the quant-ph section in arXiv and claim to have used QCs in their abstracts. To understand the current situation of the research and development of the QCs, we evaluated the descriptive statistics about the papers, including the number of qubits employed, QPU vendors, application domains and so on. Our survey shows that the annual number of publications is increasing, and the typical number of qubits employed is about six to ten, growing along with the increase in the quantum volume (QV). Most of the preprints are devoted to applications such as quantum machine learning, condensed matter physics, and quantum chemistry, while quantum error correction and quantum noise mitigation use more qubits than the other topics. These imply that the increase in QV is fundamentally relevant, and more experiments for quantum error correction, and noise mitigation using shallow circuits with more qubits will take place.

quant-ph↗
arXiv2023

Quantum statistical effect induced through conditioned post-processing procedures with unitary $t$-designs

We propose a few-body quantum phenomenon, which manifests itself through stochastic state preparations and measurements followed by a conditioned post-processing procedure. We show two experimental protocols to implement these phenomena with existing quantum computers, and examine their feasibility by using simulations. Our simulation results suggest that the experimental demonstration is feasible if we repeat the state preparations and measurements about thirty thousand times to three-qubit systems.

quant-ph↗
arXiv2022

Bibliometric analysis of topic structure in quantum computation and quantum algorithm research

We present a bibliometric analysis of the research papers on quantum computation and quantum algorithms published in 1985-2020. We identify three distinct periods from the trend of the annual number of published papers, and show the 20 top contributing countries in each period in terms of the number of publications and the number of total citations. The bibliographic coupling network of the publications in the latest period is characterized as a dense, small-world network with a small diameter, which contains 14 large communities, whose topics are the fabrication of qubits in various physical systems, studies of the quantum algorithms, and other related topics. Quantum machine learning, one of the emerging topics in quantum computation, is found to be the fifth-largest independent community.

physics.soc-ph↗
arXiv2021

On the Feasibility of Bell Inequality Violation at ATLAS Experiment with Flavor Entanglement of $B^{0}\bar{B}^{0}$ Pairs from $pp$ Collisions

We examine the feasibility of the Bell test (i.e., detecting a violation of the Bell inequality) with the ATLAS detector in Large Hadron Collider (LHC) at CERN through the flavor entanglement between the B mesons. After addressing the possible issues that arise associated with the experiment and how they may be treated based on an analogy with conventional Bell tests, we show in our simulation study that under realistic conditions (expected from the LHC Run 3 operation) the Bell test is feasible under mild assumptions. The definitive factor for this promising result lies primarily in the fact that the ATLAS detector is capable of measuring the decay times of the B mesons independently, which was not available in the previous experiment with the Belle detector at KEK. This result suggests the possibility of the Bell test in much higher energy domains and may open up a new arena for experimental studies of quantum foundations.

hep-ph↗
arXiv2020

Born Rule and Logical Inference in Quantum Mechanics

Logical inference leads to one of the major interpretations of probability theory called logical interpretation, in which the probability is seen as a measure of the plausibility of a logical statement under incomplete information. In this paper, assuming that our usual inference procedure makes sense for every set of logical propositions represented in terms of commuting projectors on a given Hilbert space, we extend the logical interpretation to quantum mechanics and derive the Born rule. Our result implies that, from the epistemological viewpoints, we can regard quantum mechanics as a natural extension of the classical probability.

quant-ph↗
arXiv2020

Concatenated Composite Pulses Applied to Liquid-State Nuclear Magnetic Resonance Spectroscopy

The error-robust and short composite operations named ConCatenated Composite Pulses (CCCPs), developed as high-precision unitary operations in quantum information processing (QIP), are derived from composite pulses widely employed in nuclear magnetic resonance (NMR). CCCPs simultaneously compensate for two types of systematic errors, which was not possible with the known composite pulses in NMR. Our experiments demonstrate that CCCPs are powerful and versatile tools not only in QIP but also in NMR.

physics.chem-ph↗
arXiv2016

Multi-partite squash operation and its application to device-independent quantum key distribution

The squash operation, or the squashing model, is a useful mathematical tool for proving the security of quantum key distribution systems using practical (i.e., non-ideal) detectors. At the present, however, this method can only be applied to a limited class of detectors, such as the threshold detector of the Bennett-Brassard 1984 type. In this paper we generalize this method to include multi-partite measurements, such that it can be applied to a wider class of detectors. We demonstrate the effectiveness of this generalization by applying it to the device-independent security proof of the Ekert 1991 protocol, and by improving the associated key generation rate. For proving this result we use two physical assumptions, namely, that quantum mechanics is valid, and that Alice's and Bob's detectors are memoryless.

quant-ph↗
arXiv2014

Construction of Arbitrary Robust One-Qubit Operations Using Planar Geometry

We show how to construct an arbitrary robust one-qubit unitary operation with a control Hamiltonian of $A_x(t) σ_x + A_y(t) σ_y$, where $σ_i$ is a Pauli matrix and $A_i(t)$ is piecewise constant. Our method, based on planar geometry, admits a simple and intuitive interpretation. Furthermore, the total execution time and the number of elementary gates of the obtained sequence are comparable to those of the shortest known concatenated composite pulses.

quant-ph↗
arXiv2013

Universal Separability and Entanglement in Identical Particle Systems

Entanglement is known to be a relative notion, defined with respect to the choice of physical observables to be measured (i.e., the measurement setup used). This implies that, in general, the same state can be both separable and entangled for different measurement setups, but this does not exclude the existence of states which are separable (or entangled) for all possible setups. We show that for systems of bosonic particles there indeed exist such universally separable states: they are i.i.d. pure states. In contrast, there is no such state for fermionic systems with a few exceptional cases. We also find that none of the fermionic and bosonic systems admits universally entangled states.

quant-ph↗
arXiv2013

Quantum Game Theory Based on the Schmidt Decomposition

We present a novel formulation of quantum game theory based on the Schmidt decomposition, which has the merit that the entanglement of quantum strategies is manifestly quantified. We apply this formulation to 2-player, 2-strategy symmetric games and obtain a complete set of quantum Nash equilibria. Apart from those available with the maximal entanglement, these quantum Nash equilibria are extensions of the Nash equilibria in classical game theory. The phase structure of the equilibria is determined for all values of entanglement, and thereby the possibility of resolving the dilemmas by entanglement in the game of Chicken, the Battle of the Sexes, the Prisoners' Dilemma, and the Stag Hunt, is examined. We find that entanglement transforms these dilemmas with each other but cannot resolve them, except in the Stag Hunt game where the dilemma can be alleviated to a certain degree.

quant-ph↗
arXiv2013

Minimal and Robust Composite Two-Qubit Gates with Ising-Type Interaction

We construct a minimal robust controlled-NOT gate with an Ising-type interaction by which elementary two-qubit gates are implemented. It is robust against inaccuracy of the coupling strength and the obtained quantum circuits are constructed with the minimal number (N=3) of elementary two-qubit gates and several one-qubit gates. It is noteworthy that all the robust circuits can be mapped to one-qubit circuits robust against a pulse length error. We also prove that a minimal robust SWAP gate cannot be constructed with N=3, but requires N=6 elementary two-qubit gates.

quant-ph↗
arXiv2012

Concatenated composite pulses compensating simultaneous systematic errors

In NMR experiments and quantum computation, many pulse (quantum gate) sequences called the composite pulses, were developed to suppress one of two dominant errors; a pulse length error and an off-resonance error. We describe, in this paper, a general prescription to design a single-qubit concatenated composite pulse (CCCP) that is robust against two types of errors simultaneously. To this end, we introduce a new property, which is satisfied by some composite pulses and is sufficient to obtain a CCCP. Then we introduce a general method to design CCCPs with shorter execution time and less number of pulses.

quant-ph↗
arXiv2012

Geometric Aspects of Composite Pulses

Unitary operations acting on a quantum system must be robust against systematic errors in control parameters for reliable quantum computing. Composite pulse technique in nuclear magnetic resonance (NMR) realises such a robust operation by employing a sequence of possibly poor quality pulses. In this article, we demonstrate that two kinds of composite pulses, one compensates for a pulse length error in a one-qubit system and the other compensates for a J-coupling error in a twoqubit system, have vanishing dynamical phase and thereby can be seen as geometric quantum gates, which implement unitary gates by the holonomy associated with dynamics of cyclic vectors defined in the text.

quant-ph↗
arXiv2012

Outcome Independence of Entanglement in One-Way Computation

We show that the various intermediate states appearing in the process of one-way computation at a given step of measurement are all equivalent modulo local unitary transformations. This implies, in particular, that all those intermediate states share the same entanglement irrespective of the measurement outcomes, indicating that the process of one-way computation is essentially unique with respect to local quantum operations.

quant-ph↗
arXiv2011

Designing Robust Unitary Gates: Application to Concatenated Composite Pulse

We propose a simple formalism to design unitary gates robust against given systematic errors. This formalism generalizes our previous observation [Y. Kondo and M. Bando, J. Phys. Soc. Jpn. 80, 054002 (2011)] that vanishing dynamical phase in some composite gates is essential to suppress amplitude errors. By employing our formalism, we naturally derive a new composite unitary gate which can be seen as a concatenation of two known composite unitary operations. The obtained unitary gate has high fidelity over a wider range of the error strengths compared to existing composite gates.

quant-ph↗