Tutorials
Room1, Monday, 17 September, 2007
Tutorial 1 9:00-12:00 TU-1 Advanced Control and Signal Processing Paradigms in the New Millennium for Nano-Bio-Communication and Information Processing Systems
Tutorial 2 13:00-16:00 TU-2 Quantum Information, Measurement and Computing

Price List
    (Before Jul.31) (After Aug.1)
Conference Attendee (Member) 1 Tutorial 5,000 JPY 6,000 JPY
2 Tutorials 8,000 JPY 10,000 JPY
Conference Attendee (Non-Member) 1 Tutorial 6,000 JPY 7,000 JPY
2 Tutorials 9,000 JPY 11,000 JPY
Tutorial Only (Member) 1 Tutorial 8,000 JPY 9,000 JPY
2 Tutorials 11,000 JPY 13,000 JPY
Tutorial Only (Non-Member) 1 Tutorial 9,000 JPY 10,000 JPY
2 Tutorials 12,000 JPY 14,000 JPY

TU-1 9:00-12:00 Monday, 17 September, 2007
Advanced Control and Signal Processing Paradigms in the New Millennium for Nano-Bio-Communication and Information Processing Systems
Jian-Qin LIU (Natl. Inst.Info.&Comm., Japan) & Katsunori SHIMOHARA (DoshishaUniv., Japan)
Abstract
In the era of ubiquitous communications, control theory and signal processing technology historically accelerated by industrial automation are now summoned by the state-of-the-art of nanotechnology and molecular biology, which are expected for building molecular ICT (Information and Communication Technology) systems in nano-size and/or on the basis of biological mechanism.
This tutorial is arranged to focusing on the informatics essential of the nano-bio-world being explored by nanotechnology and molecular biology, which is presented on the following key-factors:
(a) Signal Processing and Automatic Control for Nano-machines;
(b) Biomolecular Information Processing;
(c) Information Theory and Communication Engineering for Cellular Communication Systems;
(d) Biomolecular Computing.
The tutorial is expected as a bridge between different disciplines of SICE and broad applications in industries.
The prerequisite knowledge: the basic knowledge of signal processing and control theory.
The necessary knowledge on nanotechnology and molecular biology will be presented as an introduction in the tutorial.
Overviews of the Contents:
1. On the Kernels of ICT: The Needs and Challenges of Nano-biotechnology in the Ubiquitous Society
2. Signaling Processing and Control Engineering for ICT
3. Preliminaries on Nanotechnology and Molecular Biology
3.1 Basic Concepts of Nanobiotechnology
3.2 Nanotechnology and frontiers material sciences
3.3 Advanced Topics of Molecular Biology
4. Nano-manipulation and Nano-electronics: Industrial Automation by Nanotechnology
4.1 Molecular Motors
4.2 Nano-machines in general
4.3 What kinds of signaling processing and automatic control technologies are needed for nano-machines?
5. Looking at the Biomolecular Information Processing Mechanism in vitro and in vivo
5.1 Uniqueness of Biomolecular Signaling in Living Cells
5.2 Observing Nonlinear Behaviors of Cells in the Eyes of Complex Systems
5.3 Molecular Signaling Processing in Terms of Systems Biology
5.4 Nanobio-Cybernetics
5.5 From Molecular Chemotaxis to Molecular Sensor Networks in the Nature
5.6 Signal Transduction Network: Being Mobile, Ad Hoc, and Autopoietic
5.7 An Example: Reconstruction of Phosphorylation/dephosphorylation Pathway network
5.8 Bioinformatics for Signaling Pathways: Approaches to Understanding the Molecular Mechanism of Living Cells
6. Information Theory and Communication Engineering for Engineered Cellular Communication Systems
6.1 Preliminaries on Mathematical Aspects of Information Theory
6.2 Computational Nanobio-informatic
6.3 Information-Theoretic Approaches to Modeling the Cellular Communication Processes
6.4 Moleware Coding and Its Information Capacity: How Far Away from the Shannon Limit
6.5 Comparison of Nanobio-Communication Systems in the Nature and the Tools in Telecommunication Engineering
7. Biomolecular Computing
7.1 Data Structure, Automata and Formal Languages for Biomolecular Computing
7.2 Algorithm Design and Complexity Analysis of Biomolecular Computing
7.3 Branches of Biomolecular Computing
7.4 Reliability versus Robustness of Biological Signaling Processes
7.5 Biomolecular Computing toward Molecular Biomedical Engineering
8. Perspective -- Integrating Automatic Control, Signal Processing, Communication and Computation for Nanobio-ICT

TU-2 13:00-16:00 Monday, 17 September, 2007
Quantum Information, Measurement and Computing

Osamu Hirota (Tamagawa Univ., Japan) & Hideaki Matsueda (Kohchi Univ., Japan)

Lecture 1:

Quantum Communication Theory and Its Application to High Speed Quantum Stream Cipher
Osamu Hirota, Research Center for Quantum Information Science, Tamagawa University, Japan

Abstract
Although the cryptanalysis on the conventional ciphers still requires an unreasonable amount of time with all current technology, these ciphers may be decrypted by new technological or mathematical advances. A scheme of one time pad forwarded by quantum key distribution(QKD) is one of candidates to attain provable security. However, this essentially suffers from technical imperfections that limit the desirable Gbps key rates, networking, and system stability. In addition, a symmetric key cipher forwarded by QKD cannot improve the essential security. So a system based on QKD has no meaning in being applied to the infrastructure networks in the real world.
Meanwhile, in 2000, a new concept of quantum cryptography was proposed. It is a kind of stream cipher randomized by quantum noise at quantum measurement for signals with coherent state. The scheme is called Y-00 protocol(Y-00) or αη scheme[1] which consists of M-ary modulator for coherent states signals and pseudo random number generator(PRNG) as a driver for basis selection in the modulator. The most simple form consisting of a modulator and a linear feedback shift register(LFSR) is the basic model for an explanation of the principle. The total security is designed by controlling the quantum noise effect based on the quantum communication theory[2].
Y-00 protocol might be an attractive newquan tum cryptography which can realize the ultra high speed data encryption for optical networks. In fact, so far, many remarkable experiments by the basic model have been demonstrated by using phase modulation[3,4] and intensity modulation schemes [4]. Recently we have demonstrated Y-00 data encryption system of 2.5 Gbps, 50 Km long in a metropolitan network [6].
If this type of the quantum cryptography has provable security, it will be immediately applied to the real optical networks, because it can be implemented by conventional optical communication devices. To realize an ultimate security which means unbreakable in the real world, we need a general model of Y-00 which consists of a general encryption box as a driver and additional randomizations[7].
Y-00 under the conventional optical communication region does not aim at the prefect secrecy. It rather aims at an ultimate security under the fixed short key. It corresponds to the establishment of a newtheory for encryption protocol. Even if the one time pad has the perfect secrecy, it is not attractive in the real world, because it requires H(K) = H(X) and also systems are unstable and inefficient.
The purpose of this talk is to give an introduction for what kind of general property is attained by Y-00 when an operation is limited only to one period of the PRNG as the driver of Y-00. That is, N <2|Ks| − 1 where N is a length of running key sequence.
Thus, we will explain a differences of security between Y-00 and conventional mathematical encryptions based on our recent results on quantum communication theory [8,9,10,11].
[1] H.P.Yuen, arXiv e-print quant-ph/0311061V6, LANL, 2003.
[2] C.W.Helstrom, Quantum detection and estimation theory, Academic Press, 1976
[3] G.A.Barbosa, E.Corndorf, P.Kumar, and H.P.Yuen, Phys. Rev. Lett., vol-90, 227901-4, 2003
[4] E.Corndorf, C.Liang, G.S.Kanter, P.Kumar, and H.P.Yuen, Physical Review A, vol 71, 062326, 2005.
[5] O.Hirota, M.Sohma, M.Fuse, and K.Kato, Physical Review A, vol 72, 022335, 2005
[6] S. Akutsu, T.Hosoi, Y.Doi, M.Honda, and K.Harasawa, Digest of QCMC-06, November, Tsukuba, 2006
[7] O.Hirota, and K.Kurosawa, Quantum Information Processing, vol-6, pp81-91,2007, quant-ph/0604036
[8] K.Kato, M.Osaki, M.Sasaki, and O.Hirota, IEEE. Trans. Communication, vol 47, no-2, p248, 1999
[9] M.Sasaki, K.Kato, M.Izutsu, and O.Hirota, Physical Review A, vol 58, no-1, pp146-158, 1998
[10] M.Sasaki, T.Usuda, M.Izutsu, and O.Hirota, Physical Review A, vol 58, no-1, pp159-164, 1998
[11] M.Sasaki, R.Momose, and O.Hirota, Physical Review A, vol 58, no-1, pp146-158, 1998
Lecture 2

Quantum Computing towards Solid State Realization
Hideaki Matsueda, Department of Information Science, Kochi University, Japan

Abstract
The concept of quantum computing may owe much to Paul Benioff who showed a Hamiltonian model of Turing machine in 1980 [1] and Richard P. Feynman who proposed logically reversible gates such as CN (controlled not) and CCN (controlled controlled not) gates and a configuration of a ballistic quantum computer in 1985 [2].
David Deutsch extended these discussions to propose quantum networks in terms of matrix algebra [3].  The implimentations of these ideas in practical problems were proposed by Peter W. Shor for factoring a large number in 1994 [4], and by Lov K. Grover for database search in 1997 [5].  The physical realization of quantum computing has been pursued in some different ways [6], including methods of an atomic array levitated in a vacuum, nuclear magnetic spin array, superconducting states, nonlinear optics, and optoelectronic interactions among non-identical quantum dots assisted by virtual photons as the resonance dynamic multipole-multipole interaction (RDMMI) [7][8].
In this lecture, after a brief history of quantum computing, the principles of quantum computing, i.e. quantum superposition and quantum correlation that yield quantum entanglement, are discussed.  Then, a provisional structure of quantum computer will be illustrated, and the power and future possibility of quantum computing will be suggested, together with the application to the measurement, instrumentation and control.
[1] P. Benioff, "The Computer as a Physical System: A Microscopic Quantum Mechanical Hamiltonian Model of Computers as Represented by Turing Machines", J. Statistical Phys., 22 (3), (1980) pp.563-591
[2] R. P. Feynman, "Quantum Mechanical Computers", Optics News (Feb., 1985) pp.11-20
[3] D. Deutsch, "Quantum Computation Networks", Proc. Royal Soc. London, A 425 (1989) pp.73-90
[4] P. W. Shor, "Algorism for Quantum Computation: Discrete Logarithms and Factoring", Proc. 35th Annual Symposium on the Foundation of Computer Sci., ed. S. Goldwasser (IEEE Computer Society Press, Los Alamitos, CA, 1994) pp.124-134
[5] L. K. Grover, "Quantum Mechanics Helps in Searching for a Needle in a Haystack", Phys. Rev. Lett., {\bf 79} (2), (1997) pp.325-328
[6] H. Matsueda, "Solid State Quantum Computation", Chap.10 of Coherence and Statistics of Photons and Atoms, ed. Jan Perina (John Wiley, New York, 2001) pp.422-469
[7] H. Matsueda, K. Leosson, Z. Xu, J. M. Hvam, Y. Ducommun, A. Hartmann, and E. Kapon, "Dynamic Dipole-Dipole Interactions between Excitons in Quantum Dots of Different Sizes", IEEE Transactions on Nanotechnology, 3 (2), pp.318-327 (2004)
[8] H. Matsueda, "Multipolar Photonic Interactions between Quantum Dots of Different Sizes", Proc. 2006 MRS Fall Meeting