Quantum speed-up of markov chain based algorithms
- Author
- SZEGEDY, Mario1
[1] Rutgers University, United States - Conference title
- FOCS 2004 : foundations of computer science (Rome, 17-19 October 2004)
- Conference name
- Annual symposium on foundations of computer science (45 ; Rome 2004-10-17)
- Author (monograph)
- IEEE Computer Society, Technical Committee on Mathematical Foundations of Computing, United States (Organiser of meeting)
- Source
Annual Symposium on Foundations of Computer Science. 2004 ; 1Vol, pp 32-41, 10 p ; ref : 27 ref
- ISBN
- 0-7695-2228-9
- Scientific domain
- Computer science
- Publisher
- IEEE, Los Alamitos CA
- Publication country
- United States
- Document type
- Conference Paper
- Language
- English
- Keyword (fr)
- Algorithme quantique Chaîne Markov Matrice transition Temps discret Marche quantique Marche symétrique
- Keyword (en)
- Quantum algorithm Markov chain Transition matrix Discrete time
- Keyword (es)
- Cadena Markov Matriz transición Tiempo discreto
- Classification
- Pascal
- 001 Exact sciences and technology / 001B Physics / 001B00 General / 001B00C Classical and quantum physics: mechanics and fields / 001B00C67 Quantum information / 001B00C67H Quantum communication
- Discipline
- Theoretical physics
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 17893208
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Install on your browser
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:49:\"Quantum speed-up of markov chain based algorithms\";s:9:\"\u0000*\u0000jtitle\";s:51:\"Annual Symposium on Foundations of Computer Science\";s:9:\"\u0000*\u0000stitle\";s:0:\"\";s:7:\"\u0000*\u0000date\";s:4:\"2004\";s:9:\"\u0000*\u0000volume\";s:0:\"\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:2:\"32\";s:8:\"\u0000*\u0000epage\";s:2:\"41\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:0:\"\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"SZEGEDY\";s:10:\"\u0000*\u0000aufirst\";s:5:\"Mario\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:13:\"0-7695-2228-9\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:70:\"FOCS 2004 : foundations of computer science (Rome, 17-19 October 2004)\";s:8:\"\u0000*\u0000title\";s:49:\"Quantum speed-up of markov chain based algorithms\";s:8:\"\u0000*\u0000place\";s:15:\"Los Alamitos CA\";s:6:\"\u0000*\u0000pub\";s:4:\"IEEE\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"10\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:49:\"Quantum speed-up of markov chain based algorithms\";s:9:\"\u0000*\u0000jtitle\";s:51:\"Annual Symposium on Foundations of Computer Science\";s:9:\"\u0000*\u0000stitle\";s:0:\"\";s:7:\"\u0000*\u0000date\";s:4:\"2004\";s:9:\"\u0000*\u0000volume\";s:0:\"\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:2:\"32\";s:8:\"\u0000*\u0000epage\";s:2:\"41\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:0:\"\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"SZEGEDY\";s:10:\"\u0000*\u0000aufirst\";s:5:\"Mario\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:13:\"0-7695-2228-9\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:70:\"FOCS 2004 : foundations of computer science (Rome, 17-19 October 2004)\";s:8:\"\u0000*\u0000title\";s:49:\"Quantum speed-up of markov chain based algorithms\";s:8:\"\u0000*\u0000place\";s:15:\"Los Alamitos CA\";s:6:\"\u0000*\u0000pub\";s:4:\"IEEE\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"10\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:49:\"Quantum speed-up of markov chain based algorithms\";s:9:\"\u0000*\u0000jtitle\";s:51:\"Annual Symposium on Foundations of Computer Science\";s:9:\"\u0000*\u0000stitle\";s:0:\"\";s:7:\"\u0000*\u0000date\";s:4:\"2004\";s:9:\"\u0000*\u0000volume\";s:0:\"\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:2:\"32\";s:8:\"\u0000*\u0000epage\";s:2:\"41\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:0:\"\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"SZEGEDY\";s:10:\"\u0000*\u0000aufirst\";s:5:\"Mario\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:13:\"0-7695-2228-9\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:70:\"FOCS 2004 : foundations of computer science (Rome, 17-19 October 2004)\";s:8:\"\u0000*\u0000title\";s:49:\"Quantum speed-up of markov chain based algorithms\";s:8:\"\u0000*\u0000place\";s:15:\"Los Alamitos CA\";s:6:\"\u0000*\u0000pub\";s:4:\"IEEE\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"10\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:49:\"Quantum speed-up of markov chain based algorithms\";s:9:\"\u0000*\u0000jtitle\";s:51:\"Annual Symposium on Foundations of Computer Science\";s:9:\"\u0000*\u0000stitle\";s:0:\"\";s:7:\"\u0000*\u0000date\";s:4:\"2004\";s:9:\"\u0000*\u0000volume\";s:0:\"\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:2:\"32\";s:8:\"\u0000*\u0000epage\";s:2:\"41\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:0:\"\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"SZEGEDY\";s:10:\"\u0000*\u0000aufirst\";s:5:\"Mario\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:13:\"0-7695-2228-9\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:70:\"FOCS 2004 : foundations of computer science (Rome, 17-19 October 2004)\";s:8:\"\u0000*\u0000title\";s:49:\"Quantum speed-up of markov chain based algorithms\";s:8:\"\u0000*\u0000place\";s:15:\"Los Alamitos CA\";s:6:\"\u0000*\u0000pub\";s:4:\"IEEE\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"10\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:0:\"\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:49:\"Quantum speed-up of markov chain based algorithms\";s:9:\"\u0000*\u0000jtitle\";s:51:\"Annual Symposium on Foundations of Computer Science\";s:9:\"\u0000*\u0000stitle\";s:0:\"\";s:7:\"\u0000*\u0000date\";s:4:\"2004\";s:9:\"\u0000*\u0000volume\";s:0:\"\";s:8:\"\u0000*\u0000issue\";s:0:\"\";s:8:\"\u0000*\u0000spage\";s:2:\"32\";s:8:\"\u0000*\u0000epage\";s:2:\"41\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:0:\"\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:7:\"SZEGEDY\";s:10:\"\u0000*\u0000aufirst\";s:5:\"Mario\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:0:{}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:13:\"0-7695-2228-9\";s:8:\"\u0000*\u0000coden\";s:0:\"\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:70:\"FOCS 2004 : foundations of computer science (Rome, 17-19 October 2004)\";s:8:\"\u0000*\u0000title\";s:49:\"Quantum speed-up of markov chain based algorithms\";s:8:\"\u0000*\u0000place\";s:15:\"Los Alamitos CA\";s:6:\"\u0000*\u0000pub\";s:4:\"IEEE\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:2:\"10\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
