QUANTON REPRESENTATION FOR EMULATING QUANTUM-LIKE COMPUTATION ON CLASSICAL PROCESSORS

• US 20160328253A1
• Filed: 05/05/2016
• Published: 11/10/2016
• Est. Priority Date: 05/05/2015
• Status: Active Grant

• Current Assignee: QlikTech International AB (Qlik Technologies)
• Original Assignee: Kyndi, Inc
• Inventors: MAJUMDAR, Arun
• Granted Patent: US 10,452,989 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 9/45504 Abstract machines for programme code execution, e.g. Java virtual machine [JVM], interpreters, emulators
• CPC Class Codes: G06N 10/00 Quantum computing, i.e. information processing based on quantum-mechanical phenomena
• CPC Class Codes: G06N 3/126 Evolutionary algorithms, e.g. genetic algorithms or genetic programming
• CPC Class Codes: G06N 7/01 Probabilistic graphical models, e.g. probabilistic networks
• CPC Class Codes: G06N 99/00 Subject matter not provided for in other groups of this subclass

Abstract

The Quanton virtual machine approximates solutions to NP-Hard problems in factorial spaces in polynomial time. The data representation and methods emulate quantum computing on classical hardware but also implement quantum computing if run on quantum hardware. The Quanton uses permutations indexed by Lehmer codes and permutation-operators to represent quantum gates and operations. A generating function embeds the indexes into a geometric object for efficient compressed representation. A nonlinear directional probability distribution is embedded to the manifold and at the tangent space to each index point is also a linear probability distribution. Simple vector operations on the distributions correspond to quantum gate operations. The Quanton provides features of quantum computing: superpositioning, quantization and entanglement surrogates. Populations of Quantons are evolved as local evolving gate operations solving problems or as solution candidates in an Estimation of Distribution algorithm. The Quanton representation and methods are fully parallel on any hardware.

Claims

1. A method of emulating a quantum like machine, the method being performed by circuitry, the method comprising:

determining a size of a largest permutation group that fits a problem size based on a Landau number;

generating a closed geometrical surface in a high-dimensional space, the closed geometrical surface corresponding the size of the largest permutation group;

embedding a lattice of vertices in the closed geometrical surface;

assigning respective permutations to corresponding vertices of the lattice;

associating linear tangent spaces to the receptive vertices of the lattice;

associating transition operators between respective permutations of the vertices of the lattice, to correspond with quantum gate operations;

associating permutations as surrogates for computation;

distributing a nonlinear directional probability distribution function across the closed geometric surface, the nonlinear directional probability distribution function representing respective likelihoods of the corresponding transition operators; and

updating the nonlinear directional probability distribution function to modify the likelihoods of the transition operators, thereby to generate an emulation of a quantum gate.