[Invited talk] Novel approach for the implementation of quantum walks in linear optics setups Quantum walks without coin: a link between the properties of a graph and the admissible walks over it

A universal static quantum simulator can simulate any quantum many-body system in an isomorphic manner. It can actually synthesize a duplicate of the system to be simulated. The isomorphic simulation has the great advantage that the inevitable coupling of the simulator to the environment can be fully exploited in simulating other thermodynamic processes.

Contemporary scientific studies often rely on the understanding of complex quantum systems via computer simulation. This paper initiates the statistical study of quantum simulation and proposes a Monte Carlo method for estimating analytically intractable quantities. We derive the bias and variance for the proposed Monte Carlo quantum simulation estimator and establish the asymptotic theory for ...

Quantum simulation, the idea that you can simulate a quantum system using another quantum system, is thought to be one of the main applications of quantum computation. Feynman was the first to suggest the this might be useful, given the difficulties of performing quantum simulations on classical machines [1]. Simulating the time evolution of an arbitrary quantum system is intractable for a clas...

A new type of quantum simulator is proposed which can simulate any quantum many-body system in an isomorphic manner. It can actually synthesize a duplicate of the system to be simulated. The isomorphic simulation has the great advantage that the inevitable coupling of the simulator to the environment can be fully exploited in simulating thermodynamic

Quantum computers are touted as revolutionary systems for tractably factorizing integers and solving discrete logarithms, but, in 1982, Feynman made the first proposal of a quantum computer application. He suggested that a quantum computer could efficiently simulate any local quantum system; moreover he claimed that such systems cannot in general be efficiently simulated by a (classical) Turing...