HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
ngnrsaa
qflex
OPEN SOURCE2019–2019
ngnrsaa / qflex

qflex

Discover this repository through its Hacker News conversations.

2Distinct people
2Mentions
0Explicit recommenders
0GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

A public description has not been verified.

Where it is used

No documented product use has been verified yet.

What people are saying

No recommendation phrase was found in the indexed comments.

No classified warning is attached to this page. Read the discussions before treating silence as approval.

Also in these discussions

No other repository is repeatedly linked in the same discussions.

This week on Hacker News

Nov 7–Nov 14 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/14/2026, 3:56:07 PM UTC.

No direct repository links were found in the indexed HN discussions over the past seven days. Older discussions are available below.

Mentions over time

HN mentions by day2 dated mentions

Observed mentions: 2019-11-24 21:45:24 UTC to 2019-12-03 00:11:08 UTC.

012019-11-24 00:00:00 UTC to 2019-11-25 00:00:00 UTC (exclusive): 1 mentions; 1 submissions, 0 commentsNov 242019-11-25 00:00:00 UTC to 2019-11-26 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-11-26 00:00:00 UTC to 2019-11-27 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-11-27 00:00:00 UTC to 2019-11-28 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-11-28 00:00:00 UTC to 2019-11-29 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 commentsNov 282019-11-29 00:00:00 UTC to 2019-11-30 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-11-30 00:00:00 UTC to 2019-12-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-12-01 00:00:00 UTC to 2019-12-02 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-12-02 00:00:00 UTC to 2019-12-03 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2019-12-03 00:00:00 UTC to 2019-12-04 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsDec 3

Counts come from the repository’s dated source evidence. Index cutoff: 2026-11-02 08:16:59 UTC.

View mention counts and date ranges
UTC ranges include their start and exclude their end. Select a period to filter the source evidence.
PeriodStart (UTC)End (exclusive, UTC)MentionsSubmissionsComments
Nov 242019-11-24 00:00:00 UTC2019-11-25 00:00:00 UTC110
Nov 252019-11-25 00:00:00 UTC2019-11-26 00:00:00 UTC000
Nov 262019-11-26 00:00:00 UTC2019-11-27 00:00:00 UTC000
Nov 272019-11-27 00:00:00 UTC2019-11-28 00:00:00 UTC000
Nov 282019-11-28 00:00:00 UTC2019-11-29 00:00:00 UTC000
Nov 292019-11-29 00:00:00 UTC2019-11-30 00:00:00 UTC000
Nov 302019-11-30 00:00:00 UTC2019-12-01 00:00:00 UTC000
Dec 12019-12-01 00:00:00 UTC2019-12-02 00:00:00 UTC000
Dec 22019-12-02 00:00:00 UTC2019-12-03 00:00:00 UTC000
Dec 32019-12-03 00:00:00 UTC2019-12-04 00:00:00 UTC101

What Hacker News says

2 sources
> Before we declare quantum supremacy, we should make sure the simulator we are comparing with is a good one, not a straw-man one. A big part of writing the supremacy paper was optimizing the simulators. We did three different styles of simulation: 1) A state vector simulator with hand rolled SIMD assembly (called qSim; not yet publicaly released). This required too much space at 53 qubits. (Well, unless you're going to use the majority of all disk space on summit, which brings its own obstacles. IBM says they can run it that way in a few days, but we'll see.) 2) Treating the quantum circuit as a tensor network and doing optimized contraction to avoid the space blowup (called qFlex https://github.com/ngnrsaa/qflex). This required too much time at 53 qubits. 3) Custom code written to run on a supercomputer instead of distributed computers.
Read the rest
There's only so much effort you can put in before you have to call it. I think it's more likely for an algorithmic break to save a factor of 10 than for optimization to save a factor of 10 at this point.. although someone should probably try using GPUs or FPGAs. I also take the view that if it takes a month to produce a new optimized implementation of a classical simulator that beats the quantum hardware, then the quantum hardware is still outperforming classical hardware for that month. The theoretical bounds are important, but in the day-to-day context of a race they aren't directly relevant.
In Amazon Braket – Get Started with Quantum Computing

MAKE YOURSELF AT HOME

A few shortcuts

/
Search the collection
?
Open this guide
Esc
Close dialogs and navigation

Your saved repositories and interests stay in this browser.