HackerReposA FIELD GUIDE TO OPEN SOURCE
ProSponsor the shelf♧ 0
← Back to top all-time
XanaduAI
strawberryfields
Python2018–2018
XanaduAI / strawberryfields · Archived

strawberryfields

Strawberry Fields is a full-stack Python library for designing, simulating, and optimizing continuous variable (CV) quantum optical circuits.

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

What to know before exploring

What it is

Strawberry Fields is a full-stack Python library for designing, simulating, and optimizing continuous variable (CV) quantum optical circuits.

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

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, 5:04:57 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 week3 dated mentions

Observed mentions: 2018-07-19 01:39:59 UTC to 2018-12-16 22:01:04 UTC. Weeks start Monday, UTC.

0122018-07-16 00:00:00 UTC to 2018-07-23 00:00:00 UTC (exclusive): 2 mentions; 0 submissions, 2 commentsJul 162018-07-23 00:00:00 UTC to 2018-07-30 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-07-30 00:00:00 UTC to 2018-08-06 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-08-06 00:00:00 UTC to 2018-08-13 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-08-13 00:00:00 UTC to 2018-08-20 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-08-20 00:00:00 UTC to 2018-08-27 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-08-27 00:00:00 UTC to 2018-09-03 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-09-03 00:00:00 UTC to 2018-09-10 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-09-10 00:00:00 UTC to 2018-09-17 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-09-17 00:00:00 UTC to 2018-09-24 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-09-24 00:00:00 UTC to 2018-10-01 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 commentsSep 242018-10-01 00:00:00 UTC to 2018-10-08 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-10-08 00:00:00 UTC to 2018-10-15 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-10-15 00:00:00 UTC to 2018-10-22 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-10-22 00:00:00 UTC to 2018-10-29 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-10-29 00:00:00 UTC to 2018-11-05 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-11-05 00:00:00 UTC to 2018-11-12 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-11-12 00:00:00 UTC to 2018-11-19 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-11-19 00:00:00 UTC to 2018-11-26 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-11-26 00:00:00 UTC to 2018-12-03 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-12-03 00:00:00 UTC to 2018-12-10 00:00:00 UTC (exclusive): 0 mentions; 0 submissions, 0 comments2018-12-10 00:00:00 UTC to 2018-12-17 00:00:00 UTC (exclusive): 1 mentions; 0 submissions, 1 commentsDec 10

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
Jul 162018-07-16 00:00:00 UTC2018-07-23 00:00:00 UTC202
Jul 232018-07-23 00:00:00 UTC2018-07-30 00:00:00 UTC000
Jul 302018-07-30 00:00:00 UTC2018-08-06 00:00:00 UTC000
Aug 62018-08-06 00:00:00 UTC2018-08-13 00:00:00 UTC000
Aug 132018-08-13 00:00:00 UTC2018-08-20 00:00:00 UTC000
Aug 202018-08-20 00:00:00 UTC2018-08-27 00:00:00 UTC000
Aug 272018-08-27 00:00:00 UTC2018-09-03 00:00:00 UTC000
Sep 32018-09-03 00:00:00 UTC2018-09-10 00:00:00 UTC000
Sep 102018-09-10 00:00:00 UTC2018-09-17 00:00:00 UTC000
Sep 172018-09-17 00:00:00 UTC2018-09-24 00:00:00 UTC000
Sep 242018-09-24 00:00:00 UTC2018-10-01 00:00:00 UTC000
Oct 12018-10-01 00:00:00 UTC2018-10-08 00:00:00 UTC000
Oct 82018-10-08 00:00:00 UTC2018-10-15 00:00:00 UTC000
Oct 152018-10-15 00:00:00 UTC2018-10-22 00:00:00 UTC000
Oct 222018-10-22 00:00:00 UTC2018-10-29 00:00:00 UTC000
Oct 292018-10-29 00:00:00 UTC2018-11-05 00:00:00 UTC000
Nov 52018-11-05 00:00:00 UTC2018-11-12 00:00:00 UTC000
Nov 122018-11-12 00:00:00 UTC2018-11-19 00:00:00 UTC000
Nov 192018-11-19 00:00:00 UTC2018-11-26 00:00:00 UTC000
Nov 262018-11-26 00:00:00 UTC2018-12-03 00:00:00 UTC000
Dec 32018-12-03 00:00:00 UTC2018-12-10 00:00:00 UTC000
Dec 102018-12-10 00:00:00 UTC2018-12-17 00:00:00 UTC101

What Hacker News says

3 sources
I'm one of the developers on PennyLane, a cross-platform Python library for quantum machine learning (QML), automatic differentiation, and optimization of hybrid quantum-classical computations. For a while now, QML has been getting a lot of hype --- at the Quantum2Business conference the other day, a quote that made the rounds was "QML: most overhyped and underestimated field at the same time" (attributed to Iordanis Kerenidis, I believe). However, current research has been showing a lot of promise, especially as an application for near-term quantum devices, that doesn't require an exceptionally large number of fault tolerant qubits. At the moment, the main approach to QML has been the so-called 'variational circuit' approach, where a parameterised quantum circuit is evaluated on quantum hardware, with optimization/machine learning then p
Read the rest
erformed by an external classical ML library, such as TensorFlow/PyTorch. However, this is not the most optimal approach - the most optimal approach is to take advantage of the quantum hardware to also perform the optimization. This was our goal with PennyLane. Before we could even start designing the library, we needed to know how to analytically evaluate gradients on quantum circuits; so we performed the research, discovered some cool analytic tricks, and published this separately [1]. This forms the backbone of PennyLane - the exact same quantum circuits used in the machine learning model are also used to calculate the gradient during backpropagation. As a result, you can construct arbitrarily complex classical-quantum models, with both the quantum and classical parts natively 'backpropagation aware'. Even more ambitiously, we wanted an environment where you can build a hybrid classical-quantum computational model, using not only different quantum hardware devices at once, but different hardware devices from different hardware vendors. By taking advantage of all near-term quantum hardware currently available - even those using fundamentally different models, such as qubits vs. photonic modes - you can build significantly more powerful computations. Currently, we have plugins available for [ProjectQ](https://projectq.ch), [Strawberry Fields](https://github.com/XanaduAI/strawberryfields), [Qiskit](https://qiskit.org/), and more to come. Feel free to ask any questions you might have on PennyLane, the state of QML, and quantum computation in general! [1] Evaluating analytic gradients on quantum hardware (https://arxiv.org/abs/1811.11184) [2] Check out the PennyLane documentation for the nitty-gritty on our analytic gradient approach to QML: https://pennylane.readthedocs.io
In Show HN: Hardware-agnostic library for near-term quantum machine learning

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.