{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":2,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":44,"n_cols":5,"rows_kept":44,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[2,4,2,5],[3,2,3,3],[4,2,4,3],[9,2,9,3],[10,2,10,3],[11,2,11,3],[12,2,12,3],[15,2,15,3],[16,2,16,3],[20,2,20,3],[22,2,22,3],[22,4,22,5],[23,2,23,3],[23,4,23,5],[24,2,24,3],[24,4,24,5],[25,2,25,3],[26,2,26,3],[30,2,30,3],[31,2,31,3],[32,2,32,3],[33,2,33,3],[35,2,35,3],[36,2,36,3],[39,2,39,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910956860003321"]
[null,null,"Autore",null,"Elster Jon <1940->"]
[null,null,"Titolo",null,"Reason and rationality / / Jon Elster ; translated by Steven Rendall"]
[null,null,"Pubbl/distr/stampa",null,"Princeton, : Princeton University Press, c2009"]
[null,null,"ISBN",null,"9786612964459"]
[{"$nulls":4},"9781282964457"]
[{"$nulls":4},"1282964453"]
[{"$nulls":4},"9781400833177"]
[{"$nulls":4},"1400833175"]
[null,null,"Edizione",null,"[Course Book]"]
[null,null,"Descrizione fisica",null,"1 online resource (88 p.)"]
[null,null,"Disciplina",null,"128/.33"]
[null,null,"Soggetti",null,"Practical reason"]
[{"$nulls":4},"Rational choice theory"]
[{"$nulls":4},"Philosophy and social sciences"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","Translated from the French."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references (p. 69-76)."]
[null,null,"Nota di contenuto",null,"Front matter -- Contents -- Reason and Rationality -- Works Cited"]
[null,null,null,"Sommario/riassunto","\"One of the world's most important political philosophers, Jon Elster is a leading thinker on reason and rationality and their roles in politics and public life. In this short book, he crystallizes and advances his work, bridging the gap between philosophers who use the idea of reason to assess human behavior from a normative point of view and social scientists who use the idea of rationality to explain behavior. In place of these approaches, Elster proposes a unified conceptual framework for the study of behavior.\" \"Drawing on classical moralists as well as modern scholarship, and using a wealth of historical and contemporary illustrations, Reason and Rationality marks a new development in Elster's thinking while at the same time providing a brief, elegant, and accessible introduction to his work.\"--BOOK JACKET."]
[null,"2.","Record Nr.",null,"UNINA9910966102803321"]
[null,null,"Autore",null,"Kaye Phillip"]
[null,null,"Titolo",null,"An introduction to quantum computing / / Phillip Kaye, Raymond Laflamme, Michele Mosca"]
[null,null,"Pubbl/distr/stampa",null,"Oxford, : Oxford University Press, 2007"]
[null,null,"ISBN",null,"1-280-75761-2"]
[{"$nulls":4},"0-19-191672-2"]
[{"$nulls":4},"1-4294-5991-3"]
[{"$nulls":4},"0-19-152461-1"]
[null,null,"Edizione",null,"[1st ed.]"]
[null,null,"Descrizione fisica",null,"xi, 274 p. : ill"]
[null,null,"Disciplina",null,"004.1"]
[null,null,"Soggetti",null,"Quantum computers"]
[{"$nulls":4},"Computers"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"Intro -- Contents -- Preface -- Acknowledgements -- 1 INTRODUCTION AND BACKGROUND -- 1.1 Overview -- 1.2 Computers and the Strong Church-Turing Thesis -- 1.3 The Circuit Model of Computation -- 1.4 A Linear Algebra Formulation of the Circuit Model -- 1.5 Reversible Computation -- 1.6 A Preview of Quantum Physics -- 1.7 Quantum Physics and Computation -- 2 LINEAR ALGEBRA AND THE DIRAC NOTATION -- 2.1 The Dirac Notation and Hilbert Spaces -- 2.2 Dual Vectors -- 2.3 Operators -- 2.4 The Spectral Theorem -- 2.5 Functions of Operators -- 2.6 Tensor Products -- 2.7 The Schmidt Decomposition Theorem -- 2.8 Some Comments on the Dirac Notation -- 3 QUBITS AND THE FRAMEWORK OF QUANTUM MECHANICS -- 3.1 The State of a Quantum System -- 3.2 Time-Evolution of a Closed System -- 3.3 Composite Systems -- 3.4 Measurement -- 3.5 Mixed States and General Quantum Operations -- 3.5.1 Mixed States -- 3.5.2 Partial Trace -- 3.5.3 General Quantum Operations -- 4 A QUANTUM MODEL OF COMPUTATION -- 4.1 The Quantum Circuit Model -- 4.2 Quantum Gates -- 4.2.1 1-Qubit Gates -- 4.2.2 Controlled-U Gates -- 4.3 Universal Sets of Quantum Gates -- 4.4 Efficiency of Approximating Unitary Transformations -- 4.5 Implementing Measurements with Quantum Circuits -- 5 SUPERDENSE CODING AND QUANTUM TELEPORTATION -- 5.1 Superdense Coding -- 5.2 Quantum Teleportation -- 5.3 An Application of Quantum Teleportation -- 6 "]
[{"$nulls":4},"INTRODUCTORY QUANTUM ALGORITHMS -- 6.1 Probabilistic Versus Quantum Algorithms -- 6.2 Phase Kick-Back -- 6.3 The Deutsch Algorithm -- 6.4 The Deutsch-Jozsa Algorithm -- 6.5 Simon's Algorithm -- 7 ALGORITHMS WITH SUPERPOLYNOMIAL SPEED-UP -- 7.1 Quantum Phase Estimation and the Quantum Fourier Transform -- 7.1.1 Error Analysis for Estimating Arbitrary Phases -- 7.1.2 Periodic States -- 7.1.3 GCD, LCM, the Extended Euclidean Algorithm -- 7.2 Eigenvalue Estimation."]
[{"$nulls":4},"7.3 Finding-Orders -- 7.3.1 The Order-Finding Problem -- 7.3.2 Some Mathematical Preliminaries -- 7.3.3 The Eigenvalue Estimation Approach to Order Finding -- 7.3.4 Shor's Approach to Order Finding -- 7.4 Finding Discrete Logarithms -- 7.5 Hidden Subgroups -- 7.5.1 More on Quantum Fourier Transforms -- 7.5.2 Algorithm for the Finite Abelian Hidden Subgroup Problem -- 7.6 Related Algorithms and Techniques -- 8 ALGORITHMS BASED ON AMPLITUDE AMPLIFICATION -- 8.1 Grover's Quantum Search Algorithm -- 8.2 Amplitude Amplification -- 8.3 Quantum Amplitude Estimation and Quantum Counting -- 8.4 Searching Without Knowing the Success Probability -- 8.5 Related Algorithms and Techniques -- 9 QUANTUM COMPUTATIONAL COMPLEXITY THEORY AND LOWER BOUNDS -- 9.1 Computational Complexity -- 9.1.1 Language Recognition Problems and Complexity Classes -- 9.2 The Black-Box Model -- 9.2.1 State Distinguishability -- 9.3 Lower Bounds for Searching in the Black-Box Model: Hybrid Method -- 9.4 General Black-Box Lower Bounds -- 9.5 Polynomial Method -- 9.5.1 Applications to Lower Bounds -- 9.5.2 Examples of Polynomial Method Lower Bounds -- 9.6 Block Sensitivity -- 9.6.1 Examples of Block Sensitivity Lower Bounds -- 9.7 Adversary Methods -- 9.7.1 Examples of Adversary Lower Bounds -- 9.7.2 Generalizations -- 10 QUANTUM ERROR CORRECTION -- 10.1 Classical Error Correction -- 10.1.1 The Error Model -- 10.1.2 Encoding -- 10.1.3 Error Recovery -- 10.2 The Classical Three-Bit Code -- 10.3 Fault Tolerance -- 10.4 Quantum Error Correction -- 10.4.1 Error Models for Quantum Computing -- 10.4.2 Encoding -- 10.4.3 Error Recovery -- 10.5 Three- and Nine-Qubit Quantum Codes -- 10.5.1 The Three-Qubit Code for Bit-Flip Errors -- 10.5.2 The Three-Qubit Code for Phase-Flip Errors -- 10.5.3 Quantum Error Correction Without Decoding -- 10.5.4 The Nine-Qubit Shor Code."]
[{"$nulls":4},"10.6 Fault-Tolerant Quantum Computation -- 10.6.1 Concatenation of Codes and the Threshold Theorem -- APPENDIX A -- A.1 Tools for Analysing Probabilistic Algorithms -- A.2 Solving the Discrete Logarithm Problem When the Order of a Is Composite -- A.3 How Many Random Samples Are Needed to Generate a Group? -- A.4 Finding r Given k/r for Random k -- A.5 Adversary Method Lemma -- A.6 Black-Boxes for Group Computations -- A.7 Computing Schmidt Decompositions -- A.8 General Measurements -- A.9 Optimal Distinguishing of Two States -- A.9.1 A Simple Procedure -- A.9.2 Optimality of This Simple Procedure -- Bibliography -- Index -- A -- B -- C -- D -- E -- F -- G -- H -- I -- K -- L -- M -- N -- O -- P -- Q -- R -- S -- T -- U -- V -- W -- X -- Z."]
[null,null,null,"Sommario/riassunto","This concise, accessible introduction to quantum computing is aimed at advanced undergraduate and beginning graduate students from a variety of scientific backgrounds. The text is technically detailed and clearly illustrated throughout with diagrams and exercises."]