| ²é¿´: 5101 | »Ø¸´: 39 | |||
| µ±Ç°Ö÷ÌâÒѾ´æµµ¡£ | |||
wanghd_8111½ð³æ (СÓÐÃûÆø)
|
[½»Á÷]
Öйú¿Æ¼¼´óѧÑÐÖÆ³É¹¦ÊÀ½çÉϵÚһ̨Á¿×Ó¼ÆËã»ú
|
||
|
November 2007, to be published in Physical Review Letters ¡¡¡¡Demonstration of a compiled version of Shor's quantum factoring algorithm using photonic qubits ¡¡¡¡Chao-Yang Lu, Daniel E. Browne, Tao Yang, and Jian-Wei Pan ¡¡¡¡ ¡¡¡¡We report an experimental demonstration of a complied version of Shor's algorithm using four photonic qubits. We choose the simplest instance of this algorithm, that is, factorization of $N=15$ in the case that the period $r=2$ and exploit a simplified linear optical network to coherently implement the quantum circuits of the modular exponential execution and semi -classical quantum Fourier transformation. During this computation, genuine multiparticle entanglement is observed which well supports its quantum nature. This experiment represents an essential step toward full realization of Shor's algorithm and scalable linear optics quantum computation. ¡¡¡¡ ¡¡¡¡2007 The American Physical Society. ¡¡¡¡ ¡¡¡¡Öйú¿Æ¼¼´óѧµÄÕâÆªprl ËÆºõºÜÓзÖÁ¿¡£Á½¸öÔÂǰ£¬ÕâÆªÂÛÎÄ»¹½ö½öÊÇÔ¤Ó¡±¾µÄʱ ºò£¬¡¶Ð¿ÆÑ§¼Ò¡·(new scientist)¾Í±¨µÀÁË ¡¡¡¡ ¡¡¡¡http://technology.newscientist.com/article/mg19526216.700 ¡¡¡¡ ¡¡¡¡Quantum threat to our secret data ¡¡¡¡ ¡¡¡¡* 13 September 2007 ¡¡¡¡* Saswato Das ¡¡¡¡* Magazine issue 2621 ¡¡¡¡ ¡¡¡¡IT MIGHT seem like an esoteric achievement of interest to only a handful of computer scientists, but the advent of quantum computers that can run a routine called Shor's algorithm could have profound consequences. It means the most dangerous threat posed by quantum computing - the ability to break the codes that protect our banking, business and e-commerce data - is now a step nearer reality. ¡¡¡¡ ¡¡¡¡Adding to the worry is the fact that this feat has been performed by not one but two research groups, independently of each other. One team is led by Andrew White at the University of Queensland in Brisbane, Australia, and the other by Chao-Yang Lu (USTCµÄ£¬µÚÒ»×÷Õߣ»Å˽¨Î°ÊÇͨÐÅ×÷Õß) of the University of Science and Technology of China, in Hefei. Both groups have built rudimentary laser-based quantum ¡¡¡¡computers that can implement Shor's algorithm - a mathematical routine capable of defeating today's most common encryption ... ¡¡¡¡ ¡¡¡¡ ¡¡¡¡Å˽¨Î°µÄÂÛÎı»PRL½ÓÊպ󣬻¹Ã»ÓÐÕýʽ·¢±í£¬µÂ¹úµÄ¡¶´´Ð±¨µ¼¡·ÓÖ·¢±íÁËÆÀÂÛ£º ¡¡¡¡ ¡¡¡¡http://www.innovations-report.de ... /bericht-99247.html ¡¡¡¡ ¡¡¡¡A quantum computer breakthrough and dark matter stars ¡¡¡¡(30.11.2007) ¡¡¡¡Highlights in this issue: A quantum computer breakthrough and dark matter stars. ¡¡¡¡ ¡¡¡¡Anzeige ¡¡¡¡Quantum Computer Breakthrough ¡¡¡¡ ¡¡¡¡Chao-Yang Lu, Daniel E. Browne, Tao Yang, and Jian-Wei Pan ¡¡¡¡Physical Review Letters (forthcoming) & ¡¡¡¡ ¡¡¡¡B. P. Lanyon, T. J. Weinhold, N. K. Langford, M. Barbieri, D. F. V. James , A. Gilchrist, and A. G. White ¡¡¡¡Physical Review Letters (forthcoming) ¡¡¡¡ ¡¡¡¡Two research groups have independently managed to experimentally solve a mathematical problem with light-based quantum computers. The simultaneous achievements appear to be the first experimental demonstrations of true ( though rudimentary) quantum mechanical computations. Both groups manipulated quantum mechanically entangled photons to calculate the prime factors of the number 15. ¡¡¡¡ ¡¡¡¡Although the physicists could have gotten the answer to the problem much more easily by querying an average elementary school child, the method both groups used involved a quantum mechanical approach commonly known as Shor's algorithm. Previous theoretical work has shown that the algorithm could potentially crack cryptographic codes that are practically unbreakable with non-quantum mechanical (classical) computers. ¡¡¡¡ ¡¡¡¡While there's no great need to factor numbers as small as 15, the research demonstrates that quantum computation is feasible with existing technology and could in principle be scaled up to tackle problems that would take longer than the age of the universe to solve with any classical computer, but would require only minutes on a quantum computer. ¡¡¡¡ ¡¡¡¡In addition to factoring large numbers and solving other challenging mathematical problems, quantum computers based on the work of these two groups could help model quantum mechanical problems in physics and chemistry (sehttp://xxx.lanl.gov/ftp/arxiv/papers/0710/0710.0278.pdf for an example of a q uantum simulator experiment by C.-Y. Lu et al.), and lead to ultra high speed se arching algorithms. ¡¡¡¡ ¡¡¡¡Chao-Yang Lu (USTCµÄ£¬µÚÒ»×÷Õߣ»Å˽¨Î°ÊÇͨÐÅ×÷Õß)and his group are currently expanding on their work by trying to manipulate larger numbers of quantum bits. In the long run, they plan to add quantum memory to their quantum computers, which could further increase the number of photons they can control. In addition, because the loss of photons is a huge problem for light-based quantum computation, they are working on some basic quantum codes that can protect the quantum information from photon loss error. These sorts of issues are crucial in the effort to scale up photonic quantum computation. - JR ¡¡¡¡°Ä´óÀûÑǵÄÒ»¸öС×éºÍUSTCͬʱʵÏÖÁËÕâһΰ´óµÄÍ»ÆÆ¡£ ¡¡¡¡ ¡¡¡¡ÖØÒªµÄ¾ä×Ó£º ¡¡¡¡Both groups have built rudimentary laser-based quantum ¡¡¡¡computers that can implement Shor's algorithm - a mathematical routine capable of defeating today's most common encryption . |
» ²ÂÄãϲ»¶
²ÄÁÏÓ뻯¹¤371Çóµ÷¼Á
ÒѾÓÐ5È˻ظ´
328·Öµ÷¼Á
ÒѾÓÐ4È˻ظ´
295Çóµ÷¼Á
ÒѾÓÐ7È˻ظ´
081700£¬311£¬Çóµ÷¼Á
ÒѾÓÐ13È˻ظ´
283·ÖÇóµ÷¼Á
ÒѾÓÐ6È˻ظ´
0854Çóµ÷¼Á
ÒѾÓÐ3È˻ظ´
332Çóµ÷¼Á
ÒѾÓÐ4È˻ظ´
284Çóµ÷¼Á
ÒѾÓÐ5È˻ظ´
304Çóµ÷¼Á£¨085602£¬¹ýËļ¶£¬Ò»Ö¾Ô¸985£©
ÒѾÓÐ11È˻ظ´
0817»¯Ñ§¹¤³ÌÓë¼¼ÊõÇóµ÷¼Á£¬Ò»Ö¾Ô¸Öк£Ñó319
ÒѾÓÐ10È˻ظ´

redcrag
ľ³æ (ÖøÃûдÊÖ)
- Ó¦Öú: 1 (Ó×¶ùÔ°)
- ½ð±Ò: 1778.2
- ºì»¨: 1
- Ìû×Ó: 1163
- ÔÚÏß: 45Сʱ
- ³æºÅ: 254694
- ×¢²á: 2006-05-27
- ÐÔ±ð: GG
- רҵ: ¹âѧ

2Â¥2008-02-21 08:38:12
sujie1132
ľ³æ (СÓÐÃûÆø)
- Ó¦Öú: 0 (Ó×¶ùÔ°)
- ½ð±Ò: 1989.7
- É¢½ð: 18
- Ìû×Ó: 219
- ÔÚÏß: 47.5Сʱ
- ³æºÅ: 453881
- ×¢²á: 2007-11-07
- ÐÔ±ð: GG
- רҵ: ¹âѧ
3Â¥2008-02-21 08:48:16
bigbearx
Ìú³æ (СÓÐÃûÆø)
- Ó¦Öú: 0 (Ó×¶ùÔ°)
- ½ð±Ò: 171.1
- Ìû×Ó: 119
- ÔÚÏß: 18.2Сʱ
- ³æºÅ: 514843
- ×¢²á: 2008-02-29
- ÐÔ±ð: GG
- רҵ: µÈÀë×ÓÌåÎïÀí
4Â¥2008-03-05 10:37:26
jinpuo
Òø³æ (ÖøÃûдÊÖ)
- Ó¦Öú: 0 (Ó×¶ùÔ°)
- ½ð±Ò: 1831
- É¢½ð: 30
- Ìû×Ó: 1147
- ÔÚÏß: 316.4Сʱ
- ³æºÅ: 305469
- ×¢²á: 2006-12-10
- ÐÔ±ð: GG
- רҵ: ·ºº¯·ÖÎö
5Â¥2008-03-05 22:21:37
6Â¥2008-03-06 10:37:57
FePt
ľ³æ (ÕýʽдÊÖ)
- Ó¦Öú: 0 (Ó×¶ùÔ°)
- ½ð±Ò: 1851
- É¢½ð: 25
- Ìû×Ó: 717
- ÔÚÏß: 284.8Сʱ
- ³æºÅ: 502966
- ×¢²á: 2008-02-15
- רҵ: µç¹¤²ÄÁÏÌØÐÔ¼°ÆäÓ¦ÓÃ
7Â¥2008-03-06 10:51:59
xylai
ͳæ (СÓÐÃûÆø)
- Ó¦Öú: 0 (Ó×¶ùÔ°)
- ½ð±Ò: 112.3
- Ìû×Ó: 177
- ÔÚÏß:
- ³æºÅ: 368846
- ×¢²á: 2007-05-12
- רҵ: ÎïÀí
8Â¥2008-03-06 11:33:13
boruwei
½ð³æ (ÕýʽдÊÖ)
- Ó¦Öú: 0 (Ó×¶ùÔ°)
- ½ð±Ò: 828.4
- ºì»¨: 2
- Ìû×Ó: 891
- ÔÚÏß: 85.4Сʱ
- ³æºÅ: 254774
- ×¢²á: 2006-05-27
- רҵ: ¹âѧ
9Â¥2008-03-07 09:59:46
spindancing
½ð³æ (СÓÐÃûÆø)
- Ó¦Öú: 1 (Ó×¶ùÔ°)
- ½ð±Ò: 780
- É¢½ð: 174
- Ìû×Ó: 136
- ÔÚÏß: 116.3Сʱ
- ³æºÅ: 387465
- ×¢²á: 2007-05-30
- ÐÔ±ð: GG
- רҵ: ½ðÊô¹¦ÄܲÄÁÏ
10Â¥2008-03-11 22:03:49














»Ø¸´´ËÂ¥
