<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by Yehuda Naveh on Medium]]></title>
        <description><![CDATA[Stories by Yehuda Naveh on Medium]]></description>
        <link>https://medium.com/@yehuda_naveh?source=rss-792752e162fc------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/0*MQp3PPjX-VjmFS7f.</url>
            <title>Stories by Yehuda Naveh on Medium</title>
            <link>https://medium.com/@yehuda_naveh?source=rss-792752e162fc------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Wed, 18 Nov 2026 00:27:30 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@yehuda_naveh/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[Classical Simulators for Quantum Computers]]></title>
            <link>https://medium.com/qiskit/classical-simulators-for-quantum-computers-4b994dad4fa2?source=rss-792752e162fc------2</link>
            <guid isPermaLink="false">https://medium.com/p/4b994dad4fa2</guid>
            <category><![CDATA[quantum-computing]]></category>
            <category><![CDATA[simulation]]></category>
            <dc:creator><![CDATA[Yehuda Naveh]]></dc:creator>
            <pubDate>Mon, 25 Feb 2019 20:33:58 GMT</pubDate>
            <atom:updated>2019-02-25T20:33:58.507Z</atom:updated>
            <content:encoded><![CDATA[<p>Gadi Aleksandrowicz, Yael Ben-Haim, Yehuda Naveh, Jay M. Gambetta</p><p><strong>Why use classical simulators?</strong></p><p>Nowadays we have actual quantum computers that can be accessed via a cloud service, so why do we need classical simulators to simulate quantum computers? After all, if quantum computers could be efficiently simulated on classical computers we wouldn’t need quantum computers at all.</p><p>The thing is, quantum computer time is a scarce resource. When building and testing a new quantum circuit or algorithm, we want to run it many times, to verify things work. We want to test it over various noise scenarios. We don’t want to wait until the quantum computer is available after every change we make in the circuit we’re building. And we certainly can’t control the noise in a real quantum machine. And of course, current quantum machines are limited in the number of qubits and the noise levels they provide.</p><p><strong>Which simulators to use?</strong></p><p>Writing a simple quantum computing simulator is easy; when first learning quantum computing, we can think “Oh, the mathematical formulation is actually very easy! We can write a short script in Python which performs quantum computing right now!” and indeed, if we want to adopt the simplest viewpoint possible, we can think of quantum computing as nothing but “a vector is multiplied by a sequence of matrices” — where the (2^n)-sized vector represents our n-qubit quantum state at any point in time, and the matrices represent the quantum gates composing the circuit. However, our needs are rarely this simple.</p><p>We may want to capture “snapshots” of the quantum states in the middle of computations; we may want to perform measurements and determine the rest of the circuit according to the result; we may want to simulate quantum noises, to see how sensitive our algorithm is to noise (or how well it manages to fix it). Maybe we want the density operator of the system and not only the result of a specified number of measurements. And obviously, we want it to be fast and consume as small amounts of classical memory as possible. We can achieve all of this, but usually one comes at the expense of the other.</p><p>Let us consider two examples. If a circuit is composed exclusively from so-called Clifford gates (everything that can be built from the Hadamard, Phase, CNOT, and Measurement gates) then the Gottesman–Knill theorem tells us how to simulate this circuit on a classical computer in polynomial time. The simulator (“stabilizer simulator”) uses a vastly different representation of the quantum state — instead of storing a large vector, it stores the generators of a group stabilized by that state vector. This representation is very efficient, both memory- and time-wise; but it can only represent a very restricted set of quantum states — ones obtained from |0&gt;^n by the operation of Clifford gates only.</p><p>For the second example, let’s look at the next section</p><p><strong>The JKU simulator</strong></p><p><a href="https://qiskit.org/">Qiskit</a> is designed to include third-party simulators contributed by the quantum community at large. A prime example of such a simulator is the one created by Alwin Zulehner and Robert Wille from the <a href="http://iic.jku.at/eda/research/quantum/">quantum computation team</a> at Johannes Kepler University in Linz, Austria. Let’s call this the JKU simulator. This simulator stores quantum states using a data structure which is based on classical decision diagrams. This representation is more complex than simply storing a state vector, but if the vector has regular multiplicities, then it results in much more efficient storage space and manipulation time, while remaining able to deal with any quantum circuit, not limited, e.g., to Clifford gates.</p><p>The JKU simulator gives better run-times on many circuits, even random ones; but on circuits which create extremely diverse quantum states with few repeating values its effectiveness diminishes compared to a standard, state vector simulator. Both simulators are outperformed by the stabilizer simulator, in the cases it can be used.</p><p>As we see, different simulators are suitable for different purposes. In fact, this is exactly the behavior we expect from a problem that is inherently exponential. So rather than sticking with any one simulation approach, we would like to have at our disposal a full portfolio of simulators.</p><p>Picture 1: Comparison of state vector and JKU simulators</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/596/1*Oe2jo2N6wBPdowIkL6ixaQ.png" /><figcaption>(a) Random circuit</figcaption></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/589/1*BOPu4ZG3jg58t461UEvqmQ.png" /><figcaption>(b) Aqua VQE problem</figcaption></figure><p><strong>How to use simulators?</strong></p><p>But with a portfolio of different simulators, we don’t want to download each simulator separately, and then learn how to use it and interface to it manually; we want things to just work, and we want them to work with the same look-and-feel, the same interface. Enter <a href="https://qiskit.org/">Qiskit</a>. Using Qiskit, writing a quantum circuit is extremely simple — simply create a Python code doing what you want, or write a <a href="https://github.com/Qiskit/openqasm#openqasm">QASM</a> file and load it.</p><p>Tinkering with the configuration is easy. Adding noises is easy. Sending the circuit to a real quantum computer is easy — and running simulators is easy: create the circuit you want, decide on your backend simulator, call “execute”, and you are done. Under the covers, a very different simulation scheme can run. But from your point of view, all you needed to change is the name of the simulator.</p><p>Picture 2: Full code example of running Qiskit simulator backends</p><p><strong>from </strong>qiskit <strong>import </strong>ClassicalRegister, QuantumRegister, QuantumCircuit, execute<br> <strong>from </strong>qiskit_jku_provider <strong>import </strong>JKUProvider<br> JKU = JKUProvider()<br> <br> qubits_num = 5<br> q = QuantumRegister(qubits_num, <strong>“q”</strong>)<br> c = ClassicalRegister(qubits_num, <strong>“c”</strong>)<br> qc = QuantumCircuit(q, c, name=<strong>’ghz’</strong>)<br> <br> <em># Create a 5-qubit GHZ state<br> </em>qc.h(q[0])<br> <strong>for </strong>i <strong>in </strong>range(qubits_num — 1):<br> qc.cx(q[i], q[i+1])<br> <em># Insert a barrier before measurement<br> </em>qc.barrier()<br> <em># Measure all qubits in the standard basis<br> </em><strong>for </strong>i <strong>in </strong>range(qubits_num):<br> qc.measure(q[i], c[i])<br> <br> jku_backend = JKU.get_backend(<strong>‘qasm_simulator’</strong>)<br> job = execute(qc, backend=jku_backend, shots=1024, seed=42)<br> result = job.result()<br> print(result.get_counts())</p><p>Being able to run every simulator you want is only part of the story; most of the time we <strong>don’t</strong> want to run a specific simulator — we provide the circuit, and we’d like someone to choose the best simulator for us. Or maybe switch to another simulator if the run on one simulator takes too long or explodes in memory. At this point in time, you may run a simple script that does just that. As additional simulation schemes become part of Qiskit, Qiskit will also provide the smart way of doing such portfolio choices on any relevant subsets of the simulators.</p><p>In many cases we don’t create circuits ourselves; for example, the Qiskit <a href="https://qiskit.org/aqua">Aqua</a> package provides a set of advanced algorithms using a quantum simulator (or a real quantum computer) as one major building block. When we run such algorithms, the simulators are called on the complex quantum circuits created automatically by the algorithms. Here again, having multitude simulation schemes can help find the best approach to solve any Aqua problem we may wish to experiment.</p><p><strong>How to make your simulator a Qiskit simulator?</strong></p><p>Suppose you have written a wonderful new classical simulator of a quantum computer and want people to use it. Your next step is to contact the Qiskit team. Then we may together follow the JKU simulator path to success: Us at the Qiskit team collaborated with the JKU creators in adding the JKU simulator as a Qiskit provider simulator. Qiskit users can now seamlessly enjoy the smartness of the simulator’s algorithm and data structures with the ease of use and flexibility of Qiskit. The JKU team in return increases their opportunity to create impact, while retaining all credit for the cases their simulator was able to solve problems which were hard for other simulation schemes.</p><p>As is usual for exponential problems, the JKU simulation approach can only be good on a limited subset of circuits. So if your simulator works in sufficiently different ways than existing simulators in Qiskit, we have all reasons to hope that it will be the winner on a different subset of circuits. We would love to have it then as part of the Qiskit simulation portfolio. We invite you to repeat the success of the JKU/Qiskit framework. Submit your simulator as a Qiskit provider by following the scheme outlined in <a href="https://github.com/Qiskit/qiskit-tutorials/blob/master/qiskit/terra/creating_a_provider.ipynb">this tutorial</a>, and help cover as much of the quantum circuit simulation space as possibly can.</p><p><strong>Ready to get started?</strong></p><p>To get started with Qiskit, click <a href="https://github.com/Qiskit/qiskit-tutorial/blob/master/INSTALL.md">here</a> to find the installation and setup guides, as well as many tutorials, including the simulator example described above. We look forward to welcoming you to the Qiskit contributors team!</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=4b994dad4fa2" width="1" height="1" alt=""><hr><p><a href="https://medium.com/qiskit/classical-simulators-for-quantum-computers-4b994dad4fa2">Classical Simulators for Quantum Computers</a> was originally published in <a href="https://medium.com/qiskit">Qiskit</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Quantum Digest, Jan 29 — Feb 4, 2018]]></title>
            <link>https://medium.com/@yehuda_naveh/quantum-digest-jan-29-feb-4-2018-bd0d1b611ac7?source=rss-792752e162fc------2</link>
            <guid isPermaLink="false">https://medium.com/p/bd0d1b611ac7</guid>
            <category><![CDATA[verification]]></category>
            <category><![CDATA[science]]></category>
            <category><![CDATA[digest]]></category>
            <category><![CDATA[quantum-computing]]></category>
            <category><![CDATA[technology]]></category>
            <dc:creator><![CDATA[Yehuda Naveh]]></dc:creator>
            <pubDate>Thu, 01 Mar 2018 12:31:41 GMT</pubDate>
            <atom:updated>2018-03-01T12:41:26.541Z</atom:updated>
            <content:encoded><![CDATA[<blockquote><strong>Science and Technology</strong></blockquote><h4>Trapped ion systems</h4><p>Industry is overwhelmingly focused today on solid-state qubits, specifically Josephson junctions. This video gives a nice flavor of other ways to implement quantum machines. In fact, notwithstanding its bulkiness, a method that has some appealing virtues over solid state machines.</p><iframe src="https://cdn.embedly.com/widgets/media.html?src=https%3A%2F%2Fwww.youtube.com%2Fembed%2Fb7EJKhigjU8%3Ffeature%3Doembed&amp;url=http%3A%2F%2Fwww.youtube.com%2Fwatch%3Fv%3Db7EJKhigjU8&amp;image=https%3A%2F%2Fi.ytimg.com%2Fvi%2Fb7EJKhigjU8%2Fhqdefault.jpg&amp;key=a19fcc184b9711e1b4764040d3dc5c07&amp;type=text%2Fhtml&amp;schema=youtube" width="854" height="480" frameborder="0" scrolling="no"><a href="https://medium.com/media/aaa748224fe2cdcccedb2f901184e03b/href">https://medium.com/media/aaa748224fe2cdcccedb2f901184e03b/href</a></iframe><h4>Majorana and error correction</h4><p>If the highly esoteric Majorana particles will eventually materialize to a quantum bit (a big if), it is believed that error correction using those bits would require less resources. However, I never heard before a claim that no or almost no error correction would be needed, as seems to be implied by head of Microsofts quantum team: “Where they need 1,000 or 10,000 [qubits], we’ll only need one, because our error-correction is so much better than theirs.” (at least as quoted by the Financial Times).</p><p><a href="https://www.ft.com/content/4b40be6c-0181-11e8-9650-9c0ad2d7c5b5">Subscribe to read</a></p><h4>Caltech’s view</h4><p>Including a nice video showing actual chips and apparati. And also the connection with LIGO</p><p><a href="http://eas.caltech.edu/engenious/14/quantum_engineering">Caltech Division of Engineering and Applied Science | ENGenious | Issue 14 | Feature</a></p><blockquote><strong>Applications and business</strong></blockquote><h4>WSJ podcast with some prominent users</h4><p>I wouldn’t necessarily recommend learning quantum computing from this Wall Street Journal podcast, however, there are some interesting perspectives given from actual early leaders in usage: JP Morgan Chase CTO for equities, Volkswagen CIO, NASA, and Biogen. And since for the time being you’re in a traffic jam anyway (VW has plans to eliminate those using quantum), may be a better hear than the news.</p><p><a href="http://www.wsj.com/podcasts/the-age-of-quantum-computing-is-almost-here/381FB9AC-4B65-4267-9E57-582889D3F716.html">The Age of Quantum Computing is (Almost) Here</a></p><h4>Machine learning</h4><p>Third after quantum chemistry and optimization, we frequently hear of machine learning (ML) as a possible low-lying application. In addition to inverting large matrices, a common operation in ML, this broad overview lists several more creative ways to do classification, clustering, and generative ML — both on universal machines and annealers.</p><p><a href="https://www.quantamagazine.org/job-one-for-quantum-computers-boost-artificial-intelligence-20180129/">Job One for Quantum Computers: Boost Artificial Intelligence | Quanta Magazine</a></p><h4>Quantum entanglement for your back-pain</h4><p>If anybody has thought the hype is not there yet. Other than entanglement cures for your aching spine (read their ‘science’ page!), can’t avoid to fully quote this gem: “<em>According to the latest calculations, only 4 percent of the universal mass-energy is occupied by atomic matter and electromagnetic energy. This 4 percent is the only part of the universe of which scientific equipment is able to take measurements.” Dr. Yuri Kronn</em><strong>. </strong>So naturally, the company will use its access to the remaining 96 percents, all for your good and happiness.</p><p><a href="https://neuroreset.ca/">NeuroReset</a></p><blockquote>Education and community</blockquote><h4>Teleportation limits</h4><p>Quantum teleportation has potential uses for quantum computing as an analog of classical busses between computing units, while still preserving the quantum sense of the computation. Here, a non-mathematical overview of what you can and cannot do with a quantum teleporter, and why you’d still be better off with a Star Trek machine (or in some ways even with a 3D-fax).</p><p><a href="https://www.forbes.com/sites/chadorzel/2015/08/19/the-physics-of-star-trek-quantum-teleportation-versus-transporters">The Physics Of Star Trek: Quantum Teleportation Versus Transporters</a></p><h4>Helping design a quantum programming guide</h4><p>A Bristol group is asking for help in writing a programmer’s guide. Filling out this very short survey would allow them to better focus on places of interest and deficiencies.</p><iframe src="https://cdn.embedly.com/widgets/media.html?src=https%3A%2F%2Fdocs.google.com%2Fforms%2Fd%2Fe%2F1FAIpQLSe6xbz4UHSqs-BzN3_JXcApGobmtKobeipHkS3JhYWH3jjsEA%2Fviewform%3Fembedded%3Dtrue&amp;url=https%3A%2F%2Fdocs.google.com%2Fforms%2Fd%2Fe%2F1FAIpQLSe6xbz4UHSqs-BzN3_JXcApGobmtKobeipHkS3JhYWH3jjsEA%2Fviewform&amp;image=https%3A%2F%2Flh4.googleusercontent.com%2FetFBTMitLhC6EY4LniFE-4MOaOkT8epOHPb3B03n0i47KBtpEPYw7FJGWHrSG42y8MM%3Dw1200-h630-p&amp;key=a19fcc184b9711e1b4764040d3dc5c07&amp;type=text%2Fhtml&amp;schema=google" width="760" height="500" frameborder="0" scrolling="no"><a href="https://medium.com/media/0b665f65194a04952b8ad0cd3f074743/href">https://medium.com/media/0b665f65194a04952b8ad0cd3f074743/href</a></iframe><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=bd0d1b611ac7" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Quantum Digest, Jan 22–28, 2018]]></title>
            <link>https://medium.com/@yehuda_naveh/quantum-digest-jan-22-28-2018-74c042b5ab96?source=rss-792752e162fc------2</link>
            <guid isPermaLink="false">https://medium.com/p/74c042b5ab96</guid>
            <category><![CDATA[science]]></category>
            <category><![CDATA[technology]]></category>
            <category><![CDATA[digest]]></category>
            <category><![CDATA[verification]]></category>
            <category><![CDATA[quantum-computing]]></category>
            <dc:creator><![CDATA[Yehuda Naveh]]></dc:creator>
            <pubDate>Sat, 10 Feb 2018 22:55:45 GMT</pubDate>
            <atom:updated>2018-02-10T23:30:50.012Z</atom:updated>
            <content:encoded><![CDATA[<blockquote><strong>Technology and Science</strong></blockquote><p><strong>Intercontinental (almost fully) quantum-encrypted video-conference</strong></p><p>Not quantum computing, but related. The first intercontinental video conference. 75 minutes of quantum encrypted conference call between China and Austria, with the only classical weak links at the satellite and some ground stations. With the Beijing-Shanghai landline, and now this satellite link, China clearly takes the lead in practical long-distance quantum communication.</p><p><a href="https://www.wired.com/story/why-this-intercontinental-quantum-encrypted-video-hangout-is-a-big-deal/">Why This Intercontinental Quantum-Encrypted Video Hangout Is a Big Deal</a></p><p><strong>Silicon-based quantum computing</strong></p><p>In parallel to the main industry efforts with superconducting Josephson junctions, we should not forget the silicon-based activity. While actual achievements here in terms of qubit size and quality are far behind, advances in this area are very interesting, as traditionally silicon is viewed as having by-far more potential scalability, manufacturability, and smooth integration with classical circuits. A new Science paper which showed a working two-qubit structure reminds us of this, or we can go back to the more classical paper from 2003</p><ul><li><a href="http://science.sciencemag.org/content/359/6374/393">Toward a silicon-based quantum computer</a></li><li><a href="http://ieeexplore.ieee.org/document/1263787/">Toward a scalable, silicon-based quantum computing architecture - IEEE Journals &amp; Magazine</a></li></ul><blockquote><strong><em>Technical Write-ups</em></strong></blockquote><p><strong>Bloch Sphere</strong></p><p>Quite an extensive paper, for those who want to go deep into the Bloch sphere representation, including derivations and detailed operations. Just remember that while the Bloch sphere has clearly become the representation of choice in the quantum computation arena, it has its limits. Most importantly, it is strictly describing only single, two-level, systems. I don’t know of anything close to generalization or adaptation to any other quantum mechanical systems.</p><iframe src="https://drive.google.com/viewerng/viewer?url=http%3A//www.vcpc.univie.ac.at/%7Eian/hotlist/qc/talks/bloch-sphere.pdf&amp;embedded=true" width="600" height="780" frameborder="0" scrolling="no"><a href="https://medium.com/media/769eced95538073769ddeae63d64a471/href">https://medium.com/media/769eced95538073769ddeae63d64a471/href</a></iframe><p><strong>Noise, errors, decoherence</strong></p><p>A fair description of the status of quantum computing given the above. Remains at the descriptive levels, no math. Highlights the large number of qubits required for error-correcting, and the path forward till we have them, through useful, approximate, non-error-correcting algorithms</p><p><a href="https://www.quantamagazine.org/the-era-of-quantum-computing-is-here-outlook-cloudy-20180124/">The Era of Quantum Computing Is Here. Outlook: Cloudy | Quanta Magazine</a></p><blockquote><strong>Industry Reports</strong></blockquote><p><strong>Microsoft’s view</strong></p><p>A LinkedIn article from Microsoft, pitching quantum computing in general, and their topological technology in particular. A bit too many high words to my taste, but also some informative stuff on Microsoft’s agenda and topological qubits, especially in the second video at the bottom</p><p><a href="https://www.linkedin.com/pulse/we-ready-quantum-computing-fabio-moioli/">Are we ready for Quantum Computing?</a></p><p><strong>Atos Quantum Learning Machine</strong></p><p>An informative white paper from Atos, outlining their technical and scientific agenda, their focus on Europe, and, in most detail their Quantum Learning Machine backed by a powerful simulator for up to 40 qubits. In short, wishes to provide the methodology and software to enable learning and development of quantum software, before we have the machines.</p><iframe src="https://drive.google.com/viewerng/viewer?url=https%3A//atos.net/wp-content/uploads/2017/07/atos-quantum-learning-machine.pdf&amp;embedded=true" width="600" height="780" frameborder="0" scrolling="no"><a href="https://medium.com/media/f952c6da4b6726637d060e1f8cfbdf42/href">https://medium.com/media/f952c6da4b6726637d060e1f8cfbdf42/href</a></iframe><blockquote><strong>Public and Politics</strong></blockquote><p><strong>Race to quantum recognized at the national level</strong></p><p>Australian of the year — Australia’s most prestigious civic honor — is Michelle Simmons, a quantum physicist, for “helping put Australia at the center of the space race of the computing era”.</p><p><a href="http://www.bbc.com/news/world-australia-42813214">Quantum physicist is Australian of the Year</a></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=74c042b5ab96" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Quantum Digest, Jan 15–21 2018]]></title>
            <link>https://medium.com/@yehuda_naveh/quantum-digest-jan-15-21-2018-799d56997f77?source=rss-792752e162fc------2</link>
            <guid isPermaLink="false">https://medium.com/p/799d56997f77</guid>
            <category><![CDATA[quantum-computing]]></category>
            <category><![CDATA[science]]></category>
            <category><![CDATA[technology]]></category>
            <category><![CDATA[digest]]></category>
            <category><![CDATA[verification]]></category>
            <dc:creator><![CDATA[Yehuda Naveh]]></dc:creator>
            <pubDate>Tue, 23 Jan 2018 22:18:11 GMT</pubDate>
            <atom:updated>2018-02-10T23:02:37.014Z</atom:updated>
            <content:encoded><![CDATA[<blockquote><strong>General Science</strong></blockquote><p><strong>Majorana particles</strong></p><p>Majorana (also referred to in this context as ‘topological quantum computing’) is the highly-scientific approach Microsoft is taking to quantum computing, compared to the more standard approach of Josephson junctions (JJ’s) taken by IBM, Google, Intel, Rigetti, and others. Here, a report in Nature by QuTech of a more ascertained observation of Majoranas. By the way, while QuTech (Leo Kouwenhoven and team) were the first observers of these quasi-particles and obviously continue working on this, still QuTech, which is part of Delft, is like most others pursuing JJ’s as their main technology — as part of their Intel partnership.</p><p>Major advantage of Majorana over JJ’s — very stable, so may require only order of 10–100 error-correcting bits for each logical bit, compared to 100–1000’s in JJ’s.</p><p>Major disadvantage — highly elusive, we are far away from it yet, compared to JJ’s which are technologically viable, not just pure science</p><p><a href="https://qutech.nl/majoranas-on-the-rise">Majoranas on the rise - QuTech</a></p><p><strong>Mechanical analog of topological state</strong></p><p>A real experiment giving some intuition of why the topological states (e.g. Majorana) are so stable to errors (note the video at the bottom of the link — that’s the actual experiment). This is not just a gimmick as the analogy is mathematical to some extent</p><p><a href="https://www.ethz.ch/en/news-and-events/eth-news/news/2015/07/soundproofing-with-quantum-physics.html">Soundproofing with quantum physics</a></p><p><strong>Boson sampling</strong></p><p>Boson sampling was one of the candidate algorithms to win the race for quantum advantage — having a quantum machine solve it faster than classical. In this case the machine needed to be quite specific, with optical (laser) implementation. This Nature article pushes the road to advantage further, as a classical algorithm is shown to solve a 30-bit problem. This is reminiscent of how IBM recently pushed another advantage candidate by solving classically another problem with 56 bits. The generalized point being that quantum advantage on a very specific problem should not be treated as such a big deal, but rather to reach a state where universal computing is working, and then advantage would be broad, not specific to a carefully designed single problem</p><p><a href="https://www.nature.com/articles/nphys4270?code=3478980d-43b3-4be5-bbfc-f56d3cc52b58">https://www.nature.com/articles/nphys4270?code=3478980d-43b3-4be5-bbfc-f56d3cc52b58</a></p><p><strong>Gaming</strong></p><p>James Wootton from Basel U designed some gaming approaches to help analyzing and comparing stabilities of different quantum machines. James has a lot of experiments on IBM Q (through Quantum Experience), some published in academic journals, some on websites. He offers his games on GitHub. James will speak in the session we organized in DATE’18 (see below)</p><p><a href="https://medium.com/@decodoku/understanding-quantum-computers-through-a-simple-puzzle-game-a290dde89fb2">Using a simple puzzle game to benchmark quantum computers</a></p><blockquote><strong>IBM Q</strong></blockquote><p><strong>Quantum and future education</strong></p><p>We usually hear of Thomas Friedman, notable commentator and 3-times Pulitzer prize winner, when he has things to say about Netanyahu, West Bank settlements, or peace in the middle east at large. But here he provides an outsider’s view of IBM Q, based on a site visit and interviews with IBM CEO Ginni Rometty and Director of Research Arvind Krishna, and the fears it (unjustifiably) arouses. Of course, not missing the opportunity to take the obligatory shots at Trump as required</p><p><a href="https://www.nytimes.com/2018/01/16/opinion/while-you-were-sleeping.html">Opinion | While You Were Sleeping</a></p><p><strong>IBM Prizes</strong></p><p>New 1000–10,000 USD prizes announced by IBM in four categories of usage of IBM Q Experience / QISKit: best teaching curriculum, best research paper by a young scientist, best single-topic tutorial, and best optimized quantum compiler (actual software). Share with your university colleagues!</p><p><a href="https://www.ibm.com/blogs/research/2018/01/quantum-prizes/">Quantum computing prizes introduced for users of the IBM Q Experience</a></p><p><strong>A session in DATE’18 on verification of quantum computers</strong></p><p>A session we organized in the second-most-important design automation conference (after DAC) — looking forward to this first bridge between the classical verification community with all the lessons learnt from fifty years of design automation discipline, and the newly emerging quantum chip community</p><p><a href="https://www.date-conference.com/conference/session/7.1">7.1 Special Day Session on Future and Emerging Technologies: Theoretical and practical aspects of verification of quantum computers | DATE 2018</a></p><p>�� $�</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=799d56997f77" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>