Download or read book Quantum Proofs the Local Hamiltonian Problem and Applications written by Alex Bredariol Grilo and published by . This book was released on 2018 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: In QMA, the quantum generalization of the complexity class NP, a quantum state is provided as a proof of a mathematical statement, and this quantum proof can be verified by a quantum algorithm. This complexity class has a very natural complete problem, the Local Hamiltonian problem. Inspired by Condensed Matters Physics, this problem concerns the groundstate energy of quantum systems. In this thesis, we study some problems related to QMA and to the Local Hamiltonian problem. First, we study the difference of power when classical or quantum proofs are provided to quantum verification algorithms. We propose an intermediate setting where the proof is a “simpler” quantum state, and we manage to prove that these simpler states are enough to solve all problems in QMA. From this result, we are able to present a new QMA-complete problem and we also study the one-sided error version of our new complexity class. Secondly, we propose the first relativistic verifiable delegation scheme for quantum computation. In this setting, a classical client delegates her quantumcomputation to two entangled servers who are allowed to communicate, but respecting the assumption that information cannot be propagated faster than speed of light. This protocol is achieved through a one-round two-prover game for the Local Hamiltonian problem where provers only need polynomial time quantum computation and access to copies of the groundstate of the Hamiltonian. Finally, we study the quantumPCP conjecture, which asks if all problems in QMA accept aproof systemwhere only a fewqubits of the proof are checked. Our result consists in proposing an extension of QPCP proof systems where the verifier is also provided an auxiliary classical proof. Based on this proof system, we propose a weaker version of QPCP conjecture. We then show that this new conjecture can be formulated as a Local Hamiltonian problem and also as a problem involving the maximum acceptance probability of multi-prover games. This is the first equivalence of a multi-prover game and some QPCP statement.
Download or read book Quantum Proofs written by Thomas Vidick and published by Foundations and Trends (R) in Theoretical Computer Science. This book was released on 2016-03-30 with total page 232 pages. Available in PDF, EPUB and Kindle. Book excerpt: Quantum Proofs provides an overview of many of the known results concerning quantum proofs, computational models based on this concept, and properties of the complexity classes they define. In particular, it discusses non-interactive proofs and the complexity class QMA, single-prover quantum interactive proof systems and the complexity class QIP, statistical zero-knowledge quantum interactive proof systems and the complexity class QSZK, and multiprover interactive proof systems and the complexity classes QMIP, QMIP*, and MIP*. Quantum Proofs is mainly intended for non-specialists having a basic background in complexity theory and quantum information. A typical reader may be a student or researcher in either area desiring to learn about the fundamentals of the (actively developing) theory of quantum interactive proofs.
Download or read book FSTTCS 2004 Foundations of Software Technology and Theoretical Computer Science written by Kamal Lodaya and published by Springer. This book was released on 2004-11-24 with total page 546 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the 24th International Conference on the Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2004, held in Chennai, India, in December 2004. The 35 revised full papers presented together with 5 invited papers were carefully reviewed and selected from 176 submissions. The papers address a broad variety of current issues in software science, programming theory, systems design and analysis, formal methods, mathematical logic, mathematical foundations, discrete mathematics, combinatorial mathematics, complexity theory, automata theory, and theoretical computer science in general.
Download or read book Topics in Cryptology CT RSA 2024 written by Elisabeth Oswald and published by Springer Nature. This book was released on with total page 490 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book FSTTCS 2004 Foundations of Software Technology and Theoretical Computer Science written by Kamal Lodaya and published by Springer Science & Business Media. This book was released on 2004-12-02 with total page 546 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the 24th International Conference on the Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2004, held in Chennai, India, in December 2004. The 35 revised full papers presented together with 5 invited papers were carefully reviewed and selected from 176 submissions. The papers address a broad variety of current issues in software science, programming theory, systems design and analysis, formal methods, mathematical logic, mathematical foundations, discrete mathematics, combinatorial mathematics, complexity theory, automata theory, and theoretical computer science in general.
Download or read book Quantum Hamiltonian Complexity written by Sevag Gharibian and published by . This book was released on 2015-09-30 with total page 140 pages. Available in PDF, EPUB and Kindle. Book excerpt: This monograph provides an introduction to the rapidly growing field of Quantum Hamiltonian Complexity, which includes the study of quantum constraint satisfaction problems. It provides a computer science-oriented introduction to the subject in order to help bridge the language barrier between computer scientists and physicists in the field.
Download or read book Local Hamiltonians in Quantum Computation written by Daniel Nagaj and published by . This book was released on 2008 with total page 176 pages. Available in PDF, EPUB and Kindle. Book excerpt: In this thesis, I investigate aspects of local Hamiltonians in quantum computing. First, I focus on the Adiabatic Quantum Computing model, based on evolution with a time- dependent Hamiltonian. I show that to succeed using AQC, the Hamiltonian involved must have local structure, which leads to a result about eigenvalue gaps from information theory. I also improve results about simulating quantum circuits with AQC. Second, I look at classically simulating time evolution with local Hamiltonians and finding their ground state properties. I give a numerical method for finding the ground state of translationally invariant Hamiltonians on an infinite tree. This method is based on imaginary time evolution within the Matrix Product State ansatz, and uses a new method for bringing the state back to the ansatz after each imaginary time step. I then use it to investigate the phase transition in the transverse field Ising model on the Bethe lattice. Third, I focus on locally constrained quantum problems Local Hamiltonian and Quantum Satisfiability and prove several new results about their complexity. Finally, I define a Hamiltonian Quantum Cellular Automaton, a continuous-time model of computation which doesn't require control during the computation process, only preparation of product initial states. I construct two of these, showing that time evolution with a simple, local, translationally invariant and time-independent Hamiltonian can be used to simulate quantum circuits.
Download or read book Classical and Quantum Computation written by Alexei Yu. Kitaev and published by American Mathematical Soc.. This book was released on 2002 with total page 274 pages. Available in PDF, EPUB and Kindle. Book excerpt: An introduction to a rapidly developing topic: the theory of quantum computing. Following the basics of classical theory of computation, the book provides an exposition of quantum computation theory. In concluding sections, related topics, including parallel quantum computation, are discussed.
Download or read book Approximation Randomization and Combinatorial Optimization Algorithms and Techniques written by Josep Diaz and published by Springer. This book was released on 2006-08-29 with total page 532 pages. Available in PDF, EPUB and Kindle. Book excerpt: This is the joint refereed proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and the 10th International Workshop on Randomization and Computation, RANDOM 2006. The book presents 44 carefully reviewed and revised full papers. Among the topics covered are design and analysis of approximation algorithms, hardness of approximation problems, small spaces and data streaming algorithms, embeddings and metric space methods, and more.
Download or read book KP effect written by and published by payman sheriff. This book was released on with total page 118 pages. Available in PDF, EPUB and Kindle. Book excerpt: Two clumps of matter pass through each other without sharing space; In some cases the colliding clumps of matter appear to deepen their distance even as they pass through each other. Clumps of a few hundred thousand lithium atoms that are cooled to within one-millionth of a degree above absolute zero a temperature so cold that the atoms march in lockstep and act as a single matter wave. The Interaction of light with matter has long been a field of interest for many quantum physicists, however, limited to the field of interaction plus the form of interaction. I've found it to be much better to look at not as a phenomenon but as something of a paradox, whether the audience find it tangible or not, this might probably be the best starting point if one wish to have million ways to see quantum theory in its entirety.
Download or read book Quantum Computing written by National Academies of Sciences, Engineering, and Medicine and published by National Academies Press. This book was released on 2019-04-27 with total page 273 pages. Available in PDF, EPUB and Kindle. Book excerpt: Quantum mechanics, the subfield of physics that describes the behavior of very small (quantum) particles, provides the basis for a new paradigm of computing. First proposed in the 1980s as a way to improve computational modeling of quantum systems, the field of quantum computing has recently garnered significant attention due to progress in building small-scale devices. However, significant technical advances will be required before a large-scale, practical quantum computer can be achieved. Quantum Computing: Progress and Prospects provides an introduction to the field, including the unique characteristics and constraints of the technology, and assesses the feasibility and implications of creating a functional quantum computer capable of addressing real-world problems. This report considers hardware and software requirements, quantum algorithms, drivers of advances in quantum computing and quantum devices, benchmarks associated with relevant use cases, the time and resources required, and how to assess the probability of success.
Download or read book Mathematical Problems in Quantum Physics written by Federico Bonetto and published by American Mathematical Soc.. This book was released on 2018-10-24 with total page 338 pages. Available in PDF, EPUB and Kindle. Book excerpt: This volume contains the proceedings of the QMATH13: Mathematical Results in Quantum Physics conference, held from October 8–11, 2016, at the Georgia Institute of Technology, Atlanta, Georgia. In recent years, a number of new frontiers have opened in mathematical physics, such as many-body localization and Schrödinger operators on graphs. There has been progress in developing mathematical techniques as well, notably in renormalization group methods and the use of Lieb–Robinson bounds in various quantum models. The aim of this volume is to provide an overview of some of these developments. Topics include random Schrödinger operators, many-body fermionic systems, atomic systems, effective equations, and applications to quantum field theory. A number of articles are devoted to the very active area of Schrödinger operators on graphs and general spectral theory of Schrödinger operators. Some of the articles are expository and can be read by an advanced graduate student.
Download or read book Modern Theories of Many Particle Systems in Condensed Matter Physics written by Daniel C. Cabra and published by Springer Science & Business Media. This book was released on 2012-01-05 with total page 380 pages. Available in PDF, EPUB and Kindle. Book excerpt: Condensed matter systems where interactions are strong are inherently difficult to analyze theoretically. The situation is particularly interesting in low-dimensional systems, where quantum fluctuations play a crucial role. Here, the development of non-perturbative methods and the study of integrable field theory have facilitated the understanding of the behavior of many quasi one- and two-dimensional strongly correlated systems. In view of the same rapid development that has taken place for both experimental and numerical techniques, as well as the emergence of novel testing-grounds such as cold atoms or graphene, the current understanding of strongly correlated condensed matter systems differs quite considerably from standard textbook presentations. The present volume of lecture notes aims to fill this gap in the literature by providing a collection of authoritative tutorial reviews, covering such topics as quantum phase transitions of antiferromagnets and cuprate-based high-temperature superconductors, electronic liquid crystal phases, graphene physics, dynamical mean field theory applied to strongly correlated systems, transport through quantum dots, quantum information perspectives on many-body physics, frustrated magnetism, statistical mechanics of classical and quantum computational complexity, and integrable methods in statistical field theory. As both graduate-level text and authoritative reference on this topic, this book will benefit newcomers and more experienced researchers in this field alike.
Download or read book Foundations of Software Technology and Theoretical Computer Science written by and published by . This book was released on 2004 with total page 564 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book The Complexity of the Consistency and N representability Problems for Quantum States written by Yi-Kai Liu and published by . This book was released on 2007 with total page 115 pages. Available in PDF, EPUB and Kindle. Book excerpt: Quantum mechanics has important consequences for machines that store and manipulate information. In particular, quantum computers might be more powerful than classical computers; examples of this include Shor's algorithm for factoring and discrete logarithms, and Grover's algorithm for black-box search. Because of these theoretical results, and the possibility that we may eventually succeed in building scalable quantum computers, it is interesting to study complexity classes based on quantum computation. QMA (Quantum Merlin-Arthur) is the quantum analogue of the class NP. There are a few QMA-complete problems, most of which are variants of the "Local Hamiltonian" problem introduced by Kitaev. In this dissertation we show some new QMA-complete problems which are very different from those known previously, and have applications in quantum chemistry. The first one is "Consistency of Local Density Matrices" : given a collection of density matrices describing different subsets of an n-qubit system (where each subset has constant size), decide whether these are consistent with some global state of all n qubits. This problem was first suggested by Aharonov. We show that it is QMA-complete, via an oracle reduction from Local Hamiltonian. Our reduction is based on algorithms for convex optimization with a membership oracle, due to Yudin and Nemirovskii. Next we show that two problems from quantum chemistry, "Fermionic Local Hamiltonian" and "N-representability," are QMA-complete. These problems involve systems of fermions, rather than qubits; they arise in calculating the ground state energies of molecular systems. N-representability is particularly interesting, as it is a key component in recently developed numerical methods using the contracted Schrodinger equation. Although these problems have been studied since the 1960's, it is only recently that the theory of quantum computation has provided the right tools to properly characterize their complexity. Finally, we study some special cases of the Consistency problem, pertaining to 1-dimensional and "stoquastic" systems. We also give an alternative proof of a result due to Jaynes : whenever local density matrices are consistent, they are consistent with a Gibbs state.
Download or read book Automata Languages and Programming written by Artur Czumaj and published by Springer. This book was released on 2012-06-23 with total page 889 pages. Available in PDF, EPUB and Kindle. Book excerpt: This two-volume set of LNCS 7391 and LNCS 7392 constitutes the refereed proceedings of the 39th International Colloquium on Automata, Languages and Programming, ICALP 2012, held in Warwick, UK, in July 2012. The total of 123 revised full papers presented in this volume were carefully reviewed and selected from 432 submissions. They are organized in three tracks focussing on algorithms, complexity and games; logic, semantics, automata and theory of programming; and foundations of networked computation.
Download or read book Computational Complexity written by Sanjeev Arora and published by Cambridge University Press. This book was released on 2009-04-20 with total page 609 pages. Available in PDF, EPUB and Kindle. Book excerpt: New and classical results in computational complexity, including interactive proofs, PCP, derandomization, and quantum computation. Ideal for graduate students.
