| Record ID | marc_columbia/Columbia-extract-20221130-007.mrc:312333937:2701 |
| Source | marc_columbia |
| Download Link | /show-records/marc_columbia/Columbia-extract-20221130-007.mrc:312333937:2701?format=raw |
LEADER: 02701mam a22004454a 4500
001 3311915
005 20221020034858.0
008 020201t20022002riua b 001 0 eng
010 $a 2002016686
020 $a082182161X (acid-free paper)
020 $a0821832298 (softcover)
035 $a(OCoLC)ocm48965167
035 $9AUV6096CU
035 $a(NNC)3311915
035 $a3311915
040 $aDLC$cDLC$dC#P$dOrLoB-B
041 1 $aeng$hrus
042 $apcc
050 00 $aQA267$b.K57 2002
082 00 $a530.12$221
100 1 $aKitaev, A. Yu.$q(Alexei Yu.),$d1963-$0http://id.loc.gov/authorities/names/n2002015058
240 10 $aKlassicheskie i kvantovye vychislenii͡a.$lEnglish$0http://id.loc.gov/authorities/names/n2003010015
245 10 $aClassical and quantum computation /$cA. Yu. Kitaev, A.H. Shen, M.N. Vyalyi ; [translated from the Russian by Lester J. Senechal].
260 $aProvidence, R.I. :$bAmerican Mathematical Society,$c[2002], ©2002.
300 $axiii, 257 pages :$billustrations ;$c27 cm.
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
490 1 $aGraduate studies in mathematics,$x1065-7339 ;$vv. 47
504 $aIncludes bibliographical references (p. 251-254) and index.
505 00 $gPt. 1.$tClassical Computation.$g1.$tTuring machines.$g2.$tBoolean circuits.$g3.$tThe class NP: Reducibility and completeness.$g4.$tProbabilistic algorithms and the class BPP.$g5.$tThe hierarchy of complexity classes --$gPt. 2.$tQuantum Computation.$g6.$tDefinitions and notation.$g7.$tCorrespondence between classical and quantum computation.$g8.$tBases for quantum circuits.$g9.$tDefinition of Quantum Computation. Examples.$g10.$tQuantum probability.$g11.$tPhysically realizable transformations of density matrices.$g12.$tMeasuring operators.$g13.$tQuantum algorithms for Abelian groups.$g14.$tThe quantum analogue of NP: the class BQNP.$g15.$tClassical and quantum codes --$gPt. 3.$tSolutions --$gApp. A.$tElementary Number Theory.
650 0 $aMachine theory.$0http://id.loc.gov/authorities/subjects/sh85079341
650 0 $aComputational complexity.$0http://id.loc.gov/authorities/subjects/sh85029473
650 0 $aQuantum computers.$0http://id.loc.gov/authorities/subjects/sh98002795
700 1 $aShen, A.$q(Alexander),$d1958-$0http://id.loc.gov/authorities/names/n93067007
700 1 $aVyalyi, M. N.$q(Mikhail N.),$d1961-$0http://id.loc.gov/authorities/names/n2002015063
830 0 $aGraduate studies in mathematics ;$vv. 47.$0http://id.loc.gov/authorities/names/n92111274
852 00 $bphy$hQA267$i.K57 2002
852 00 $boff,phy$hQA267$i.K57 2002
852 00 $boff,phy$hQA267$i.K57 2002
852 00 $bmat$hQA267$i.K57 2002