1-6hit |
Teruhiko YAMADA Tsuyoshi SASAKI
We have specified typical fabrication defects of the current injection logic gates with four Josephson junctions (4JL gates), and then investigated the voltage and current behavior of defective gates by SPICE simulation to evaluate the defect coverage achieved by logic testing and current testing. The simulation results show that current testing may possibly achieve a high defect coverage while logic testing cannot detect almost half defects.
A study on the limitation of optical communication systems has received much attention. A method to overcome the standard quantum limit is to apply non-standard quantum state, especially squeezed state. However, the advantage of the non-standard quantum state is degraded by the transmission energy loss. To cope with this problem, we have proposed a concept of the received quantum state control (RQSC), but the realization has some difficulties. In this paper, we propose a new system to realize the received quantum state control system, employing injection locked laser (ILL) system. Then we show that our new system can overcome the standard quantum limit.
Seitetsu BUN Tsuyoshi SASAKI Hideaki TSUSHIMA Osamu HIROTA Masao NAKAGAWA
Optical communication systems using quantum state control have received much attentions. For this quantum state control communication, however, one of the most serious problems is the effect of transmission loss which degrades the advantage of the quantum state controlled signal. In optical long transmission communications, in general, transmission loss is large so that the advantage using quantum state controlled signal is hardly lost and performance of quantum state control communications is almost equal to that of conventional communications. So it is necessaty for a new application of quantum state control to overcome the standard quantum limitation which is achieved by the conventional coherent communication system. In this paper, we propose a realization of a new optical communication system with received quantum state controller, so called Received Quantum State Control (RQSC) system, in order to cope with transmission loss problem. This system can provide the advantage of quantum state control regardless of amount of transmission loss. Particularly, it is shown that the system can overcome the standard quantum limitation which corresponds to the limitation achieved by conventional BPSK homodyne system using coherent state signal. This corresponds to Quantum Receiver" of the broad sense in Helstrom's receiver theory.
Takamitsu KUDO Tsuyoshi Sasaki USUDA Ichi TAKUMI Masayasu HATA
In this paper, we show that the principle of quantum cryptography can be applied not only to a key distribution scheme but also to a data transmission scheme. We propose a secure data transmission scheme in which an eavesdropping can be detected based on sharing the bases Alice (the sender) and Bob (the receiver) have. We also show properties of this scheme.
Yuji FUJIHARA Shigeru TATSUTA Tsuyoshi Sasaki USUDA Ichi TAKUMI Masayasu HATA
In quantum communication theory, a realization of the optimum quantum receiver that minimizes the error probability is one of fundamental problems. A quantum receiver is described by detection operators. Therefore, it is very important to derive the optimum detection operators for a realization of the optimum quantum receiver. In general, it is difficult to derive the optimum detection operators, except for some simple cases. In addition, even if we could derive the optimum detection operators, it is not trivial what device corresponds to the operators. In this paper, we show a realization method of a quantum receiver which is described by a projection-valued measure (PVM) and apply the method to 3-ary phase-shift-keyed (3PSK) coherent-state signals.
Shogo USAMI Tsuyoshi Sasaki USUDA Ichi TAKUMI Masayasu HATA
Recently, the quantum information theory attracts much attention. In quantum information theory, the existence of superadditivity in capacity of a quantum channel was foreseen conventionally. So far, some examples of codes which show the superadditivity in capacity have been clarified. However in present stage, characteristics of superadditivity are not still clear up enough. The reason is as follows. All examples were shown by calculating the mutual information by quantum combined measurement, so that one had to solve the eigenvalue and the eigenvector problems. In this paper, we construct a simplification algorithm to calculate the mutual information by using square-root measurement as decoding process of quantum combined measurement. The eigenvalue and the eigenvector problems are avoided in the algorithm by using group covariancy of binary linear codes. Moreover, we derive the analytical solution of the mutual information for parity check codes with any length as an example of applying the simplification algorithm.