We develop a quantum algorithm to solve combinatorial optimization problems through quantum simulation of a classical annealing process. Our algorithm combines techniques from quantum walks, quantum phase estimation, and quantum Zeno effect. It can be viewed as a quantum analogue of the discrete-time Markov chain Monte Carlo implementation of classical simulated annealing. Our implementation re...

We describe a method of investigating the near-term potential quantum communication technology for networks from perspective current networks. For this, we integrate an instance network simulator QuNetSim at link layer into emulator ComNetsEmu. This novel augmented version ComNetsEmu is thereby enabled to run arbitrary protocols between any directly connected pair hosts. To give example propose...

Efficient simulation of quantum mechanical systems is an important application of quantum computing. We build a fault-tolerant, ion-trap-based architecture for the quantum simulation algorithm, using the quantum CAD flow developed at Berkeley. First, we develop a software that, given the description of a quantum simulation problem, generates the solution circuit and optimizes it by using a laye...

By taking advantage of the laws of physics it is possible to revolutionize the way we communicate (transmit), process or even store information. It is now known that quantum computers, or computers built from quantum mechanical elements, provide new resources to solve certain problems and perform certain tasks more efficiently than today’s conventional computers. However, on the road to a compl...

Quantum simulation has become a promising avenue of research that allows one to simulate and gain insight into the models high energy physics whose experimental realizations are either complicated or inaccessible with current technology. We demonstrate quantum such model, mechanical system spatial noncommutativity, which is inspired by works in noncommutative geometry field theory for universal...