4.7k citations · 9.3k across the 70 of their papers we have counts for
7 papers · 2 filters
Solving search problems by strongly simulating quantum circuits
T. H. Johnson, J. D. Biamonte, S. R. Clark +1
Simulating quantum circuits using classical computers lets us analyse the inner workings of quantum algorithms. The most complete type of simulation, strong simulation, is believed…
Quantum Techniques for Stochastic Mechanics
John C. Baez, Jacob Biamonte
Some ideas from quantum theory are just beginning to percolate back to classical probability theory. For example, there is a widely used and successful theory of "chemical reaction…
Tensor Network Methods for Invariant Theory
Jacob Biamonte, Ville Bergholm, Marco Lanzagorta
Invariant theory is concerned with functions that do not change under the action of a given group. Here we communicate an approach based on tensor networks to represent polynomial…
Quantum Transport Enhancement by Time-Reversal Symmetry Breaking
Zoltan Zimboras, Mauro Faccin, Zoltan Kadar +3
Quantum mechanics still provides new unexpected effects when considering the transport of energy and information. Models of continuous time quantum walks, which implicitly use time…
Undecidability in Tensor Network States
Jason Morton, Jacob Biamonte
Recent work has examined how undecidable problems can arise in quantum information science. We augment this by introducing three new undecidable problems stated in terms of tensor…
Ground State Spin Logic
J. D. Whitfield, M. Faccin, J. D. Biamonte
Designing and optimizing cost functions and energy landscapes is a problem encountered in many fields of science and engineering. These landscapes and cost functions can be embedde…