Constant depth, near constant depth, and subcubic size threshold circuits for linear algebraic calculations
A method of increasing an efficiency at which a plurality of threshold gates arranged as neuromorphic hardware is able to perform a linear algebraic calculation having a dominant size of N. The computer-implemented method includes using the plurality of threshold gates to perform the linear algebraic calculation in a manner that is simultaneously efficient and at a near constant depth. “Efficient” is defined as a calculation algorithm that uses fewer of the plurality of threshold gates than a naïve algorithm. The naïve algorithm is a straightforward algorithm for solving the linear algebraic calculation. “Constant depth” is defined as an algorithm that has an execution time that is independent of a size of an input to the linear algebraic calculation. The near constant depth comprises a computing depth equal to or between O(log(log(N)) and the constant depth.
- Research Organization:
- Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- NA0003525
- Assignee:
- National Technology & Engineering Solutions of Sandia, LLC (Albuquerque, NM)
- Patent Number(s):
- 10,445,065
- Application Number:
- 15/699,077
- OSTI ID:
- 1600161
- Resource Relation:
- Patent File Date: 09/08/2017
- Country of Publication:
- United States
- Language:
- English
Similar Records
Quantum Coding with Low-Depth Random Circuits
Globally Optimizing QAOA Circuit Depth for Constrained Optimization Problems