Related papers: Beyond Quantum Computation and Towards Quantum Fie…
Can we reduce Quantum Field Theory (QFT) to a quantum computation? Can physics be simulated by a quantum computer? Do we believe that a quantum field is ultimately made of a numerable set of quantum systems that are unitarily interacting? A…
The complexity of quantum computation remains poorly understood. While physicists attempt to find ways to create quantum computers, we still do not have much evidence one way or the other as to how useful these machines will be. The tools…
Proposed quantum experiments in deep space will be able to explore quantum information issues in regimes where relativistic effects are important. In this essay, we argue that a proper extension of Quantum Information theory into the…
Quantum computers will work by evolving a high tensor power of a small (e.g. two) dimensional Hilbert space by local gates, which can be implemented by applying a local Hamiltonian H for a time t. In contrast to this quantum engineering,…
In the last few years, theoretical study of quantum systems serving as computational devices has achieved tremendous progress. We now have strong theoretical evidence that quantum computers, if built, might be used as a dramatically…
Quantum Field Theory (QFT) represents a vast generalization of Quantum Mechanics (QM), as it deals with systems that have an infinite number of degrees of freedom. The Stone-von Neumann theorem, which establishes the equivalence of…
The problem of infinities in quantum field theory (QRT) is a long standing problem in physics.For solving this problem, different renormalization techniques have been suggested but the problem still persists. Here we suggest another…
Recent theoretical results confirm that quantum theory provides the possibility of new ways of performing efficient calculations. The most striking example is the factoring problem. It has recently been shown that computers that exploit…
We explain that a bulk with arbitrary dimensions can be added to the space over which a quantum field theory is defined. This gives a TQFT such that its correlation functions in a slice are the same as those of the original quantum field…
Quantum complexity quantifies the difficulty of preparing a state or implementing a unitary transformation with limited resources. Applications range from quantum computation to condensed matter physics and quantum gravity. We seek to…
A quantum gravity computer is one for which the particular effects of quantum gravity are relevant. In general relativity, causal structure is non-fixed. In quantum theory non-fixed quantities are subject to quantum uncertainty. It is…
Explicit realizations of quantum field theory (QFT) are admitted by a revision to the Wightman axioms for the vacuum expectation values (VEV) of fields. The technical development of QFT is expanded beyond positive functionals on *-algebras…
Algebraic quantum field theory provides a general, mathematically precise description of the structure of quantum field theories, and then draws out consequences of this structure by means of various mathematical tools -- the theory of…
In the present paper we propose a new approach to quantum fields in terms of category algebras and states on categories. We define quantum fields and their states as category algebras and states on causal categories with partial involution…
Quantum Computing is a new and exciting field at the intersection of mathematics, computer science and physics. It concerns a utilization of quantum mechanics to improve the efficiency of computation. Here we present a gentle introduction…
Quantum field theory provides the framework for the most fundamental physical theories to be confirmed experimentally and has enabled predictions of unprecedented precision. However, calculations of physical observables often require great…
Nuclear physics, whose underling theory is described by quantum gauge field coupled with matter, is fundamentally important and yet is formidably challenge for simulation with classical computers. Quantum computing provides a perhaps…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
Some explanations and implications of the underlying theory approach for quantum theories (QM or QFT) are discussed and suggested. This simple idea seems to have significantly nontrivial effects for our understanding of the quantum…
Having started with the general formulation of the quantum theory of the real scalar field (QFT) in the general Riemannian space--time $ V_{1,3} $, the general--covariant quasinonrelativistic quantum mechanics of a point-like spinless…