Quantum computation Particle and wave aspects of algorithms
The driving force in the pursuit for quantum computation is the exciting possibility that quantum algorithms can be more efficient than their classical analogues. Research on the subject has unraveled several aspects of how that can happen. Clever quantum algorithms have been discovered in recent ye...
Saved in:
Published in | Resonance Vol. 16; no. 9; pp. 821 - 835 |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
India
Springer-Verlag
01.09.2011
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | The driving force in the pursuit for quantum computation is the exciting possibility that quantum algorithms can be more efficient than their classical analogues. Research on the subject has unraveled several aspects of how that can happen. Clever quantum algorithms have been discovered in recent years, although not systematically, and the field remains under active investigation. Richard Feynman was one of the pioneers who foresaw the power of quantum computers. In this issue dedicated to him, I give an introduction to how particle and wave aspects contribute to the power of quantum computers. Shor’s and Grover’s algorithms are analysed as examples. |
---|---|
AbstractList | The driving force in the pursuit for quantum computation is the exciting possibility that quantum algorithms can be more efficient than their classical analogues. Research on the subject has unraveled several aspects of how that can happen. Clever quantum algorithms have been discovered in recent years, although not systematically, and the field remains under active investigation. Richard Feynman was one of the pioneers who foresaw the power of quantum computers. In this issue dedicated to him, I give an introduction to how particle and wave aspects contribute to the power of quantum computers. Shor’s and Grover’s algorithms are analysed as examples. |
Author | Patel, Apoorva |
Author_xml | – sequence: 1 givenname: Apoorva surname: Patel fullname: Patel, Apoorva email: adpatel@cts.iisc.ernet.in organization: CHEP and SERC, Indian Institute of Science |
BookMark | eNp9j01LxDAQhoOs4O7qyZM3_0B0JkmT5iiLX7AggoK3ME1T2cWmS9Ie_PdmrWcPw8xhnpf3WbFFHGJg7ArhBgHMbUYBquKAWAaA6xO2BGskNyg-Fr838hqUOmOrnPcAaJW0S3b5OlEcp_7aD_1hGmncDfGcnXb0lcPF316z94f7t80T3748Pm_uttyjgZFTS0GHxnsjlfBK16qxFRntDXjjRauktt6rtqvJyNCQsFQ1QK2VgWrCRq4Zzrk-DTmn0LlD2vWUvh2CO1q52coVK3e0crowYmZy-Y2fIbn9MKVYav4D_QDxY1ET |
Cites_doi | 10.1145/237814.237866 10.1137/S0097539795293172 10.1103/PhysRevA.82.032330 |
ContentType | Journal Article |
Copyright | Indian Academy of Sciences 2011 |
Copyright_xml | – notice: Indian Academy of Sciences 2011 |
DBID | AAYXX CITATION |
DOI | 10.1007/s12045-011-0100-6 |
DatabaseName | CrossRef |
DatabaseTitle | CrossRef |
DatabaseTitleList | |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Education Sciences (General) |
EISSN | 0973-712X |
EndPage | 835 |
ExternalDocumentID | 10_1007_s12045_011_0100_6 |
GroupedDBID | -51 -5C -5G -BR -EM -W8 -Y2 -~C .86 .GO 06D 0R~ 0VY 123 1N0 1SB 203 2J2 2JN 2JY 2KG 2KM 2LR 2VQ 2WC 2~H 30V 4.4 406 408 40D 40E 5VS 67Z 6NX 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAGAY AAHNG AAHSB AAIAL AAJBT AAJKR AANTL AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABDZT ABECU ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABLLD ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACSNA ACZOJ ADHHG ADHIR ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFQL AEGAL AEGNC AEGXH AEJHL AEJRE AEKMD AEMSY AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHSBF AHYZX AIAKS AIDUJ AIGIU AIIXL AILAN AITGF AJBLW AJRNO ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYQR AOCGG ARMRJ ASPBG AVWKF AXYYD AYQZM AZFZN B-. BA0 BBWZM BDATZ BGNMA CAG COF CS3 CSCUP DDRTE DNIVK DPUIP EBLON EBS EDJ EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRP FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 H13 HG5 HG6 HH5 HMJXF HRMNR HVGLF HZ~ IJ- IKXTQ IWAJR IXC IXD IXE I~X I~Z J-C J0Z JBSCW JZLTJ KDC KOV KQ8 LLZTM M4Y MA- MQGED N2Q NDZJH NF0 NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OK1 P19 P2P P9Q PF0 PQQKQ PT4 PT5 QOK QOS R4E R89 R9I RAB RHV RIG RNI ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SC5 SCLPG SDA SDH SDM SHS SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TR2 TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W48 WK6 WK8 YLTOR Z45 Z5O Z7R Z7X Z7Z Z83 Z86 Z88 Z8M Z8R Z8T Z8W Z92 ZMTXR ZWUKE ~A9 ~EX AAPKM AAYXX ABDBE ABFSG ACSTC ADHKG AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR CITATION |
ID | FETCH-LOGICAL-c170t-adae6ebcc7342c4684b95a76c70c7c2d4369cc4df8a73eba29a5b0ad93ea8a1b3 |
IEDL.DBID | U2A |
ISSN | 0971-8044 |
IngestDate | Tue Jul 01 03:13:23 EDT 2025 Fri Feb 21 02:26:02 EST 2025 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 9 |
Keywords | superposition Boolean logic digital language qubit Hilbert space Feynman computation computational complexity |
Language | English |
License | http://www.springer.com/tdm |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c170t-adae6ebcc7342c4684b95a76c70c7c2d4369cc4df8a73eba29a5b0ad93ea8a1b3 |
PageCount | 15 |
ParticipantIDs | crossref_primary_10_1007_s12045_011_0100_6 springer_journals_10_1007_s12045_011_0100_6 |
ProviderPackageCode | CITATION AAYXX |
PublicationCentury | 2000 |
PublicationDate | 20110900 2011-9-00 |
PublicationDateYYYYMMDD | 2011-09-01 |
PublicationDate_xml | – month: 9 year: 2011 text: 20110900 |
PublicationDecade | 2010 |
PublicationPlace | India |
PublicationPlace_xml | – name: India |
PublicationSubtitle | Journal of Science Education |
PublicationTitle | Resonance |
PublicationTitleAbbrev | Reson |
PublicationYear | 2011 |
Publisher | Springer-Verlag |
Publisher_xml | – name: Springer-Verlag |
References | ShorP.Polynomial-time Algorithms for Prime Factorisation and Discrete Logarithms on a Quantum ComputerSIAM J. Comp.199726148410.1137/S0097539795293172 J von Neumann, The Computer and the Brain, Yale University Press, 1958. R P Feynman, Feynman Lectures on Computation, Edited by A J G Hey and R W Allen, Perseus Books, 1996. See for instance: M A Nielsen and I L Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2000. PatelA.RahamanMd. A.Search on a Hypercubic Lattice using a Quantum Random WalkPhys. Rev.2010A82032330 Most of the articles on the subject of quantum computation are available at the e-print web archive, http://arXiv.org/, under the category quant-ph. Feynman and Computation: Exploring the Limits of Computers, Edited by A J G Hey, Perseus Books, 1999. FeynmanR. P.There’s Plenty of Room at the Bottom, (talk at the 1959 Annual Meeting of the American Physical Society)Caltech’s Engineering and Science19602352236 L K Grover, A Fast Quantum Mechanical Algorithm for Database Search, Proceedings of the 28th Annual ACM Symposium on Theory of Computing, Philadelphia, p.212, 1996, arXiv:quant-ph/9605043. 100_CR8 100_CR5 A. Patel (100_CR9) 2010; A82 P. Shor (100_CR7) 1997; 26 100_CR3 100_CR4 100_CR1 R. P. Feynman (100_CR6) 1960; 23 100_CR2 |
References_xml | – reference: ShorP.Polynomial-time Algorithms for Prime Factorisation and Discrete Logarithms on a Quantum ComputerSIAM J. Comp.199726148410.1137/S0097539795293172 – reference: PatelA.RahamanMd. A.Search on a Hypercubic Lattice using a Quantum Random WalkPhys. Rev.2010A82032330 – reference: R P Feynman, Feynman Lectures on Computation, Edited by A J G Hey and R W Allen, Perseus Books, 1996. – reference: Most of the articles on the subject of quantum computation are available at the e-print web archive, http://arXiv.org/, under the category quant-ph. – reference: See for instance: M A Nielsen and I L Chuang, Quantum Computation and Quantum Information, Cambridge University Press, 2000. – reference: FeynmanR. P.There’s Plenty of Room at the Bottom, (talk at the 1959 Annual Meeting of the American Physical Society)Caltech’s Engineering and Science19602352236 – reference: L K Grover, A Fast Quantum Mechanical Algorithm for Database Search, Proceedings of the 28th Annual ACM Symposium on Theory of Computing, Philadelphia, p.212, 1996, arXiv:quant-ph/9605043. – reference: Feynman and Computation: Exploring the Limits of Computers, Edited by A J G Hey, Perseus Books, 1999. – reference: J von Neumann, The Computer and the Brain, Yale University Press, 1958. – ident: 100_CR2 – ident: 100_CR1 – volume: 23 start-page: 22 issue: 5 year: 1960 ident: 100_CR6 publication-title: Caltech’s Engineering and Science – ident: 100_CR8 doi: 10.1145/237814.237866 – volume: 26 start-page: 1484 year: 1997 ident: 100_CR7 publication-title: SIAM J. Comp. doi: 10.1137/S0097539795293172 – volume: A82 start-page: 032330 year: 2010 ident: 100_CR9 publication-title: Phys. Rev. doi: 10.1103/PhysRevA.82.032330 – ident: 100_CR3 – ident: 100_CR4 – ident: 100_CR5 |
SSID | ssj0019439 |
Score | 1.7911146 |
Snippet | The driving force in the pursuit for quantum computation is the exciting possibility that quantum algorithms can be more efficient than their classical... |
SourceID | crossref springer |
SourceType | Index Database Publisher |
StartPage | 821 |
SubjectTerms | Education Humanities and Social Sciences multidisciplinary Science Science Education |
Subtitle | Particle and wave aspects of algorithms |
Title | Quantum computation |
URI | https://link.springer.com/article/10.1007/s12045-011-0100-6 |
Volume | 16 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFH7odvEibirOH6MHD_4g0CVp0hyHbA5FQXAwTyV5TW9Osdv_b5KmjoEevLaPQr-k7_Xle-97AJdSK5c0eFaXGyTct8lozXNSmkw5lyxTir4b-elZzOb8YZEtYh933Va7t5Rk8NSbZjevnE7CkZ67QMQudDOfurtNPKfjH-pAcdYI7MmRc7-ct1Tmb4_YDkbbTGgIMNMD2I9_hsm4Wcoe7Nhl3w9VjgUYfejF77BOrqJY9PUh9F_WDpv1e4JhPEMwPYL5dPJ6NyNx0AHBkUxXRJfaCmsQJeMUuci5UZmWAmWKEmnJmVCIvKxyLZk1miqdmVSXilmd65Fhx9BZfiztCSRI_V3l0oBKB-EZVpaVrmwlaaqwygdw075x8dnoWRQb5WIPT-HgKTw8hRjAbYtJEbd2_bf16b-sz2CvOZ715Vrn0Fl9re2Fi-8rM4Tu-P7tcTL0XjYbhtX9BvWVnYc |
linkProvider | Springer Nature |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB60HvQitirW5x48-CCwTbLJ5ihiqdoWhBZ6C3ntzSq2_f8m2ayloAevybCwX3Znknwz3wBccyX8oSGwulQbREOZjFK0RFYXwrtknmMTqpFHYzaY0pdZMUt13Ism272hJKOnXhe7BeV0FK_0_ABi27Dj9wJlyOOa4ocf6kBQUgvs8Z53v5Q2VOZvj9gMRptMaAww_QPYTzvD7KFeyjZsuXknNFVOCRgdaKf_cJHdJLHo20PovK08Nqv3zMT2DNH0CKb9p8njAKVGB8j0eL5EyirHnDaGE4oNZSXVolCcGZ4bbrClhAljqK1KxYnTCgtV6FxZQZwqVU-TY2jNP-buBDKDw6zwx4BKReEZYm2lKldxnAtTlV24a95YftZ6FnKtXBzgkR4eGeCRrAv3DSYyfdqLv61P_2V9BbuDyWgoh8_j1zPYq69qQ-rWObSWXyt34WP9Ul_Gtf0G3wGeAA |
linkToPdf | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3JTsMwEB1BkRAXRAuIsubAgUVRE9ux4yMCqrJVIFGpN8tbboSKpv-PnThUleDANR5F8rMzE_vNvAE4Z5K7Q4NndYnSMfFlMlKSPDYq484lswRpX438MqajCXmcZtPQ53TeZru3lGRT0-BVmspqMDPFYFn45lXU4_p6zz2I6TpsOG-c-m09QTc_NAInuBHbY6lzxYS0tOZvr1gNTKusaB1shjuwHf4So5tmWbuwZsueb7AckjF60A3f5Dy6CMLRl7vQe1s4nBYfka5bNdSmezAZ3r_fjuLQ9CDWKUuqWBppqVVaM0yQJjQnimeSUc0SzTQyBFOuNTFFLhm2SiIuM5VIw7GVuUwV3odO-VnaA4g08qPcHQkKWYvQYGMKWdiCoYTrIu_DVTtjMWu0LcRSxdjDIxw8wsMjaB-uW0xE2Obzv60P_2V9Bpuvd0Px_DB-OoKt5tbWZ3EdQ6f6WtgTF_YrdVov7TejuaI8 |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Quantum+computation&rft.jtitle=Resonance&rft.au=Patel%2C+Apoorva&rft.date=2011-09-01&rft.issn=0971-8044&rft.eissn=0973-712X&rft.volume=16&rft.issue=9&rft.spage=821&rft.epage=835&rft_id=info:doi/10.1007%2Fs12045-011-0100-6&rft.externalDBID=n%2Fa&rft.externalDocID=10_1007_s12045_011_0100_6 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0971-8044&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0971-8044&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0971-8044&client=summon |