Searcharxiv⌕ Search

arXiv subjects

Keiji Matsumoto

Publications and source records attributed to Keiji Matsumoto.

At least 91 records · Page 5Linked to original sources
arXiv2003

Statistical Model with Measurement Degree of Freedom and Quantum Physics

This is an English translation of the manuscript which appeared in Surikaiseki Kenkyusho Kokyuroku No. 1055 (1998). The asymptotic efficiency of statistical estimate of unknown quantum states is discussed, both in adaptive and collective settings. Aaptive bounds are written in sigle letterized form, and collective bounds are written in limitting expression. Our arguments clarify mathematical regularity conditions.

quant-ph↗
arXiv2003

Quantum Multi-Prover Interactive Proof Systems with Limited Prior Entanglement

This paper gives the first formal treatment of a quantum analogue of multi-prover interactive proof systems. It is proved that the class of languages having quantum multi-prover interactive proof systems is necessarily contained in NEXP, under the assumption that provers are allowed to share at most polynomially many prior-entangled qubits. This implies that, in particular, if provers do not share any prior entanglement with each other, the class of languages having quantum multi-prover interactive proof systems is equal to NEXP. Related to these, it is shown that, in the case a prover does not have his private qubits, the class of languages having quantum single-prover interactive proof systems is also equal to NEXP.

cs.CC↗
arXiv2003

Remarks on additivity of the Holevo channel capacity and of the entanglement of formation

The purpose of these notes is to discuss the relation between the additivity questions regarding the quantities (Holevo) capacity of a quantum channel T and entanglement of formation of a given bipartite state. In particular, using the Stinespring dilation theorem, we give a formula for the channel capacity involving entanglement of formation. This can be used to show that additivity of the latter for some states can be inferred from the additivity of capacity for certain channels. We demonstrate this connection for a family of group--covariant channels, allowing us to calculate the entanglement cost for many states, including some where a strictly smaller upper bound on the distillable entanglement is known. Group symmetry is used for more sophisticated analysis, giving formulas valid for a class of channels. This is presented in a general framework, extending recent findings of Vidal, Dur and Cirac (e-print quant-ph/0112131). We speculate on a general relation of superadditivity of the entanglement of formation, which would imply both the general additivity of this function under tensor products and of the Holevo capacity (with or without linear cost constraints).

quant-ph↗
arXiv2003

Disturbance of operation in quantum estimation for the Gaussian P-function

For the quantum Gaussian state family, Hayashi proposed a quantum mechanical operation using beam splitters to estimate the location and scale parameters of the P-function, and he showed that it is asymptotically optimal. In this paper, we analyze the effect of disturbance of his operation caused by the randomness of the transparency of the beam splitters. It is shown that even if the variance of the random transparency is small, Hayashi's estimators are improper in a sense that they are biased and asymptotically inconsistent. In such a case, we propose to stop the operation and correct the biases of estimators.

quant-ph↗
arXiv2002

Error exponents for entanglement concentration

Consider entanglement concentration schemes that convert n identical copies of a pure state into a maximally entangled state of a desired size with success probability being close to one in the asymptotic limit. We give the distillable entanglement, the number of Bell pairs distilled per copy, as a function of an error exponent, which represents the rate of decrease in failure probability as n tends to infinity. The formula fills the gap between the least upper bound of distillable entanglement in probabilistic concentration, which is the well-known entropy of entanglement, and the maximum attained in deterministic concentration. The method of types in information theory enables the detailed analysis of the distillable entanglement in terms of the error rate. In addition to the probabilistic argument, we consider another type of entanglement concentration scheme, where the initial state is deterministically transformed into a (possibly mixed) final state whose fidelity to a maximally entangled state of a desired size converges to one in the asymptotic limit. We show that the same formula as in the probabilistic argument is valid for the argument on fidelity by replacing the success probability with the fidelity. Furthermore, we also discuss entanglement yield when optimal success probability or optimal fidelity converges to zero in the asymptotic limit (strong converse), and give the explicit formulae for those cases.

quant-ph↗
arXiv2002

Phase-covariant quantum cloning of qudits

We study the phase-covariant quantum cloning machine for qudits, i.e. the input states in d-level quantum system have complex coefficients with arbitrary phase but constant module. A cloning unitary transformation is proposed. After optimizing the fidelity between input state and single qudit reduced density opertor of output state, we obtain the optimal fidelity for 1 to 2 phase-covariant quantum cloning of qudits and the corresponding cloning transformation.

quant-ph↗
arXiv2002

Simple construction of quantum universal variable-length source coding

We simply construct a quantum universal variable-length source code in which, independent of information source, both of the average error and the probability that the coding rate is greater than the entropy rate $H(rho_p)$, tend to 0. If $H(rho_p)$ is estimated, we can compress the coding rate to the admissible rate $H(rho_p)$ with a probability close to 1. However, when we perform a naive measurement for the estimation of $H(rho_p)$, the input state is demolished. By smearing the measurement, we successfully treat the trade-off between the estimation of $H(rho_p)$ and the non-demolition of the input state. Our protocol can be used not only for the Schumacher's scheme but also for the compression of entangled states.

quant-ph↗
arXiv2002

Simulating the Effects of Quantum Error-correction Schemes

It is important to protect quantum information against decoherence and operational errors, and quantum error-correcting (QEC) codes are the keys to solving this problem. Of course, just the existence of codes is not efficient. It is necessary to perform operations fault-tolerantly on encoded states because error-correction process (i.e., encoding, decoding, syndrome measurement and recovery) itself induces an error. By using simulation, this paper investigates the effects of some important QEC codes (the five qubit code, the seven qubit code and the nine qubit code) and their fault-tolerant operations when the error-correction process itself induces an error. The corresponding results, statistics and analyses are presented in this paper.

quant-ph↗
arXiv2002

Quantify entanglement by concurrence hierarchy

We define the concurrence hierarchy as d-1 independent invariants under local unitary transformations in d-level quantum system. The first one is the original concurrence defined by Wootters et al in 2-level quantum system and generalized to d-level pure quantum states case. We propose to use this concurrence hierarchy as measurement of entanglement. This measurement does not increase under local quantum operations and classical communication.

quant-ph↗
arXiv2002

Experimental investigation of pulsed entangled photons and photonic quantum channels

The development of key devices and systems in quantum information technology, such as entangled particle sources, quantum gates and quantum cryptographic systems, requires a reliable and well-established method for characterizing how well the devices or systems work. We report our recent work on experimental characterization of pulsed entangled photonic states and photonic quantum channels, using the methods of state and process tomography. By using state tomography, we could reliably evaluate the states generated from a two-photon source under development and develop a highly entangled pulsed photon source. We are also devoted to characterization of single-qubit and two-qubit photonic quantum channels. Characterization of typical single-qubit decoherence channels has been demonstrated using process tomography. Characterization of two-qubit channels, such as classically correlated channels and quantum mechanically correlated channels is under investigation. These characterization techniques for quantum states and quantum processes will be useful for developing photonic quantum devices and for improving their performances.

quant-ph↗
arXiv2002

A New Strategy of Quantum-State Estimation for Achieving the Cramer-Rao Bound

We experimentally analyzed the statistical errors in quantum-state estimation and examined whether their lower bound, which is derived from the Cramer-Rao inequality, can be truly attained or not. In the experiments, polarization states of bi-photons produced via spontaneous parametric down-conversion were estimated employing tomographic measurements. Using a new estimation strategy based on Akaike's information criterion, we demonstrated that the errors actually approach the lower bound, while they fail to approach it using the conventional estimation strategy.

quant-ph↗
arXiv2002

Universal distortion-free entanglement concentration

Entanglement concentration from many copies of unknown pure states is discussed, and we propose the protocol which not only achieves entropy rate, but also produces the perfect maximally entangled state. Our protocol is induced naturally from symmetry of $n$-tensored pure state, and is optimal for all the protocols which concentrates entanglement from unknown pure states, in the sense of failure probability. In the proof of optimality, the statistical estimation theory plays a key role, for concentrated entanglement gives a natural estimate of the entropy of entanglement.

quant-ph↗
arXiv2002

Quantum universal variable-length source coding

We construct an optimal quantum universal variable-length code that achieves the admissible minimum rate, i.e., our code is used for any probability distribution of quantum states. Its probability of exceeding the admissible minimum rate exponentially goes to 0. Our code is optimal in the sense of its exponent. In addition, its average error asymptotically tends to 0.

quant-ph↗
arXiv2002

Cloning of symmetric d-level photonic states in physical systems

Optimal procedures play an important role in quantum information. It turns out that some naturally occurring processes like emission of light from an atom can realize optimal transformations. Here we study how arbitrary symmetric states of a number of d-level systems can be cloned using a multilevel atomic system. It is shown that optimality is always ensured even though the output number of systems is probabilistic.

quant-ph↗
arXiv2002

General-Purpose Parallel Simulator for Quantum Computing

With current technologies, it seems to be very difficult to implement quantum computers with many qubits. It is therefore of importance to simulate quantum algorithms and circuits on the existing computers. However, for a large-size problem, the simulation often requires more computational power than is available from sequential processing. Therefore, the simulation methods using parallel processing are required. We have developed a general-purpose simulator for quantum computing on the parallel computer (Sun, Enterprise4500). It can deal with up-to 30 qubits. We have performed Shor's factorization and Grover's database search by using the simulator, and we analyzed robustness of the corresponding quantum circuits in the presence of decoherence and operational errors. The corresponding results, statistics and analyses are presented.

quant-ph↗