Related papers: Quantum Complexity: restrictions on algorithms and…
These lecture notes are an informal introduction to the theory of computational complexity and its links to quantum computing and statistical mechanics.
Talk presented at the conference ``Historical and Philosophical Reflections on the Foundations of Quantum Field Theory,'' at Boston University, March 1996. It will be published in the proceedings of this conference.
In this paper, the space complexity of nonuniform quantum computations is investigated. The model chosen for this are quantum branching programs, which provide a graphic description of sequential quantum algorithms. In the first part of the…
We present a ground-up redesign of the undergraduate physics degree at Loughborough University, driven by the principle of authenticity in academic and industrial practice. Departing from conventional incremental reforms, we adopt a…
Research progress in quantum computing has, thus far, focused on a narrow set of application domains. Expanding the suite of quantum application domains is vital for the discovery of new software toolchains and architectural abstractions.…
Fractional calculus is a couple of centuries old, but its development has been less embraced and it was only within the last century that a program of applications for physics started. Regarding quantum physics, it has been only in the…
This thesis establishes a number of connections between foundational issues in quantum theory, and some quantum information applications. It starts with a review of quantum contextuality and non-locality, multipartite entanglement…
The computational complexity of a quantum state quantifies how hard it is to make. `Complexity geometry', first proposed by Nielsen, is an approach to defining computational complexity using the tools of differential geometry. Here we…
Quantum computers promise to impact industrial applications, for which quantum chemical calculations are required, by virtue of their high accuracy. This perspective explores the challenges and opportunities of applying quantum computers to…
I provide an introduction to quantum computers, describing how they might be realized using language accessible to a solid state physicist. A listing of the minimal requirements for creating a quantum computer is given. I also discuss…
Quantum computing is presently undergoing rapid development to achieve a significant speedup promised in certain applications. Nonetheless, scaling quantum computers remains a formidable engineering challenge, prompting exploration of…
Quantum information science explores the frontier of highly complex quantum states, the "entanglement frontier." This study is motivated by the observation (widely believed but unproven) that classical systems cannot simulate highly…
The theory of quantum computation is presented in a self contained way from a computer science perspective. The basics of classical computation and quantum mechanics is reviewed. The circuit model of quantum computation is presented in…
Computational feasibility is a widespread concern that guides the framing and modeling of biological and artificial intelligence. The specification of cognitive system capacities is often shaped by unexamined intuitive assumptions about the…
Quantum computers have been proposed to solve a number of important problems such as discovering new drugs, new catalysts for fertilizer production, breaking encryption protocols, optimizing financial portfolios, or implementing new…
If a one-phrase summary of the subject of this thesis were required, it would be something like: miscellaneous large (but finite) dimensional phenomena in quantum information theory. That said, it could nonetheless be helpful to briefly…
This thesis develops recent work on the so called Volume-Complexity and Action-Complexity conjectures. According to this family of proposals, geometric quantities can be defined in some holographic gravitational theories that can be mapped…
The unwavering success of deep learning in the past decade led to the increasing prevalence of deep learning methods in various application fields. However, the downsides of deep learning, most prominently its lack of trustworthiness, may…
Encryption schemes attempt to provide a means for entities to communicate confidentially over a public channel. Such schemes have been studied for centuries, and their use has become widespread. However, developments in the area of quantum…
We describe new lower bounds for randomized communication complexity and query complexity which we call the partition bounds. They are expressed as the optimum value of linear programs. For communication complexity we show that the…