<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hacker News: wzeng</title><link>https://news.ycombinator.com/user?id=wzeng</link><description>Hacker News RSS</description><docs>https://hnrss.org/</docs><generator>hnrss v2.1.1</generator><lastBuildDate>Sat, 06 Jun 2026 09:52:43 +0000</lastBuildDate><atom:link href="https://hnrss.org/user?id=wzeng" rel="self" type="application/rss+xml"></atom:link><item><title><![CDATA[Sci/acc: what happens to science after super-intelligence?]]></title><description><![CDATA[
<p>Article URL: <a href="https://willzeng.com/shared/sciacc.html">https://willzeng.com/shared/sciacc.html</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=48201934">https://news.ycombinator.com/item?id=48201934</a></p>
<p>Points: 2</p>
<p># Comments: 1</p>
]]></description><pubDate>Wed, 20 May 2026 01:29:55 +0000</pubDate><link>https://willzeng.com/shared/sciacc.html</link><dc:creator>wzeng</dc:creator><comments>https://news.ycombinator.com/item?id=48201934</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=48201934</guid></item><item><title><![CDATA[New comment by wzeng in "Looking at some claims that quantum computers won't work"]]></title><description><![CDATA[
<p>We don’t need exponentially more physical qubits because we have quantum error correction schemes that exponentially decrease the logical error rate with only a polynomial increase in the number of qubits. There are in fact many schemes for this (<a href="https://errorcorrectionzoo.org/" rel="nofollow">https://errorcorrectionzoo.org/</a>) with the surface code mentioned in the blog being a leading approach.<p>Details for how this could work for factoring are here:
<a href="https://arxiv.org/abs/1905.09749" rel="nofollow">https://arxiv.org/abs/1905.09749</a><p>There will be engineering challenges to scale up these implementations but in principal you shouldn’t need exponential resources (unless there is something wrong with quantum mechanics). This sort of error correction scaling does not exist, for example, for analog computing.</p>
]]></description><pubDate>Sun, 19 Jan 2025 00:16:04 +0000</pubDate><link>https://news.ycombinator.com/item?id=42752539</link><dc:creator>wzeng</dc:creator><comments>https://news.ycombinator.com/item?id=42752539</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42752539</guid></item><item><title><![CDATA[New comment by wzeng in "Looking at some claims that quantum computers won't work"]]></title><description><![CDATA[
<p>Several approaches are better than the break even point today, including the Google demonstration of error correction working to reduce logical errors: <a href="https://www.nature.com/articles/s41586-024-08449-y" rel="nofollow">https://www.nature.com/articles/s41586-024-08449-y</a><p>There’s more citations to gate fidelity progress here: <a href="https://metriq.info/Task/38" rel="nofollow">https://metriq.info/Task/38</a></p>
]]></description><pubDate>Sun, 19 Jan 2025 00:10:30 +0000</pubDate><link>https://news.ycombinator.com/item?id=42752504</link><dc:creator>wzeng</dc:creator><comments>https://news.ycombinator.com/item?id=42752504</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42752504</guid></item><item><title><![CDATA[New comment by wzeng in "Artificial Intelligence for Quantum Computing"]]></title><description><![CDATA[
<p>You can track resource estimates for different problems against QC performance here: <a href="https://metriq.info/progress" rel="nofollow">https://metriq.info/progress</a><p>It crowdsources new submissions to the chart if there are ones you see missing (just open a PR)</p>
]]></description><pubDate>Sat, 16 Nov 2024 15:09:39 +0000</pubDate><link>https://news.ycombinator.com/item?id=42156816</link><dc:creator>wzeng</dc:creator><comments>https://news.ycombinator.com/item?id=42156816</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=42156816</guid></item><item><title><![CDATA[New comment by wzeng in "Hello Many Worlds in Seven Quantum Languages (2021)"]]></title><description><![CDATA[
<p>The cQASM that you link to is one of the flavors of QASM. Another commonly used one is openqasm whose 2.0 and 3.0 specs are here: <a href="https://github.com/Qiskit/openqasm" rel="nofollow">https://github.com/Qiskit/openqasm</a><p>Along with QIR like as is listed in the comment, these are two open assembly specs with collaborative governance. Another is Quil: <a href="https://github.com/quil-lang/quil" rel="nofollow">https://github.com/quil-lang/quil</a><p>While quantum computing has a history of using circuit diagrams (which are still very useful) to represent programs. These languages have representations under the hood that look a lot more like assembly. For example: <a href="https://github.com/Qiskit/openqasm/blob/master/examples/adder.qasm" rel="nofollow">https://github.com/Qiskit/openqasm/blob/master/examples/adde...</a></p>
]]></description><pubDate>Wed, 16 Feb 2022 18:52:53 +0000</pubDate><link>https://news.ycombinator.com/item?id=30364057</link><dc:creator>wzeng</dc:creator><comments>https://news.ycombinator.com/item?id=30364057</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=30364057</guid></item><item><title><![CDATA[New comment by wzeng in "Fund-my-project: Earn grants/funding for your project"]]></title><description><![CDATA[
<p>If open source quantum computing is your thing then <a href="https://unitary.fund/" rel="nofollow">https://unitary.fund/</a> could use help supporting and mentoring projects. We're domain specific, but this might be a model others can follow.</p>
]]></description><pubDate>Sun, 22 Mar 2020 00:10:55 +0000</pubDate><link>https://news.ycombinator.com/item?id=22651425</link><dc:creator>wzeng</dc:creator><comments>https://news.ycombinator.com/item?id=22651425</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=22651425</guid></item><item><title><![CDATA[Unpacking the Quantum Supremacy Benchmark with Python]]></title><description><![CDATA[
<p>Article URL: <a href="https://medium.com/@sohaib.alam/unpacking-the-quantum-supremacy-benchmark-with-python-67a46709d">https://medium.com/@sohaib.alam/unpacking-the-quantum-supremacy-benchmark-with-python-67a46709d</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=21508809">https://news.ycombinator.com/item?id=21508809</a></p>
<p>Points: 2</p>
<p># Comments: 0</p>
]]></description><pubDate>Mon, 11 Nov 2019 20:54:01 +0000</pubDate><link>https://medium.com/@sohaib.alam/unpacking-the-quantum-supremacy-benchmark-with-python-67a46709d</link><dc:creator>wzeng</dc:creator><comments>https://news.ycombinator.com/item?id=21508809</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=21508809</guid></item><item><title><![CDATA[New comment by wzeng in "Getting Started with Quantum Computing in Python"]]></title><description><![CDATA[
<p>Another open source Python framework is Forest from Rigetti Computing. <a href="https://www.rigetti.com/products" rel="nofollow">https://www.rigetti.com/products</a><p>A simple getting started post on a similar topic is here: <a href="https://medium.com/rigetti/how-to-write-a-quantum-program-in-10-lines-of-code-for-beginners-540224ac6b45" rel="nofollow">https://medium.com/rigetti/how-to-write-a-quantum-program-in...</a> which might be useful for comparison.</p>
]]></description><pubDate>Mon, 23 Jul 2018 00:39:59 +0000</pubDate><link>https://news.ycombinator.com/item?id=17589696</link><dc:creator>wzeng</dc:creator><comments>https://news.ycombinator.com/item?id=17589696</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=17589696</guid></item><item><title><![CDATA[New comment by wzeng in "I'm Scott Aaronson, quantum computing/computational complexity researcher. AMA"]]></title><description><![CDATA[
<p>There is a Bay Area Quantum Computing meetup (I'm one of the organizers!)<p><a href="https://www.meetup.com/Bay-Area-Quantum-Computing-Meetup/" rel="nofollow">https://www.meetup.com/Bay-Area-Quantum-Computing-Meetup/</a><p>Next one will likely be at the end of July. Hope to see you there!</p>
]]></description><pubDate>Sat, 30 Jun 2018 20:33:12 +0000</pubDate><link>https://news.ycombinator.com/item?id=17432619</link><dc:creator>wzeng</dc:creator><comments>https://news.ycombinator.com/item?id=17432619</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=17432619</guid></item><item><title><![CDATA[New comment by wzeng in "Quantum Algorithm Implementations for Beginners"]]></title><description><![CDATA[
<p>This is a great question! I've worked a lot on this topic and its crucial to understanding how quantum computers will be used in the near term.<p>While I don't have an easy answer for the high level interface, the assembly level interface between quantum and classical computing is also important. If you're interested in that then you should check out this paper where we describe Quil, an instruction set architecture for hybrid quantum/classical computing based on shared memory: <a href="https://arxiv.org/abs/1608.03355" rel="nofollow">https://arxiv.org/abs/1608.03355</a><p>This instruction set is the basis for Rigetti Computing's Forest quantum programming environment: <a href="https://www.rigetti.com/forest" rel="nofollow">https://www.rigetti.com/forest</a></p>
]]></description><pubDate>Fri, 13 Apr 2018 16:56:09 +0000</pubDate><link>https://news.ycombinator.com/item?id=16831748</link><dc:creator>wzeng</dc:creator><comments>https://news.ycombinator.com/item?id=16831748</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=16831748</guid></item><item><title><![CDATA[New comment by wzeng in "Rigetti Forest 1.0 – programming environment for quantum/classical computing"]]></title><description><![CDATA[
<p>We haven't integrated arbitrary circuit execution features in yet, but when we do we'll make the transition as smooth as possible.<p>It's important to remember though that noise is a fact of life for this generation of small prototype quantum processors.  You'll definitely see a difference between a perfect simulation and true hardware.</p>
]]></description><pubDate>Tue, 20 Jun 2017 19:39:46 +0000</pubDate><link>https://news.ycombinator.com/item?id=14597831</link><dc:creator>wzeng</dc:creator><comments>https://news.ycombinator.com/item?id=14597831</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=14597831</guid></item><item><title><![CDATA[New comment by wzeng in "Rigetti Forest 1.0 – programming environment for quantum/classical computing"]]></title><description><![CDATA[
<p>Signing up automatically gives you access to run on the simulator.  For select users, we are providing some limited access to one of our prototype quantum processors.  It's the one discussed in this paper [0].  This initial access doesn't allow a user to run full quantum programs like on the simulator, but but one can test out a few interesting experiments.  You can read about what experiments are available here [1].  If you'd like to apply to run some experiments on our hardware then email us with some information about you and your interests at support@rigetti.com<p>The access to quantum hardware is limited at this point, but we'll be adding new features over the coming months.<p>[0] <a href="http://www.rigetti.com/papers/Demonstration_of_Universal_Parametric_Entangling_Gates_on_a_Multi-Qubit_Lattice.pdf" rel="nofollow">http://www.rigetti.com/papers/Demonstration_of_Universal_Par...</a>
[1] <a href="http://pyquil.readthedocs.io/en/latest/qpu.html" rel="nofollow">http://pyquil.readthedocs.io/en/latest/qpu.html</a></p>
]]></description><pubDate>Tue, 20 Jun 2017 19:34:10 +0000</pubDate><link>https://news.ycombinator.com/item?id=14597766</link><dc:creator>wzeng</dc:creator><comments>https://news.ycombinator.com/item?id=14597766</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=14597766</guid></item><item><title><![CDATA[New comment by wzeng in "Rigetti Forest 1.0 – programming environment for quantum/classical computing"]]></title><description><![CDATA[
<p>If you're looking for a short, and practical introduction using Python, then one is included as part of the documentation for pyQuil (part of the Forest toolkit):<p><a href="http://pyquil.readthedocs.io/en/latest/intro_to_qc.html" rel="nofollow">http://pyquil.readthedocs.io/en/latest/intro_to_qc.html</a></p>
]]></description><pubDate>Tue, 20 Jun 2017 19:23:39 +0000</pubDate><link>https://news.ycombinator.com/item?id=14597649</link><dc:creator>wzeng</dc:creator><comments>https://news.ycombinator.com/item?id=14597649</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=14597649</guid></item><item><title><![CDATA[New comment by wzeng in "Rigetti Forest 1.0 – programming environment for quantum/classical computing"]]></title><description><![CDATA[
<p>The largest full quantum computer simulation done so far is 45-qubits which was performed on the Cori supercomputer [0][1].  The main limitation in these kinds of exact simulations is memory, and so simulating 50-qubits would require about a 1000x the memory of Cori, which is infeasible.<p>There are some other methods of approximate simulation, but that gives the cut off for full, exact simulation of a quantum computer.<p>[0] <a href="https://www.nersc.gov/news-publications/nersc-news/science-news/2017-2/record-breaking-45-qubit-quantum-computing-simulation-run-at-nersc/" rel="nofollow">https://www.nersc.gov/news-publications/nersc-news/science-n...</a>
[1] <a href="https://arxiv.org/abs/1704.01127" rel="nofollow">https://arxiv.org/abs/1704.01127</a></p>
]]></description><pubDate>Tue, 20 Jun 2017 17:40:24 +0000</pubDate><link>https://news.ycombinator.com/item?id=14596702</link><dc:creator>wzeng</dc:creator><comments>https://news.ycombinator.com/item?id=14596702</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=14596702</guid></item><item><title><![CDATA[New comment by wzeng in "What would a very simple quantum program look like?"]]></title><description><![CDATA[
<p>There are libraries todat that let you do quantum programming! A simple Python library to get started with quantum programming is <a href="https://pyquil.readthedocs.io/en/latest/overview.html" rel="nofollow">https://pyquil.readthedocs.io/en/latest/overview.html</a><p>The Python library allows you to construct quantum programs and output in a quantum/classical shared memory instruction set called Quil.</p>
]]></description><pubDate>Wed, 14 Jun 2017 14:34:24 +0000</pubDate><link>https://news.ycombinator.com/item?id=14552996</link><dc:creator>wzeng</dc:creator><comments>https://news.ycombinator.com/item?id=14552996</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=14552996</guid></item><item><title><![CDATA[New comment by wzeng in "Google plans to reach a Quantum Computing milestone before the year is out"]]></title><description><![CDATA[
<p>Thinking about this demonstration as an experiment could be a little misleading.  It's somewhere between an experiment and a benchmark.  Nobody has any reason to expect new physics between 10 and 50 qubits, but actually building and controlling the system is complicated. Quantum computing is in an interesting place right now where engineering milestones and scientific milestones are happening together because the technology is so fundamental.<p>That doesn't happen that often and it's one of the most exciting things to be about being in the field. If that interest you, then you might want to come work at Rigetti Computing: "The Tiny Startup Racing Google to Build a Quantum Computing Chip" <a href="https://www.technologyreview.com/s/600711/the-tiny-startup-racing-google-to-build-a-quantum-computing-chip/" rel="nofollow">https://www.technologyreview.com/s/600711/the-tiny-startup-r...</a> We're hiring.</p>
]]></description><pubDate>Sat, 22 Apr 2017 17:56:18 +0000</pubDate><link>https://news.ycombinator.com/item?id=14173717</link><dc:creator>wzeng</dc:creator><comments>https://news.ycombinator.com/item?id=14173717</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=14173717</guid></item><item><title><![CDATA[New comment by wzeng in "Google plans to reach a Quantum Computing milestone before the year is out"]]></title><description><![CDATA[
<p>The best book out there is still Quantum Computation and Quantum Information by Nielsen and Chuang. It isn't quite current, as it lacks both the advances in hardware (superconducting qubits) and algorithms (quantum/classical hybrids & the sampling benchmark that this article is talking about).  It's still the best way to get started as it introduces everything from the linear algebra all the way up.<p>I work in quantum computing and it's the book I always recommend.</p>
]]></description><pubDate>Sat, 22 Apr 2017 17:42:48 +0000</pubDate><link>https://news.ycombinator.com/item?id=14173651</link><dc:creator>wzeng</dc:creator><comments>https://news.ycombinator.com/item?id=14173651</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=14173651</guid></item><item><title><![CDATA[Rigetti Computing raises $64M for quantum computing infrastructure and team]]></title><description><![CDATA[
<p>Article URL: <a href="http://www.prnewswire.com/news-releases/rigetti-computing-raises-64-million-in-series-a-and-b-funding-led-by-andreessen-horowitz-and-vy-capital-300430164.html?tc=eml_cleartime">http://www.prnewswire.com/news-releases/rigetti-computing-raises-64-million-in-series-a-and-b-funding-led-by-andreessen-horowitz-and-vy-capital-300430164.html?tc=eml_cleartime</a></p>
<p>Comments URL: <a href="https://news.ycombinator.com/item?id=13976968">https://news.ycombinator.com/item?id=13976968</a></p>
<p>Points: 1</p>
<p># Comments: 0</p>
]]></description><pubDate>Tue, 28 Mar 2017 14:45:05 +0000</pubDate><link>http://www.prnewswire.com/news-releases/rigetti-computing-raises-64-million-in-series-a-and-b-funding-led-by-andreessen-horowitz-and-vy-capital-300430164.html?tc=eml_cleartime</link><dc:creator>wzeng</dc:creator><comments>https://news.ycombinator.com/item?id=13976968</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=13976968</guid></item><item><title><![CDATA[New comment by wzeng in "IBM Building First Universal Quantum Computers for Business and Science"]]></title><description><![CDATA[
<p>This is great! There's a really cool ecosystem of Python tools for quantum computers that's coming out.  Check them out if you'd like to learn more about quantum programming:<p>IBM's API: <a href="https://github.com/IBM/qiskit-sdk-py" rel="nofollow">https://github.com/IBM/qiskit-sdk-py</a><p>Rigetti Computing's Forest: <a href="http://forest.rigetti.com/" rel="nofollow">http://forest.rigetti.com/</a>
<a href="https://github.com/rigetticomputing/pyquil" rel="nofollow">https://github.com/rigetticomputing/pyquil</a><p>ProjectQ: <a href="http://projectq.ch/" rel="nofollow">http://projectq.ch/</a><p>We added a really basic introduction to quantum programming into Forest that you might enjoy:
<a href="http://pyquil.readthedocs.io/en/latest/intro_to_qc.html" rel="nofollow">http://pyquil.readthedocs.io/en/latest/intro_to_qc.html</a></p>
]]></description><pubDate>Mon, 06 Mar 2017 07:30:42 +0000</pubDate><link>https://news.ycombinator.com/item?id=13801230</link><dc:creator>wzeng</dc:creator><comments>https://news.ycombinator.com/item?id=13801230</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=13801230</guid></item><item><title><![CDATA[New comment by wzeng in "List of Quantum Computing Simulators"]]></title><description><![CDATA[
<p>The textbook by Nielsen and Chuang is great. If you're looking for an abridged interactive one then you might be interested in the one in the documentation for pyQuil:<p><a href="http://pyquil.readthedocs.io/en/latest/intro_to_qc.html" rel="nofollow">http://pyquil.readthedocs.io/en/latest/intro_to_qc.html</a><p>It goes through the basics of quantum computing using the Forest toolkit.</p>
]]></description><pubDate>Sun, 12 Feb 2017 03:52:32 +0000</pubDate><link>https://news.ycombinator.com/item?id=13626599</link><dc:creator>wzeng</dc:creator><comments>https://news.ycombinator.com/item?id=13626599</comments><guid isPermaLink="false">https://news.ycombinator.com/item?id=13626599</guid></item></channel></rss>