Topics Top articles New articles Updated articles Top users New users New discussions Top discussions New comments+ New article
The official hello world is documented at: qiskit.org/documentation/intro_tutorial1.html and contains a Bell state circuit.
Our version at qiskit/hello.py.
You get an error like this if you forget to call Related: quantumcomputing.stackexchange.com/questions/34396/aererror-unknown-instruction-c-unitary-while-using-control-unitary-operator/35132#35132
qiskit.transpile():qiskit_aer.aererror.AerError: 'unknown instruction: QFT' Quantum circuit description language by 
Ciro Santilli 35 Updated 2025-01-10 +Created 1970-01-01
Ciro Santilli 35 Updated 2025-01-10 +Created 1970-01-01These are a bit like the Verilog of quantum computing.
One would hope that they are not Turing complete, this way they may serve as a way to pass on data in such a way that the receiver knows they will only be doing so much computation in advance to unpack the circuit. So it would be like JSON is for JavaScript.
Organization developing quantum control systems by Ciro Santilli 35 Updated 2025-01-10 +Created 1970-01-01
Ciro Santilli 35 Updated 2025-01-10 +Created 1970-01-01When you fail a HR interview, then you know you've reached rock bottom.
Investments:
- 2024: 75m GBP
- 2023-04: 15m GBP: www.uktech.news/deep-tech/riverlane-series-b-20230424 At 100 employeed on LinkedIn, this should keep them going for two more years.
- 2022 500k GBP: www.uktech.news/deep-tech/riverlane-rigetti-quantum-innovate-uk-20220628 by Innovate UK for joing project with Rigetti Computing to work on quantum error correction
The Operating System for Quantum Computing by Steve Brierley (2021)
Source. Founding CEO. He seems nice. You might as well just start watching at: youtu.be/ugzWnw1LTBE?t=1166 where more specific things start to come out.One of their learning sites: www.qutube.nl/
The educational/outreach branch of QuTech.
This is a term "invented" by Ciro Santilli to refer to quantum compilers that are able to convert non-specifically-quantum (functional, since there is no state in quantum software) programs into quantum circuit.
The term is made by adding "quantum" to the more "classical" concept of "high-level synthesis", which refers to software that converts an imperative program into register transfer level hardware, typicially for FPGA applications.
A quantum algorithm that is thought to be more likely to be useful in the NISQ era of quantum computing.
This theorem roughly states that states that for every quantum algorithm, once we reach a certain level of physical error rate small enough (where small enough is algorithm dependant), then we can perfectly error correct.
This algorithm provides the conceptual division between noisy intermediate-scale quantum era and post-NISQ.
Technique that uses multiple non-ideal qubits (physical qubits) to simulate/produce one perfect qubit (logical).
One is philosophically reminded of classical error correction codes, where we also have multiple input bits per actual information bit.
TODO understand in detail. This appears to be a fundamental technique since all physical systems we can manufacture are imperfect.
Part of the fundamental interest of this technique is due to the quantum threshold theorem.
For example, when PsiQuantum raised 215M in 2020, they announced that they intended to reach 1 million physical qubits, which would achieve between 100 and 300 logical qubits.
Video "Jeremy O'Brien: "Quantum Technologies" by GoogleTechTalks (2014)" youtu.be/7wCBkAQYBZA?t=2778 describes an error correction approach for a photonic quantum computer.
Bibliography:
Quantum Intermediate Representation by Ciro Santilli 35 Updated 2025-01-10 +Created 1970-01-01
Ciro Santilli 35 Updated 2025-01-10 +Created 1970-01-01Used e.g. by Oxford Quantum Circuits, www.linkedin.com/in/john-dumbell-627454121/ mentions:
Using LLVM to consume QIR and run optimization, scheduling and then outputting hardware-specific instructions.
Presumably the point of it is to allow simulation in classical computers?
Integer factorization algorithms better than Shor's algorithm by Ciro Santilli 35 Updated 2025-01-10 +Created 1970-01-01
Ciro Santilli 35 Updated 2025-01-10 +Created 1970-01-01- 2023 www.schneier.com/blog/archives/2023/01/breaking-rsa-with-a-quantum-computer.html comments on "Factoring integers with sublinear resources on a superconducting quantum processor” arxiv.org/pdf/2212.12372.pdf
A group of Chinese researchers have just published a paper claiming that they can—although they have not yet done so—break 2048-bit RSA. This is something to take seriously. It might not be correct, but it’s not obviously wrong.We have long known from Shor’s algorithm that factoring with a quantum computer is easy. But it takes a big quantum computer, on the orders of millions of qbits, to factor anything resembling the key sizes we use today. What the researchers have done is combine classical lattice reduction factoring techniques with a quantum approximate optimization algorithm. This means that they only need a quantum computer with 372 qbits, which is well within what’s possible today. (The IBM Osprey is a 433-qbit quantum computer, for example. Others are on their way as well.)
How many logical qubits are needed to run Shor's algorithm? by Ciro Santilli 35 Updated 2025-01-10 +Created 1970-01-01
Ciro Santilli 35 Updated 2025-01-10 +Created 1970-01-01Toy/test/tought experiment algorithm.
Quantum algorithm for linear systems of equations by Ciro Santilli 35 Updated 2025-01-10 +Created 1970-01-01
Ciro Santilli 35 Updated 2025-01-10 +Created 1970-01-01 Pinned article: ourbigbook/introduction-to-the-ourbigbook-project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
Figure 1. Screenshot of the "Derivative" topic page. View it live at: ourbigbook.com/go/topic/derivative - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.
Figure 3. Visual Studio Code extension installation.
Figure 4. Visual Studio Code extension tree navigation.
Figure 5. . You can also edit articles on the Web editor without installing anything locally. Video 3. Edit locally and publish demo. Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.Video 4. OurBigBook Visual Studio Code extension editing and navigation demo. Source. - Internal cross file references done right:
- Infinitely deep tables of contents:
Figure 6. Dynamic article tree with infinitely deep table of contents.Live URL: ourbigbook.com/cirosantilli/chordateDescendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact