Publicado por Engineering Science Reference, 2018
ISBN 10: 1522537996 ISBN 13: 9781522537991
Librería: WeBuyBooks, Rossendale, LANCS, Reino Unido
Condición: Good. Most items will be dispatched the same or the next working day. A few small marks to page edges.
Publicado por Springer International Publishing Okt 2014, 2014
ISBN 10: 3031013913 ISBN 13: 9783031013911
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The adiabatic quantum computation (AQC) is based on the adiabatic theorem to approximate solutions of the Schrödinger equation. The design of an AQC algorithm involves the construction of a Hamiltonian that describes the behavior of the quantum system. This Hamiltonian is expressed as a linear interpolation of an initial Hamiltonian whose ground state is easy to compute, and a final Hamiltonian whose ground state corresponds to the solution of a given combinatorial optimization problem. The adiabatic theorem asserts that if the time evolution of a quantum system described by a Hamiltonian is large enough, then the system remains close to its ground state. An AQC algorithm uses the adiabatic theorem to approximate the ground state of the final Hamiltonian that corresponds to the solution of the given optimization problem. In this book, we investigate the computational simulation of AQC algorithms applied to the MAX-SAT problem. A symbolic analysis of the AQC solution is given in order to understand the involved computational complexity of AQC algorithms. This approach can be extended to other combinatorial optimization problems and can be used for the classical simulation of an AQC algorithm where a Hamiltonian problem is constructed. This construction requires the computation of a sparse matrix of dimension 2n × 2n, by means of tensor products, where n is the dimension of the quantum system. Also, a general scheme to design AQC algorithms is proposed, based on a natural correspondence between optimization Boolean variables and quantum bits. Combinatorial graph problems are in correspondence with pseudo-Boolean maps that are reduced in polynomial time to quadratic maps. Finally, the relation among NP-hard problems is investigated, as well as its logical representability, and is applied to the design of AQC algorithms. It is shown that every monadic second-order logic (MSOL) expression has associated pseudo-Boolean maps that can be obtained by expanding the given expression, and also can be reduced to quadratic forms.Table of Contents: Preface / Acknowledgments / Introduction / Approximability of NP-hard Problems / Adiabatic Quantum Computing / Efficient Hamiltonian Construction / AQC for Pseudo-Boolean Optimization / A General Strategy to Solve NP-Hard Problems / Conclusions / Bibliography / Authors' Biographies 116 pp. Englisch.
Publicado por Publicia, 2013
ISBN 10: 3639550870 ISBN 13: 9783639550870
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Condición: New.
Publicado por Springer International Publishing, 2014
ISBN 10: 3031013913 ISBN 13: 9783031013911
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - The adiabatic quantum computation (AQC) is based on the adiabatic theorem to approximate solutions of the Schrödinger equation. The design of an AQC algorithm involves the construction of a Hamiltonian that describes the behavior of the quantum system. This Hamiltonian is expressed as a linear interpolation of an initial Hamiltonian whose ground state is easy to compute, and a final Hamiltonian whose ground state corresponds to the solution of a given combinatorial optimization problem. The adiabatic theorem asserts that if the time evolution of a quantum system described by a Hamiltonian is large enough, then the system remains close to its ground state. An AQC algorithm uses the adiabatic theorem to approximate the ground state of the final Hamiltonian that corresponds to the solution of the given optimization problem. In this book, we investigate the computational simulation of AQC algorithms applied to the MAX-SAT problem. A symbolic analysis of the AQC solution is given in order to understand the involved computational complexity of AQC algorithms. This approach can be extended to other combinatorial optimization problems and can be used for the classical simulation of an AQC algorithm where a Hamiltonian problem is constructed. This construction requires the computation of a sparse matrix of dimension 2n × 2n, by means of tensor products, where n is the dimension of the quantum system. Also, a general scheme to design AQC algorithms is proposed, based on a natural correspondence between optimization Boolean variables and quantum bits. Combinatorial graph problems are in correspondence with pseudo-Boolean maps that are reduced in polynomial time to quadratic maps. Finally, the relation among NP-hard problems is investigated, as well as its logical representability, and is applied to the design of AQC algorithms. It is shown that every monadic second-order logic (MSOL) expression has associated pseudo-Boolean maps that can be obtained by expanding the given expression, and also can be reduced to quadratic forms.Table of Contents: Preface / Acknowledgments / Introduction / Approximability of NP-hard Problems / Adiabatic Quantum Computing / Efficient Hamiltonian Construction / AQC for Pseudo-Boolean Optimization / A General Strategy to Solve NP-Hard Problems / Conclusions / Bibliography / Authors' Biographies.
Publicado por Springer, Berlin|Springer International Publishing|Morgan & Claypool|Springer, 2014
ISBN 10: 3031013913 ISBN 13: 9783031013911
Librería: moluna, Greven, Alemania
Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. The adiabatic quantum computation (AQC) is based on the adiabatic theorem to approximate solutions of the Schroedinger equation. The design of an AQC algorithm involves the construction of a Hamiltonian that describes the behavior of the quantum system. This.
Publicado por Publicia, 2013
ISBN 10: 3639550870 ISBN 13: 9783639550870
Librería: moluna, Greven, Alemania
Condición: New.
Publicado por Publicia, 2013
ISBN 10: 3639550870 ISBN 13: 9783639550870
Librería: Mispah books, Redhill, SURRE, Reino Unido
Paperback. Condición: Like New. Like New. book.
Año de publicación: 1919
Librería: Cabalgando en un Silbido, Capital Federal, Argentina
Original o primera edición
Encuadernación de tapa blanda. Condición: Bien. 1ª Edición. Año I, N° 3. Mayo 1919.Director: Mario Chiloteguy. Colaboraciones especiales e inéditas de: Amado Nervo, Evar Méndez, Manuel Ugarte, H. A. Rega Molina, G. Gloria Peñaloza, Edmundo Montagne, Angel Falco, J.L. F. de la Puente, René Chiloteguy, Alfredo Bufano Vicente Bove, Delio Pnissa, Félix B. Visillac, Vict. E. Luna (h), A. Cortina Aravena, Ernesto Morales, Hebe Foussat, Constantino Aguirre, Bartolomé Glíndez, Anguita Zeballos, Manuel Saavedra, Mario Chiloteguy, J. Díaz Usandivaras, Santiago J. Chierico, Pascual Netri, Miguel de Arzubiaga, A. García y Mellid, Eduardo Martín, Guillermo Silva, P. Di Lorenzo, Blanca C. de Hume, Amado Villar. Roturas en bordes de tapas. Buen estado. Rara.
Publicado por Engineering Science Reference, 2018
ISBN 10: 1522537996 ISBN 13: 9781522537991
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Condición: New.
Publicado por Engineering Science Reference, 2017
ISBN 10: 1522537996 ISBN 13: 9781522537991
Librería: moluna, Greven, Alemania
Gebunden. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Examines trends, challenges, and collaborative processes in emerging fields within complex network analysis. Featuring coverage on a broad range of topics such as high-performance computing, big data, network science, and accelerated network traversal, this.
Publicado por Engineering Science Reference, 2018
ISBN 10: 1522537996 ISBN 13: 9781522537991
Librería: Books Puddle, New York, NY, Estados Unidos de America
Condición: New. pp. 240.
Publicado por Engineering Science Reference, 2018
ISBN 10: 1522537996 ISBN 13: 9781522537991
Librería: Majestic Books, Hounslow, Reino Unido
Condición: New. pp. 240.