HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
quil-lang
quilc
Common Lisp2021–2025
quil-lang / quilc

quilc

The optimizing Quil compiler.

7Distinct people
8Mentions
0Explicit recommenders
491GitHub stars
REPOSITORY AT A GLANCE

What to know before exploring

What it is

The optimizing Quil compiler.

GitHub

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

Mentioned in the same Hacker News threads. That is not proof they are substitutes.

This week on Hacker News

Nov 9–Nov 16 UTC · Direct repository links and separately labeled related project stories. Indexed through 11/16/2026, 12:56:33 AM 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 year8 dated mentions

Observed mentions: 2021-10-24 15:00:11 UTC to 2025-04-29 18:25:33 UTC.

0122021-01-01 00:00:00 UTC to 2022-01-01 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments20212022-01-01 00:00:00 UTC to 2023-01-01 00:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 comments2023-01-01 00:00:00 UTC to 2024-01-01 00:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 comments20232024-01-01 00:00:00 UTC to 2025-01-01 00:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 comments2025-01-01 00:00:00 UTC to 2026-01-01 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 comments2025

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
20212021-01-01 00:00:00 UTC2022-01-01 00:00:00 UTC101
20222022-01-01 00:00:00 UTC2023-01-01 00:00:00 UTC202
20232023-01-01 00:00:00 UTC2024-01-01 00:00:00 UTC202
20242024-01-01 00:00:00 UTC2025-01-01 00:00:00 UTC202
20252025-01-01 00:00:00 UTC2026-01-01 00:00:00 UTC101

What Hacker News says

2 sources
HN perhaps isn't the right forum for this kind of commentary, but here it is anyway... This is a schematic for a new physical implementation of a particular mathematical operation, on a specific modality of qubit. The same mathematical operation can be computed on any other quantum computer in production today; very easily so if you use a compiler like QUILC [0]. Some architectures even have ways of doing native Toffolis. Unfortunately, I don't personally believe the headline summary and following text are written in good faith. > Researchers discover a new method to perform the N-qubit Toffoli gate, a more efficient quantum operation helpful in scaling quantum algorithms. They did discover a new way to perform this mathematical operation (the N-qubit Toffoli), but it's highly dubious that it will "scale" any existing quantum algorithm up
Read the rest
in any useful manner. Toffoli is like a quantum computing "NAND"-gate of sorts, it's useful in building up larger computations (like adders and multipliers). The problem is, it's not error corrected. So imagine building a full-adder, but every logic gate is inaccurate by about 1%. In series, those 1%'s rack up quickly. > New family of N-qubit gates can only be run on IonQ quantum computer architecture. This is hugely misleading. You can do an N-qubit Toffoli on any computer. That's what a compiler is for. That's like saying "You can only do AES encryption on Intel processors because they have the instruction for it." It's not true. You can do AES on any computing architecture, especially if you have an implementation in a portable programming language. > Once implemented, gate is expected to speed up several fundamental algorithms for quantum computing. Like what? Again, it's unlikely. A non-error-corrected Toffoli has limited utility, unless there's deep research in NISQ algorithms using slightly unfaithful Toffoli operations profitably that I'm unaware of. Later in the article they mention: > IonQ and Duke’s discovery may lead to significant efficiency gains in solving fundamental quantum algorithms, such as Grover’s search algorithm, variational quantum eigensolvers (VQEs), and arithmetic operations like addition and multiplication. Grover requires a fault-tolerant oracle for non-trivial problems, so that's out. Arithmetic the same (see above). Nobody to my knowledge has developed any reasonable Ansätze for VQE that use Toffoli gates that outperform existing ones—and VQE doesn't exactly have a lustrous record anyway for doing anything useful at scale. I think IonQ has made an interesting scientific achievement, and might even make for a few cool proof-of-concept demos, but it's hard to believe it'll lead to much of anything useful. Their speculation in the article, in my opinion, is squarely out-of-bounds. [0] https://github.com/quil-lang/quilc
In Duke University and IonQ Develop New Quantum Computing Gate

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.