Search

Much like classical supercomputers, scaling up quantum computers requires an optical interconnect. However, signal attenuation leads to irreversible qubit loss, making quantum interconnect design guidelines and metrics different from conventional computing. Inspired by the classical Dragonfly topology, we propose a multi-group structure where the group switch routes photons emitted by computational end nodes to the group's shared pool of Bell state analyzers (which conduct the entanglement swapping that creates end-to-end entanglement) or across a low-diameter path to another group. We present a full-stack analysis of system performance, a combination of distributed and centralized protocols, and a resource scheduler that plans qubit placement and communications for large-scale, fault-tolerant systems. We implement a prototype three-node switched interconnect and create two-hop entanglement with fidelities of at least 0.6. Our design emphasizes reducing network hops and optical components to simplify system stabilization while flexibly adjusting optical path lengths. Based on evaluated loss and infidelity budgets, we find that moderate-radix switches enable systems meeting expected near-term needs, and large systems are feasible. Our design is expected to be effective for a variety of quantum computing technologies, including ion traps and superconducting qubits with appropriate wavelength transduction., Comment: 14 pages, 11 figures, 5 tables

The optical Bell State Analyzer (BSA) plays a key role in the optical generation of entanglement in quantum networks. The optical BSA is effective in controlling the timing of arriving photons to achieve interference. It is unclear whether timing synchronization is possible even in multi-hop and complex large-scale networks, and if so, how efficient it is. We investigate the scalability of BSA synchronization mechanisms over multiple hops for quantum networks both with and without memory in each node. We first focus on the exchange of entanglement between two network nodes via a BSA, especially effective methods of optical path coordination in achieving the simultaneous arrival of photons at the BSA. In optical memoryless quantum networks, including repeater graph state networks, we see that the quantum optical path coordination works well, though some possible timing coordination mechanisms have effects that cascade to adjacent links and beyond, some of which was not going to work well of timing coordination. We also discuss the effect of quantum memory, given that end-to-end extension of entangled states through multi-node entanglement exchange is essential for the practical application of quantum networks. Finally, cycles of all-optical links in the network topology are shown to may not be to synchronize, this property should be taken into account when considering synchronization in large networks., Comment: 7 pages, 9 figures. Submitted to the IEEE Quantum Week 2024

Residual stress is an important factor governing evaluating and controlling the quality of metal materials in industrial products. X-ray measurements provide one of the most effective means of evaluating residual stress without destruction. In such measurements, the effects of residual stress on the crystal structure can be observed through the Debye ring deformation. In previous studies, we developed a residual stress measurement system based on the $cos \alpha$ method, using a two-dimensional (2D) silicon-on-insulator pixel (SOIPIX) detector known as INTPIX4. In a typical laboratory setup, this system requires only 1 second to measure a specified point. This is drastically faster than the conventional system based on the $sin^{2} \psi$ method, which requires more than 10 min, and the $cos \alpha$-based system using an imaging plate, which requires 1 min. Compared to other systems, it can evaluate the 2D distribution of residual stress faster and provide more detailed information for evaluating materials. We first attempted to measure the 2D distribution in a laboratory setup with a Cr X-ray tube (Cr K$\alpha$ 5.4 keV) and obtained satisfactory results. We subsequently took measurements using synchrotron monochromatic X-rays to determine the fine accuracy and fine sampling pitch distribution. In this paper, we report the results of the initial synchrotron experiment, including the residual stress distribution of the standard specimen obtained by the first prototype setup. Furthermore, we compare the synchrotron measurements with those from the laboratory., Comment: Presented at 12th International "Hiroshima" Symposium on the Development and Application of Semiconductor Tracking Detectors (HSTD12), Hiroshima, Japan

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., Comment: 29 pages, 4 figures, published version

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., Comment: 17 pages, 8 figures, 3 tables. title updated, minor revision

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., Comment: 7 pages, 4 figures

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., Comment: 32 pages, 3 figures, accepted version

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., Comment: 13 pages, 5 figures

Quantum key distribution (QKD) establishes secure links between remote communication parties. As a key problem for various QKD protocols, security analysis gives the amount of secure keys regardless of the eavesdropper's computational power, which can be done both analytically and numerically. Compared to analytical methods which tend to require techniques specific to each QKD protocol, numerical ones are more general since they can be directly applied to many QKD protocols without additional techniques. However, current numerical methods are carried out based on some assumptions such as working in asymptotic limit and collective attacks from eavesdroppers. In this work, we remove these assumptions and develop a numerical finite-size security analysis against general attacks for general QKD protocols. We also give an example of applying the method to the recent Phase-Matching QKD protocol with a simple protocol design. Our result shows that the finite-size key rate can surpass the linear key-rate bound in a realistic communication time., Comment: 19pages, 2 figures

In comparison to conventional discrete-variable (DV) quantum key distribution (QKD), continuous-variable (CV) QKD with homodyne/heterodyne measurements has distinct advantages of lower-cost implementation and affinity to wavelength division multiplexing. On the other hand, its continuous nature makes it harder to accommodate to practical signal processing, which is always discretized, leading to lack of complete security proofs so far. Here we propose a tight and robust method of estimating fidelity of an optical pulse to a coherent state via heterodyne measurements. We then construct a binary phase modulated CV QKD protocol and prove its security in the finite-key-size regime against general coherent attacks, based on proof techniques of DV QKD. Such a complete security proof achieves a significant milestone in exploiting the benefits of CV QKD., Comment: 12 pages, 4 figures

The random number generators (RNGs) are an indispensable tool in cryptography. Of various types of RNG method, those using radiations from nuclear decays (radioactive RNG) has a relatively long history but their security has never been discussed rigorously in the literature. In this paper we propose a new method of the radioactive RNG that admits a simple and rigorous proof of security. The security proof is made possible here by exploiting the parity (space inversion) symmetry arising in the device, which has previously been unfocused but is generically available for a nuclide which decays by parity-conserving interactions., Comment: 8 pages, 4 figures

To guarantee the security of quantum key distribution (QKD), several assumptions on light sources must be satisfied. For example, each random bit information is precisely encoded on an optical pulse and the photon-number probability distribution of the pulse is exactly known. Unfortunately, however, it is hard to check if all the assumptions are really met in practice, and it is preferable that we have minimal number of device assumptions. In this paper, we adopt the differential-phase-shift (DPS) QKD protocol and drastically mitigate the requirements on light sources. Specifically, we only assume the independence among emitted pulses, the independence of the vacuum emission probability from a chosen bit, and upper bounds on the tail distribution function of the total photon number in a single block of pulses for single, two and three photons. Remarkably, no other detailed characterizations, such as the amount of phase modulation, are required. Our security proof significantly relaxes demands for light sources, which paves a route to guarantee implementation security with simple verification of the devices., Comment: 10 pages, 2 figures

Blind quantum computation is a scheme that adds unconditional security to cloud quantum computation. In the protocol proposed by Broadbent, Fitzsimons, and Kashefi, the ability to prepare and transmit a single qubit is required for a user (client) who uses a quantum computer remotely. In case a weak coherent pulse is used as a pseudo single photon source, however, we must introduce decoy states, owing to the inherent risk of transmitting multiple photon. In this study, we demonstrate that by using a heralded single photon source and a probabilistic photon number resolving detector, we can gain a higher blind state generation efficiency and longer access distance, owing to noise reduction on account of the heralding signal., Comment: 15 pages, 6 figures

Among many quantum key distribution (QKD) protocols, the round-robin differential phase shift (RRDPS) protocol is unique in that it can upper-bound the amount of the information leakage without monitoring the signal disturbance. To expedite implementation of the protocol, however, the number of pulses forming a single block should be kept small, which significantly decreases the key rates in the original security proof. In the present paper, we refine the security proof of the RRDPS protocol in the finite-sized regime and achieve a tighter estimation for the information leakage without changing the original experimental setups. As a consequence, we obtain better key rates in both asymptotic and finite-sized cases while keeping the preferable features of the protocol, such as omission of phase randomization., Comment: 25 pages, 5 figures

Quantum key distribution (QKD) allows two distant parties to share secret keys with the proven security even in the presence of an eavesdropper with unbounded computational power. Recently, GHz-clock decoy QKD systems have been realized by employing ultrafast optical communication devices. However, security loopholes of high-speed systems have not been fully explored yet. Here we point out a security loophole at the transmitter of the GHz-clock QKD, which is a common problem in high-speed QKD systems using practical band-width limited devices. We experimentally observe the inter-pulse intensity correlation and modulation-pattern dependent intensity deviation in a practical high-speed QKD system. Such correlation violates the assumption of most security theories. We also provide its countermeasure which does not require significant changes of hardware and can generate keys secure over 100 km fiber transmission. Our countermeasure is simple, effective and applicable to wide range of high-speed QKD systems, and thus paves the way to realize ultrafast and security-certified commercial QKD systems.

Characterization of photon statistics of a light source is one of the most basic tools in quantum optics. Although the outcome from existing methods is believed to be a good approximation when the measured light is sufficiently weak, there is no rigorous quantitative bounds on the degree of the approximation. As a result, they fail to fulfill the demand arising from emerging applications of quantum information such as quantum cryptography. Here, we propose a calibration method to produce rigorous bounds for a photon-number probability distribution by using a conventional Hanbury-Brown-Twiss setup with threshold photon detectors. We present a general framework to treat any number of detectors and non-uniformity of their efficiencies. The bounds are conveniently given as closed-form expressions of the observed coincidence rates and the detector efficiencies. We also show optimality of the bounds for light with a small mean photon number. As an application, we show that our calibration method can be used for the light source in a decoy-state quantum key distribution protocol. It replaces the a priori assumption on the distribution that has been commonly used, and achieves almost the same secure key rate when four detectors are used for the calibration., Comment: 8 pages, 3 figures

We show the information-theoretic security proof of the differential-phase-shift (DPS) quantum key distribution (QKD) protocol based on the complementarity approach [arXiv:0704.3661 (2007)]. Our security proof provides a slightly better key generation rate compared to the one derived in the previous security proof in [arXiv:1208.1995 (2012)] that is based on the Shor-Preskill approach [Phys. Rev. Lett. ${\bf 85}$, 441 (2000)]. This improvement is obtained because the complementarity approach can employ more detailed information on Alice's sending state in estimating the leaked information to an eavesdropper. Moreover, we remove the necessity of the numerical calculation that was needed in the previous analysis to estimate the leaked information. This leads to an advantage that our security proof enables us to evaluate the security of the DPS protocol with any block size. This paper highlights one of the fundamental differences between the Shor-Preskill and the complementarity approaches., Comment: 15 pages, 5 figures

The round-robin differential phase shift (RRDPS) quantum key distribution (QKD) protocol is a unique quantum key distribution protocol whose security has not been understood through an information-disturbance trade-off relation, and a sufficient amount of privacy amplification was given independently of signal disturbance. Here, we discuss the security of the RRDPS protocol in the asymptotic regime when a good estimate of the bit error rate is available as a measure of signal disturbance. The uniqueness of the RRDPS protocol shows up as a peculiar form of information-disturbance trade-off curve. When the length of a block of pulses used for encoding and the signal disturbance are both small, it provides a significantly better key rate than that from the original security proof. On the other hand, when the block length is large, the use of the signal disturbance makes little improvement in the key rate. Our analysis will bridge a gap between the RRDPS protocol and the conventional QKD protocols., Comment: 14 pages, 4 figures

An essential step in quantum key distribution is the estimation of parameters related to the leaked amount of information, which is usually done by sampling of the communication data. When the data size is finite, the final key rate depends on how the estimation process handles statistical fluctuations. Many of the present security analyses are based on the method with simple random sampling, where hypergeometric distribution or its known bounds are used for the estimation. Here we propose a concise method based on Bernoulli sampling, which is related to binomial distribution. Our method is suitable for the BB84 protocol with weak coherent pulses, reducing the number of estimated parameters to achieve a higher key generation rate compared to the method with simple random sampling. We also applied the method to prove the security of the differential-quadrature-phase-shift (DQPS) protocol in the finite-key regime. The result indicates that, the advantage of the DQPS protocol over the phase-encoding BB84 protocol in terms of the key rate, which was previously confirmed in the asymptotic regime, persists in the finite-key regime., Comment: 13 pages, 5 figures

Many quantum key distribution (QKD) protocols require random choice of measurement basis for each pulse or each train of pulses. In some QKD protocols, such as the Round-Robin Differential Phase Shift (RRDPS) QKD protocol, this requirement is a bit challenging as randomly choosing hundreds of settings for every, say, 100 pulses may be too fast with current technologies. In this paper, we solve this issue by proving the security of QKD protocols with slow basis choice without compromising the secret key rate. We also show that the random choice of the bases for the state preparation can be made slow if the signals do not leak any information on the basis. Examples of QKD protocols that our technique can apply include the RRDPS protocol and BB84-type protocols, and our technique relaxes demands for the implementation of QKD systems., Comment: 7 pages, 4 figures

One of the simplest methods for implementing quantum key distribution over fiber-optic communication is the Bennett-Brassard 1984 protocol with phase encoding (PE-BB84 protocol), in which the sender uses phase modulation over double pulses from a laser and the receiver uses a passive delayed interferometer. Using essentially the same setup and by regarding a train of many pulses as a single block, one can carry out the so-called differential quadrature phase shift (DQPS) protocol, which is a variant of differential phase shift (DPS) protocols. Here we prove the security of the DQPS protocol based on an adaptation of proof techniques for the BB84 protocol, which inherits the advantages arising from the simplicity of the protocol, such as accommodating the use of threshold detectors and simple off-line calibration methods for the light source. We show that the secure key rate of the DQPS protocol in the proof is eight thirds as high as the rate of the PE-BB84 protocol., Comment: Citation of the Fig.1 in the text corrected

Stress measurement methods using X-ray diffraction (XRD methods) are based on so-called fundamental equations. The fundamental equation is described in the coordinate system that best suites the measurement situation, and, thus, making a comparison between different XRD methods is not straightforward. However, by using the diffraction vector representation, the fundamental equations of different methods become identical. Furthermore, the differences between the various XRD methods are in the choice of diffraction vectors and the way of calculating the stress from the measured data. The stress calculation methods can also be unified using the general least-squares method, which is a common least-squares method of multivariate analysis. Thus, the only difference between these methods turns out to be in the choice of the set of diffraction vectors. In light of these ideas, we compare three commonly used XRD methods: the sin^2 psi method, the XRD^2 method, and the cos alpha method using the estimation of the measurement errors.

Since the invention of Bennett-Brassard 1984 (BB84) protocol, many quantum key distribution (QKD) protocols have been proposed and some protocols are operated even in field environments. One of the striking features of QKD is that QKD protocols are provably secure unlike cryptography based on computational complexity assumptions. It has been believed that, to guarantee the security of QKD, Alice and Bob have to monitor the statistics of the measurement outcomes which are used to determine the amount of the privacy amplification to generate a key. Recently a new type of QKD protocol, called round robin differential phase shift (RRDPS) protocol, was proposed, and remarkably this protocol can generate a key without monitoring any statistics of the measurement outcomes. Here we report an experimental realization of the RRDPS protocol. We used a setup in which Bob randomly chooses one from four interferometers with different pulse delays so that he could implement phase difference measurements for all possible combinations with five-pulse time-bin states. Using the setup, we successfully distributed keys over 30 km of fiber, making this the first QKD experiment that does not rely on signal disturbance monitoring., Comment: 8 pages, 4 figures

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., Comment: 11 pages, 1 figure

We present a complex probability measure relevant for double (pairs of) states in quantum mechanics, as an extension of the standard probability measure for single states that underlies Born's statistical rule. When the double states are treated as the initial and final states of a quantum process, we find that Aharonov's weak value, which has acquired a renewed interest as a novel observable quantity inherent in the process, arises as an expectation value associated with the probability measure. Despite being complex, our measure admits the physical interpretation as mixed processes, i.e., an ensemble of processes superposed with classical probabilities., Comment: 7 pages, 1 figures

We present a general criterion for entanglement of N indistinguishable particles decomposed into arbitrary s subsystems based on the unambiguous measurability of correlation. Our argument provides a unified viewpoint on the entanglement of indistinguishable particles, which is still unsettled despite various proposals made mainly for the s = 2 case. Even though entanglement is defined only with reference to the measurement setup, we find that the so-called i.i.d. states form a special class of bosonic states which are universally separable., Comment: 6 pages, 3 figures, major revision

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., Comment: 6 pages, 4 figures

We present a criterion of separability for arbitrary s partitions of N-particle fermionic pure states. We show that, despite the superficial non-factorizability due to the antisymmetry required by the indistinguishability of the particles, the states which meet our criterion have factorizable correlations for a class of observables which are specified consistently with the states. The separable states and the associated class of observables share an orthogonal structure, whose non-uniqueness is found to be intrinsic to the multi-partite separability and leads to the non-transitivity in the factorizability in general. Our result generalizes the previous result obtained by Ghirardi et. al. [J. Stat. Phys. 108 (2002) 49] for the s = 2 and s = N case., Comment: 21 pages, 2 figures

We present a family of entanglement measures R_m which act as indicators for separability of n-qubit quantum states into m subsystems for arbitrary 2 \leq m \leq n. The measure R_m vanishes if the state is separable into m subsystems, and for m = n it gives the Meyer-Wallach measure while for m = 2 it reduces, in effect, to the one introduced recently by Love et al. The measures R_m are evaluated explicitly for the GHZ state and the W state (and its modifications, the W_k states) to show that these globally entangled states exhibit rather distinct behaviors under the measures, indicating the utility of the measures R_m for characterizing globally entangled states as well., Comment: 8 pages, 8 figures

Entanglement of multipartite systems is studied based on exchange symmetry under the permutation group S_N. With the observation that symmetric property under the exchange of two constituent states and their separability are intimately linked, we show that anti-symmetric (fermionic) states are necessarily globally entangled, while symmetric (bosonic) states are either globally entangled or fully separable and possess essentially identical states in all the constituent systems. It is also shown that there cannot exist a fully separable state which is orthogonal to all symmetric states, and that full separability of states does not survive under total symmetrization unless the states are originally symmetric. Besides, anyonic states permitted under the braid group B_N should also be globally entangled. Our results reveal that exchange symmetry is actually sufficient for pure states to become globally entangled or fully separable., Comment: 12 pages, appendix added