2000 character limit reached
Probabilistic Nonunitary Gate in Imaginary Time Evolution (2006.09726v2)
Published 17 Jun 2020 in quant-ph
Abstract: Simulation of quantum matters is a significant application of quantum computers. In contrast to the unitary operation which can be realized naturally on a quantum computer, the implementation of nonunitary operation, widely used in classical approaches, needs special designing. Here, by application of Grover's algorithm, we extend the probabilistic method of implementing nonunitary operation and show that it can promote success probability without fidelity decreasing. This method can be applied to problems of imaginary time evolution and contraction of tensor networks on a quantum computer.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.