factoring
The computational problem of finding the prime factors of a large number; classically believed hard but solvable with near-exponential speed-up on a quantum computer via Shor's algorithm, threatening RSA cryptography.
As defined in 153 | John Preskill on Quantum Computers and What They're Good For
Other definitions
Buying a receivable at a discount, or fronting cash against it, so the buyer is repaid when the underlying payment is collected.
Esoteric Credit with Ali Hamed, Brian Harwitt, and Marc Porzecanski
Where it comes up · 10
- Esoteric Assets4 claims
- 153 | John Preskill on Quantum Computers and What They're Good For3 claims
- 99 | Scott Aaronson on Complexity, Computation, and Quantum Gravity3 claims
- Update on Small Business and Private Equity2 claims
- Esoteric Credit with Ali Hamed, Brian Harwitt, and Marc Porzecanski2 claims
- Jeremy Cai - Manufacturer to Customer – [Founder’s Field Guide, EP. 33]2 claims
- Creative Investing1 claim
- AutoZone: Exemplary Capital Allocation1 claim
and 2 more
Most important claims · 10 of 20Search all claims for “factoring” →
- We cannot prove from first principles that factoring or quantum simulation problems are classically hard—factoring is not even known to be NP-hard; our confidence rests on the empirical fact that very smart people have tried for decades to find better classical algorithms and failed, which means a brilliant student could in principle discover an efficient classical algorithm tomorrow.153 | John Preskill on Quantum Computers and What They're Good For
- There are fairly convincing arguments that quantum computers will not be able to efficiently find exact solutions to NP-hard problems like the traveling salesman problem; they can speed up exhaustive search only quadratically (square-root of the classical time), which is far less spectacular than the super-polynomial, nearly exponential speed-up they provide for factoring.153 | John Preskill on Quantum Computers and What They're Good For
- Peter Shor's 1994 factoring algorithm was an eye-opener because it showed that the boundary between problems computers can and cannot solve shifts when you account for living in a quantum rather than classical world—quantum computers can factor large numbers and break widely used public-key cryptosystems like RSA, which classical computers cannot do efficiently.153 | John Preskill on Quantum Computers and What They're Good For
- Manufacturers typically receive a deposit around 30 percent when an order is placed, then factor the remaining 70 percent receivable at 80 to 90 cents on the dollar, because they depend on upfront cash flow to finance materials, inventory, labor, and equipment.Jeremy Cai - Manufacturer to Customer – [Founder’s Field Guide, EP. 33]
- AutoZone's vendor financing program pays suppliers on delayed terms while guaranteeing payment so suppliers can factor receivables at AutoZone's credit rating, letting AutoZone keep cash on its balance sheet for expansion while suppliers fund the working capital.AutoZone: Exemplary Capital Allocation
- The biggest mistake popular writers have made about quantum computers for 25 years is conflating NP with BQP — writing as if a quantum computer is a magical machine for solving all NP problems by trying each answer in a parallel universe — when in fact NP and BQP are believed to be incomparable, factoring was a lucky special case, and typical exponentially hard problems remain exponentially hard on a quantum computer.99 | Scott Aaronson on Complexity, Computation, and Quantum Gravity
- A company needing three million dollars could instead factor its two million in receivables at a premium (with about 5 percent warrant coverage), which would avoid selling roughly 3.8 percent of the company and would be better for both the company and the lender.Creative Investing
- Charter School Capital started with about $100,000 of receivables in its first year and now does a couple of $100,000 receivables every business day in a market of hundreds of millions of dollars that it created.Esoteric Assets
- Peter Shor's 1994 algorithm showed that factoring an n-digit number, the basis of most modern encryption, lies in BQP — solvable on a quantum computer in roughly N-squared operations — versus the best known classical algorithm (the number field sieve) which takes time growing exponentially in roughly the cube root of N; this exploits special structure from group theory, number theory and the Fourier transform, not mere parallel-universe trial of every divisor.99 | Scott Aaronson on Complexity, Computation, and Quantum Gravity
- Balance sheet products, meaning bridge loans, receivable factoring, or inventory-based credit lines at higher rates and without personal guarantees, are not core to private equity but are a necessary product to keep businesses and jobs alive.Update on Small Business and Private Equity