Abstract:
Principles of quantum soft computing, models of fast quantum searching algorithms and the possibility of its applications for intelligent control of micro-systems are int...Show MoreMetadata
Abstract:
Principles of quantum soft computing, models of fast quantum searching algorithms and the possibility of its applications for intelligent control of micro-systems are introduced. The description problem of searching and decision-making support processes from more fundamental mutual positions of the new information technologies and a modern physics, information physics, are discussed: (1) in the quantum information theory-the information complexity theory of random symbolic sequences, computation complexity, quantum searching algorithms; and (2) in the modern physics-nonequilibrium thermodynamics and quantum mechanics.
Date of Conference: 25-28 November 1998
Date Added to IEEE Xplore: 06 August 2002
Print ISBN:0-7803-5130-4
References is not available for this document.
Select All
1.
J. Preskill, "Quantum Information and Computation", Caltech, 1997.
2.
C. P. Williams and S. H. Clearwater, Explorations in Quantum Computing, N.Y.:Springer-Verlag, 1998.
3.
Β. Petrov, G. Ulanov, I. Goldenblat and S. V. Ulyanov, Advanced Control of Quantum and Relativistic Dynamic Systems: Physical and Information Aspects, Moscow:Nauka Publ., 1982.
4.
T. P. Spiller, "Quantum information processing: cryptography computation and teleportation", Proc. IEEE, vol. 84, pp. 1719-1946, 1996.
5.
A. Ekert and R. Jozsa, "Quantum computation and Shor's factoring algorithm", Rev. Modern Phys., vol. 68, pp. 733-768, 1996.
6.
R. Jozsa, "Quantum algorithms and the Fourier transform", Proc. R. Soc. Lond., vol. 454, pp. 323-337, 1998.
7.
E. Bernstein and U. Vazirani, "Quantum complexity theory", SIAM Computing, vol. 26, no. 5, pp. 1411-1473, 1997.
8.
L.M. Adleman, J. Demarrais and M.-D.A. Huang, "Quantum computability", SIAM Computing, vol. 26, no. 5, pp. 1524-1540, 1997.
9.
R. Cleve, A. Ekert, C. Macchiavello and M. Mosca, "Quantum algorithm revisited", Proc. R. Soc. Lond., vol. A 454, pp. 339-354, 1998.
10.
V. Vedral, A. Barenco and A. Ekert, "Quantum networks for elementary arithmetic operations", Phys. Rev., vol. A 54, no. 1, pp. 147-153, 1996.
11.
A. Steane, "Quantum computing", Rep. Prog. Phys., vol. 61, pp. 117-173, 1998.
12.
M. A. Nielsen, C. M. Caves, Β. Schumacher and H. Bamum, "Information-theoretic approach to quantum correction and reversible measurement", Proc. R. Soc. Lond., vol. 454A, pp. 277-304, 1998.
13.
C.H. Bennett, P. Cacs, M. Li, P.M.B. Vitanyi and W. Zurek, "Thermodynamics of computation and information distance", Proc. 28-th Annual ACM Symp. Theory of Computing, pp. 21-30, 1993-May-16-18.
14.
W.H. Zurek, "Thermodynamic cost of computation algorithmic complexity and the information metric", Nature, vol. 341, pp. 311-326, 1989.
15.
C.H. Bennett, "The thermodynamics of computation: A review", Int. J. Theoret. Physics, vol. 21, pp. 905-940, 1982.
16.
W.H. Zurek, "Algorithmic randomness and physical entropy", Phys. Rev., vol. A 40, pp. 4731-4751, 1989.
17.
S. Lloyd, "Quantum-mechanical Maxwell's demon", Phys. Rev., vol. A 56, no. 5, pp. 3374-3381, 1997.
18.
R. Landauer, "Energy needed to send a bit", Proc. R. Soc. Lond., vol. A 454, pp. 305-311, 1998.
19.
"The physical nature of information", Phys. Lett., vol. A 217, pp. 188-193, 1996.
20.
"Minimal energy requirements in communication", Science, vol. 272, pp. 1914-1918, 1996.
21.
J.D. Bekenstein, "Communication and energy", Phys. Rev., vol. D 37, no. 9, pp. 3437-3448, 1988.
22.
L. K. Graver, "A fast quantum mechanical algorithm for database search", Proc. 35-th Annual ACM on the Theory of Computing, pp. 212-219, 1996-May-22-24.
23.
"Quantum mechanics helps in searching for a needle in a haystack", Phys. Rev. Lett., vol. 79, pp. 325-328, 1997.
24.
I.L. Chuang, N. Gershenfeld and M. Kubinec, "Experimental implementation of fast quantum searching", Phys. Rev. Lett., vol. 80, pp. 3408-3411, 1998.
25.
T. Hogg, "Highly structured searches with quantum computers", Phys. Rev. Lett., vol. 80, pp. 2473-2476, 1998.
26.
P. W. Shor, "Polynomial-time algorithms for prime factorization and discrete logarithms on a quantun computer", SIAM J. Comput., vol. 26, no. 5, pp. 1484-1509, 1997.
27.
M. Bayer, G. Brassard, P. Hoyer and A. Tapp, "Tight bounds on quantum searching", Fortsehritte der Physik, vol. 46, no. 4/5, pp. 493-505, 1998.
28.
C.H. Bennet, E. Bernshtein, C. Brassard and U. Vazirani, "Strengths and weakness of quantum computing", SIAM Computing, vol. 26, no. 5, pp. 1510-1523, 1997.
29.
K. M. Obeland and A. M. Despain, Simulating the effect of decoherence and inaccuracies on a quantum computer, Apr 1998.
30.
R. Beals, H. Buhrman, R. Cleve and M. Mosca, Quantum lower bounds by polynomials, Sep. 1998.
