LEADER 02130nam0 22004573i 450 001 VAN0211609 005 20230609015148.166 017 70$2N$a9783319978130 100 $a20210908d2018 |0itac50 ba 101 $aeng 102 $aCH 105 $a|||| ||||| 200 1 $aQuantum Walks and Search Algorithms$fRenato Portugal 205 $a2. ed 210 $aCham$cSpringer$d2018 215 $axiv, 308 p.$cill.$d24 cm 410 1$1001VAN0133046$12001 $aQuantum Science and Technology$1210 $aBerlin [etc.]$cSpringer 500 1$3VAN0211610$aQuantum Walks and Search Algorithms$92247683 606 $a81P68$xQuantum computation [MSC 2020]$3VANC019948$2MF 606 $a81-XX$xQuantum theory [MSC 2020]$3VANC019967$2MF 606 $a60G50$xSums of independent random variables; random walks [MSC 2020]$3VANC020430$2MF 606 $a81S25$xQuantum stochastic calculus [MSC 2020]$3VANC020666$2MF 606 $a05C70$xEdge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) [MSC 2020]$3VANC023636$2MF 606 $a68P10$xSearching and sorting [MSC 2020]$3VANC024570$2MF 606 $a05C81$xRandom walks on graphs [MSC 2020]$3VANC029389$2MF 610 $aCoined quantum walk$9KW:K 610 $aElement distinctness algorithm$9KW:K 610 $aGrover's algorithm$9KW:K 610 $aQuantum walk model$9KW:K 610 $aSpatial search algorithm$9KW:K 620 $aCH$dCham$3VANL001889 700 1$aPortugal$bRenato$3VANV197776$0984133 712 $aSpringer $3VANV108073$4650 801 $aIT$bSOL$c20240614$gRICA 856 4 $uhttp://doi.org/10.1007/978-3-319-97813-0$zE-book ? Accesso al full-text attraverso riconoscimento IP di Ateneo, proxy e/o Shibboleth 899 $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$1IT-CE0120$2VAN08 912 $fN 912 $aVAN0211609 950 $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$d08CONS e-book 3657 $e08eMF3657 20210908 996 $aQuantum Walks and Search Algorithms$92247683 997 $aUNICAMPANIA