Efficient simulation system of quantum algorithm gates on classical computer based on fast algorithm
OwnerSergey Ulyanov, Sergey Panfilovinventors
Life of this patent
Estimating the term…
Abstract
An efficient simulation system of quantum algorithm gates for classical computers with a Von Neumann architecture is described. In one embodiment, a Quantum Algorithm is solved using an algorithmic-based approach, wherein matrix elements of the quantum gate are calculated on demand. In one embodiment, a problem-oriented approach to implementing Grover's algorithm is provided with a termination condition determined by observation of Shannon minimum entropy. In one embodiment, a Quantum Control Algorithm is solved by using a reduced number of quantum operations.
Claims33
A method for simulating a quantum algorithm on a classical computer, comprising:
- applying a unitary matrix quantum gate G to an initial vector to produce a basis vector;
- measuring said basis vector, wherein elements of said quantum gate G are computed on an as-needed basis;
- repeating said steps of applying and measuring k times, where k is selected to minimize Shannon entropy of said basis vector;
- and
- decoding said basis vectors, said decoding including translating said basis vectors into an output vector.
An intelligent control system comprising a quantum search algorithm configured to minimize Shannon entropy comprising:
- a genetic optimizer configured to construct one or more local solutions using a fitness function configured to minimize a rate of entropy production of a controlled plant;
- and a quantum search algorithm configured to search said local solutions to find a global solution using a gate G expressing a fitness function configured to minimize Shannon entropy, said gate G corresponding to an entanglement-free quantum algorithm for efficient simulation, and wherein elements of said gate G are computed on an as-needed basis.
A method for global optimization to improve a quality of a sub-optimal solution comprising the steps of:
- selecting a first gate G corresponding to a first quantum process, modifying said first gate G into a second gate G corresponding to a second quantum process;
- having pseudo-pure states;
- applying a first transformation to an initial state to produce a coherent superposition of basis states;
- applying a second transformation to said coherent superposition using a reversible transformation according to said second gate G to produce coherent output states;
- applying a third transformation to said coherent output states to produce an interference of output states;
- and selecting a global solution from said interference of output states.
A method for terminating iterations of a quantum algorithm, comprising:
- performing an interation of a quantum algorithm to produce a measurement vector;
- computing a Shannon entropy of said measurement vector;
- selecting a termination condition from at least one of:
- a first local Shannon entropy minimum, a lowest Shannon entropy within a predefined number of iterations;
- a predefined level of acceptable Shannon entropy;
- and
- repeating said performing and computing until said termination condition is satisfied.
A method for intelligent control comprising a quantum search algorithm corresponding to a quantum system on entanglement-free states configured to minimize Shannon entropy comprising:
- optimizing one or more local solutions using a fitness function configured to minimize a rate of entropy production of a controlled plant;
- and searching, using a quantum search algorithm to search said local solutions to find a global solution using a fitness function to minimize Shannon entropy.
A global optimizer to improve a quality of a sub-optimal solution, said optimizer comprising of a computer software loaded into a memory, said software comprising:
- a first module for applying a first transformation to an initial state to produce a coherent superposition of basis states;
- a second module for applying a second transformation to said coherent superposition using a reversible transformation to produce one or more entanglement-free output states;
- a third module for applying a third transformation to said one or more coherent output states to produce an interference of output states;
- and a fourth module for selecting a global solution from said interference of output states.
Dependencies are inferred from the claim text.