Qiskit
Skip the Hype. These 5 Books Actually Teach You Quantum.
updated
Bell's 1964 paper: journals.aps.org/ppf/abstract/10.1103/PhysicsPhysiqueFizika.1.195
2022 Nobel Prize in Physics information: nobelprize.org/uploads/2023/10/advanced-physicsprize2022-4.pdf
Bell's inequality Qiskit module: learning-api.quantum.ibm.com/assets/9567907c-74ab-4185-bdfa-2f67df4f3325
#qiskit #learnquantum #ibmquantum
An ansatz is an educated guess about the value or form of an unknown function and is used to help derive the real solution of an equation
In quantum computing ansatz is usually a parameterized circuit often used in variational algorithms such as VQE.
This ansatz is used as a starting point or trial state which is then iteratively updated as more information is calculated.
Picking a good ansatz is important when running quantum experiments as a well chosen ansatz can drastically improve the accuracy of your results.
Link to download the module: learning-api.quantum.ibm.com/assets/691e9439-cf33-4883-85f5-04eceb7dc525
#qiskit #ibmquantum #learnquantum
The system being described could be anything: a molecule, a single qubit, or a bouncy ball.
A hamiltonian can take different forms, it might incorporate different types of energy contributions, or be written in different coordinates or dimensions, which often makes them look very different.
In quantum mechanics, knowing the Hamiltonian of your system is very important, because it will allow you to solve the Schrodinger Equation; the heart of quantum mechanics.
The Schrodinger Equation calculates how the system will evolve or change in time, which tells us basically everything useful we would want to know.
That is why the first step of almost any problem or experiment boils down to calculating or identifying the Hamiltonian.
youtu.be/TZ-sUHK8vVQ
#qiskit #ibmquantum #learnquantum
Link to download the module: learning-api.quantum.ibm.com/assets/30776b0f-bbfd-4b89-bea6-1fb1a697d7a5
#qiskit #learnquantum #ibmquantum
Translation of original 1922 Stern and Gerlach paper: arxiv.org/abs/2301.11343
2016 review article on the Stern-Gerlach experiment: arxiv.org/abs/1609.09311
Link to module:
Stern Gerlach (student) learning-api.quantum.ibm.com/assets/d626ae4b-7336-4ec1-8756-89ec5983e63e
#qiskit #learnquantum #ibmquantum
#ibm #ibmquantum #qiskit
#ibm #ibmquantum #qiskit
#ibm #ibmquantum #qiskit
#ibm #ibmquantum #qiskit
#ibm #ibmquantum #qiskit
#ibm #ibmquantum #qiskit
#ibm #ibmquantum #qiskit
#ibm #ibmquantum #qiskit
#ibm #ibmquantum #qiskit
#ibm #ibmquantum #qiskit
0:00 – Introduction
2:27 – Overview
3:28 – The need for error correction
5:32 – Classical repetition codes
9:10 – Repetition code for qubits
14:02 – Phase-flip errors
15:13 – Correcting phase-flip errors
18:03 – 9-qubit Shor code
19:34 – Correcting bit-flip errors
21:31 – Errors and CNOTs
23:06 – Correcting phase-flip errors
26:05 – Correcting bit- and phase-flips
28:20 – Random errors
32:06 – Unitary errors
37:16 – Arbitrary errors
39:39 – Conclusion
Find the written content for this lesson on IBM Quantum Learning: learning.quantum.ibm.com/course/foundations-of-quantum-error-correction/correcting-quantum-errors
#qiskit #ibmquantum #learnquantum
In the first part, she teaches broad guidelines for selecting problems based on computational complexity theory and more practical considerations. Then, she walks us through three example use-cases based on recent work done in the community.
Associated chapter: learning.quantum.ibm.com/course/quantum-computing-in-practice/what-problems-are-quantum-computers-good-for
Papers discussed:
Quantum Simulations of Hadron Dynamics in the Schwinger Model using 112 Qubits:
arXiv: 2401.08044
Bias-field digitized counterdiabatic quantum optimization:
arXiv:2405.13898
mRNA secondary structure prediction using utility-scale quantum computers:
arXiv:2405.20328v1
The foundation and focus will be on Qiskit 1.x, an open source and freely available software development kit that allows you to program useful quantum computational workflows, all the way from building quantum circuits and designing quantum algorithms, to submitting them to real quantum computers and orchestrating large-scale, complex work loads. With 1.0, we expect Qiskit to become much more stable, efficient and serve as the developer-ready software backbone for quantum computational workflow.
linkedin.com/pulse/intern-ibm-quantum-2025-ibm-quantum-wycme
#quantumcomputing #quantum
There's no expectation you already know anything about quantum computing or quantum information, or have a background in quantum mechanics or physics. But you will want to be comfortable with linear algebra, complex numbers, and basic mathematical concepts.
Understanding Quantum Information and Computation is meant for anyone who wants to learn about quantum computing from a computer scientists perspective, and will begin by covering the basics of quantum information in Unit 1.
In unit 2, we will dive into Quantum Algorithms, Unit 3 we'll dive deeper into the mathematics of quantum information, and Unit 4 will explore how to understand and mitigate noise.
My name is John Watrous, and I hope you'll join me for Lesson 1 of Understanding Quantum Information and Computation.
In this interview, Olivia speaks to IBM Quantum product managers Sanket Panda and Tushar Mittal, to better understand what the Qiskit functions are, how users of different types can integrate them, and how to get started with them right now.
ibm.com/quantum/blog/qiskit-functions-catalog
docs.quantum.ibm.com/guides/functions
#ibm #quantum #qiskit
Qiskit Quantum Seminar with Sophia Economou
Abstract:
Variational quantum algorithms (VQAs) constitute a class of hybrid quantum-classical simulation algorithms that are envisioned for quantum simulation and optimization, possibly in the near term. For VQAs to be useful, it is important to reduce the size of the ansatz and the number of required measurements. I will present our work addressing these challenges with ADAPT-VQE, an adaptive, problem tailored approach to ansatz construction. I will also discuss a pulse-based alternative for variational algorithms.
Bio:
Sophia E. Economou is an American physicist who is a professor and the T. Marshall Hahn Chair in Physics at Virginia Tech. She directs the Virginia Tech Center for Quantum Information Science and Engineering.
Episode 176
Abstract:
Trapped atomic ions can host highly coherent, readily-controllable qubits and qudits in their internal degrees of freedom; these are widely used for quantum computing, sensing, and networking applications. However, trapped ions also possess quantized motional degrees of freedom. These single-ion or few-ion nanomechanical quantum harmonic oscillators can be cooled very near their ground states and manipulated by externally applied fields or by coupling to the ions’ internal states. Trapped ion motional modes are most commonly used in an auxiliary role to couple the internal states of multiple ions, but there is increasing interest in exploring them as stand-alone, coherent quantum harmonic oscillators.
I will describe recent work in our group on several projects that use trapped ion motion as a quantum nanomechanical oscillator. We have created highly squeezed states of trapped ion motion, enabling us to perform quantum-enhanced sensing and to speed up quantum dynamics involving the motion. We have also demonstrated various forms of coherent coupling, state exchange, and entanglement between multiple motional modes. This coupling can enable repeated non-destructive measurement of motional states by avoiding the motional state decoherence associated with photon recoil during fluorescence readout. Finally, we are using the motion of a single trapped ion as a quantum sensor to understand and mitigate sources of electric field noise from material surfaces, using a special trap that enables the study of interchangeable samples.
Bio:
Daniel Slichter is a physicist in the Ion Storage Group at NIST in Boulder, Colorado. His research focuses on quantum information experiments with trapped atomic ions, with an emphasis on developing new paradigms for scalable trapped ion quantum computing and creating long-distance quantum networks with trapped ion memory and computation nodes. He received his A.B. in physics (2004) from Harvard University, and his M.A. (2007) and Ph.D. (2011) in physics from the University of California, Berkeley. His Ph.D. research was in the field of superconducting quantum information, where he demonstrated the first continuous high-fidelity measurement of a superconducting qubit, and studied quantum feedback, measurement backaction, and near-quantum-limited parametric amplification.
0:00 — Introduction
1:29 — Overview
2:23 — Purifications
4:02 — Existence of purifications
7:33 — Schmidt decompositions
12:54 — Unitary equivalence of purifications
16:21 — Example: superdense coding
18:04 — Cryptographic implications
20:47 — HJW theorem
25:48 — Definition of fidelity
31:32 — Properties of fidelity
35:24 — Gentle measurement lemma
39:18 — Uhlmann’s theorem
43:45 — Conclusion
Find the written content for this lesson on IBM Quantum Learning: learning.quantum.ibm.com/course/general-formulation-of-quantum-information/purifications-and-fidelity
#ibmquantum #qiskit #learnquantum
In this work, drawing inspiration from the type of noise present in real hardware, we study the output distribution of random quantum circuits under practical non–unital noise sources with constant noise rates. We show that even in the presence of unital sources like the depolarizing channel, the distribution, under the combined noisechannel, never resembles a maximally entropic distribution at any depth.
To show this, we prove that the output distribution of such circuits never anticoncentrates — meaning it is never too ”flat” — regardless of the depth of the circuit. This is in stark contrast to the behavior of noiseless random quantum circuits or those with only unital noise, both of which anticoncentrate at sufficiently large depths.
As consequences, our results have interesting algorithmic implications on both the hardness and easiness of noisy random circuit sampling, since anticoncentration is a critical property exploited by both state-of-the-art classical hardness and easiness results.
Based on: journals.aps.org/prxquantum/abstract/10.1103/PRXQuantum.5.030317
I am a fourth year Ph.D. student in Computer Science at the University of Chicago, supervised by William Fefferman. Previously, from 2018 to 2020, I was a Master’s student at the University of Waterloo, under the supervision of John Watrous. I was also a part of the Institute for Quantum Computing (IQC). In another life, I was an undergraduate at Jadavpur University, India in the Department of Electronics and Telecommunication Engineering, from 2014 to 2018.
Follow along with the tutorial here: learning.quantum.ibm.com/tutorial/quantum-approximate-optimization-algorithm
#ibmquantum #learnquantum #qiskit
If you are interested in Qiskit, quantum programming, or benchmarking, this is the conversation you've been waiting for
These links might be helpful:
Install Qiskit: docs.quantum.ibm.com/guides/install-qiskit
Software Latest Updates: docs.quantum.ibm.com/guides/latest-updates
Episode 174
Abstract: Finding a scalable and universal framework for quantum simulation of strongly correlated fermions and bosons is important in fields ranging from material science to high-energy physics. While digital qubit-only quantum computers in principle offer such universality, the overhead encountered in mapping fermions and bosons to qubits renders this endeavour extremely challenging to implement in practice. In this talk, I will explain an approach to simulating bosonic matter, fermionic matter, and Abelian gauge fields in (2+1)D, which uses hybrid digital qubit-boson (or 'oscillator-qubit') and qubit-fermion operations, avoiding this overhead altogether.
I will show how our compilation strategies for hybrid oscillator-qubit computation can be used to study dynamics as well as ground states, and develop measurement techniques of non-local observables, and mention the influence of hardware errors in circuit QED coupled to high-Q cavities. I will also show that it is possible to implement fully fault-tolerant operations using logical fermions comprised of physical fermions as can be found in neutral atoms.
Illustrating the advantage of our hybrid qubit-oscillator approach over all-qubit hardware, the end-to-end comparison of the gate complexity for the Z2 gauge-invariant bosonic hopping term finds an improvement of the asymptotic scaling from $\mathcal{O}(\log(S)^2)$ to $\mathcal{O}(1)$ in our framework, as well as a constant factor improvement of better than $10^3$, and the $U(1)$ plaquette term benefits from an improvement from $\mathcal{O}(\log(S))$ to $\mathcal{O}(1)$. Illustrating the advantage of our hybrid qubit-fermion approach over all-qubit hardware, the fermionic fast Fourier transform, a widely-used subroutine in quantum algorithms for materials, finds an improvement from $\mathcal{O}(N\log(N))$ to $\mathcal{O}(\log(N))$ in circuit depth as well as from $\mathcal{O}(N^2)$ to $\mathcal{O}(N)$ in Clifford gate complexity. Our work establishes hybrid qubit-oscillator quantum simulation and qubit-fermion fault-tolerant quantum computation as viable and advantageous methods for the study of the quantum aspects of nature.
Bio: Eleanor Crane is a postdoctoral scholar at MIT investigating quantum algorithms using qubits as well as native particles which appear in nature: fermions and bosons. This provides advantages, especially when the goal of the computation is to simulate nature! Previously, she worked part-time for the companies Quantinuum and IBM, and had a joint position between QuICS, JQI and NIST. She did her PhD at University College London working both theoretically and experimentally on donors in silicon. Because she grew up in a superposition of England and France, she strives to bring people and cultures together, and always enjoys an adventure, whatever the nature.
Certifying that an n-qubit state synthesized in the lab is close to the target state is a fundamental task in quantum information science. However, existing rigorous protocols either require deep quantum circuits or exponentially many single-qubit measurements. In this work, we prove that almost all n-qubit target states, including those with exponential circuit complexity, can be certified from only O(n^2) single-qubit measurements. This result is established by a new technique that relates certification to the mixing time of a random walk. Our protocol has applications for benchmarking quantum systems, for optimizing quantum circuits to generate a desired target state, and for learning and verifying neural networks, tensor networks, and various other representations of quantum states using only single-qubit measurements. We show that such verified representations can be used to efficiently predict highly non-local properties that would otherwise require an exponential number of measurements. We demonstrate these applications in numerical experiments with up to 120 qubits, and observe advantage over existing methods such as cross-entropy benchmarking (XEB).
Hsin-Yuan Huang (Robert) is a Senior Research Scientist at Google Quantum AI and a Visiting Scientist at MIT. In 2025, he will join California Institute of Technology as an Assistant Professor of Theoretical Physics. He completed his Ph.D. under the mentorship of John Preskill and Thomas Vidick.
His research harnesses learning theory to unveil novel insights in physics, information science, and quantum computation. His seminal contributions include classical shadow tomography for learning large-scale quantum systems, provably efficient machine learning algorithms for solving quantum many-body problems, and quantum advantages in learning from experiments. His findings have been published in Nature, Science, Nature Physics, Nature Review Physics, Nature Communications, Physical Review Letters, PRX Quantum, as well as premier conferences in theoretical computer science, such as IEEE Symposium on Foundations of Computer Science (FOCS), and ACM Symposium on Theory of Computing (STOC). Over the past five years, he has been invited to give more than 120 research talks.
His doctoral dissertation, "Learning in the Quantum Universe," was honored with the Milton and Francis Clauser Doctoral Prize. This award, bestowed annually to a single doctoral dissertation across all disciplines at Caltech, recognizes work demonstrating the highest degree of originality and potential for opening new avenues of human thought and endeavor. He was also awarded the Ben P. C. Chou Doctoral Prize in Information Science and Technology, a Google Ph.D. fellowship, the Boeing Quantum Creator Prize, the MediaTek Research Young Scholarship, and the Kortschak Scholarship. Starting in 2025, Dr. Hsin-Yuan Huang will hold the position of William H. Hurt Scholar, an endowed early career professorship at California Institute of Technology.
In this episode, Dr. Olivia Lanes sits down with former intern turned full time IBM employee Ari Noori and current IBM intern Abigail McClain Gomez to talk about their experiences as well as how to get the most out of an internship.
They'll also talk about whether to pursue a Masters or PhD, the challenges of networking and how to do it, and Olivia briefly interviews a surprise special guest at the end!
#ibmquantum #qiskit #learnquantum
--
The Qiskit Global Summer School is a two-week intensive summer program designed to empower the quantum researchers and developers of tomorrow with the know-how to explore the world of quantum computing, as well as refresh and sharpen the industry professional’s skills. This fifth-annual summer school will prepare participants for the imminent era of quantum utility. Using hands on examples, the syllabi will guide students through areas of near-term practical importance.
Labs and solutions can be found here github.com/qiskit-community/qgss-2024/tree/main
Episode 172
Abstract: Extracting information efficiently from quantum systems is a major component of quantum information processing tasks. Randomized measurements, or classical shadows, enable predicting many properties of arbitrary quantum states using few measurements. While random single qubit measurements are experimentally friendly and suitable for learning low-weight Pauli observables, they perform poorly for nonlocal observables. Prepending a shallow random quantum circuit before measurements maintains this experimental friendliness, but also has favorable sample complexities for observables beyond low-weight Paulis, including high-weight Paulis and global low-rank properties such as fidelity. However, in realistic scenarios, quantum noise accumulated with each additional layer of the shallow circuit biases the results. To address these challenges, we propose the robust shallow shadows protocol. Our protocol uses Bayesian inference to learn the experimentally relevant noise model and mitigate it in postprocessing. and we prove the chosen noise model can mitigate a wide range of quantum noise, including coherent and incoherent errors. The mitigation introduces a bias-variance trade-off: correcting for noise-induced bias comes at the cost of a larger estimator variance. Despite this increased variance, as we demonstrate on a superconducting quantum processor, our protocol correctly recovers state properties such as expectation values, fidelity, and entanglement entropy, while maintaining a lower sample complexity compared to the random single qubit measurement scheme. This combined theoretical and experimental analysis positions the robust shallow shadow protocol as a scalable, robust, and sample-efficient protocol for characterizing quantum states on current quantum computing platforms. Last but not the lease, I will talk about potential applications of robust shallow shadow on learning low energy spectrum of many-body Hamiltonians.
Reference:
[1]. Hong-Ye Hu, Andi Gu, Swarnadeep Majumder, Hang Ren, Yipei Zhang, Derek S. Wang, Yi-Zhuang You, Zlatko Minev, Susanne F. Yelin, Alireza Seif. Demonstration of Robust and Efficient Quantum Property Learning with Shallow Shadows. arXiv: 2402.17911
[2]. Yizhi Shen, Alex Buzali, Hong-Ye Hu, Katherine Klymko, Daan Camps, Susanne F. Yelin, Roel Van Beeumen. Efficient Measurement-Driven Eigenenergy Estimation with Classical Shadows. (In preparation)
Bio: Hong-Ye Hu is currently a Harvard Quantum Initiative Fellow with a focus on the intersection of quantum information science and machine learning. His research interest spans several areas, including the machine learning of quantum systems, quantum simulation, quantum optimal controls, and quantum error mitigation and correction. Hong-Ye earned his PhD from the University of California, San Diego, in 2022. Before that, he completed his Bachelor of Science degree at Peking University in 2016. In addition to his academic pursuits, Hong-Ye has actively collaborated with leading industry players such as IBM Quantum, QuEra Computing, NASA Quantum AI Lab, and Nvidia, contributing his expertise to push the boundaries of quantum computing technology.
--
The Qiskit Global Summer School is a two-week intensive summer program designed to empower the quantum researchers and developers of tomorrow with the know-how to explore the world of quantum computing, as well as refresh and sharpen the industry professional’s skills. This fifth-annual summer school will prepare participants for the imminent era of quantum utility. Using hands on examples, the syllabi will guide students through areas of near-term practical importance.
Labs and solutions can be found here github.com/qiskit-community/qgss-2024/tree/main
--
The Qiskit Global Summer School is a two-week intensive summer program designed to empower the quantum researchers and developers of tomorrow with the know-how to explore the world of quantum computing, as well as refresh and sharpen the industry professional’s skills. This fifth-annual summer school will prepare participants for the imminent era of quantum utility. Using hands on examples, the syllabi will guide students through areas of near-term practical importance.
Labs and solutions can be found here github.com/qiskit-community/qgss-2024/tree/main
--
The Qiskit Global Summer School is a two-week intensive summer program designed to empower the quantum researchers and developers of tomorrow with the know-how to explore the world of quantum computing, as well as refresh and sharpen the industry professional’s skills. This fifth-annual summer school will prepare participants for the imminent era of quantum utility. Using hands on examples, the syllabi will guide students through areas of near-term practical importance.
Labs and solutions can be found here github.com/qiskit-community/qgss-2024/tree/main
--
The Qiskit Global Summer School is a two-week intensive summer program designed to empower the quantum researchers and developers of tomorrow with the know-how to explore the world of quantum computing, as well as refresh and sharpen the industry professional’s skills. This fifth-annual summer school will prepare participants for the imminent era of quantum utility. Using hands on examples, the syllabi will guide students through areas of near-term practical importance.
Labs and solutions can be found here github.com/qiskit-community/qgss-2024/tree/main
Episode 171
I will discuss a family of clean quantum circuits with constrained chiral dynamics, the so-called East circuits. For small enough coupling parameter of the model and incommensurate Trotter time-step, analytical-perturbative as well as tensor-network-based-numerical arguments suggest existence of dynamical localization, i.e. asymptotic exponential localization of time dependent initially localized excitation.
For sufficiently large coupling parameter, the dynamics appears ergodic and quantum chaotic with uniform asymptotic exponential relaxation of all local observables. The latter is captured by the concept of quantum Ruelle-Pollicott resonances formulated in terms of the leading nontrivial eigenvalue of an open quantum circuit with absorbing boundary condition (implemented in terms of a reset channel). The corresponding eigenvector exhibits a clean self-similar fractal structure with characteristic power law scaling.
Tomaž Prosen has been a full professor of theoretical physics at University of Ljubljana since 2008, where he leads a group on nonequilibrium quantum and statistical physics. He obtained his Ph.D. in 1995 at the same university. His main current research interest is in fundamental problems in dynamical systems, quantum many-body dynamics, quantum chaos, nonequilibrium statistical mechanics, and transport theory.
--
The Qiskit Global Summer School is a two-week intensive summer program designed to empower the quantum researchers and developers of tomorrow with the know-how to explore the world of quantum computing, as well as refresh and sharpen the industry professional’s skills. This fifth-annual summer school will prepare participants for the imminent era of quantum utility. Using hands on examples, the syllabi will guide students through areas of near-term practical importance.
Labs and solutions can be found here github.com/qiskit-community/qgss-2024/tree/main
--
The Qiskit Global Summer School is a two-week intensive summer program designed to empower the quantum researchers and developers of tomorrow with the know-how to explore the world of quantum computing, as well as refresh and sharpen the industry professional’s skills. This fifth-annual summer school will prepare participants for the imminent era of quantum utility. Using hands on examples, the syllabi will guide students through areas of near-term practical importance.
Labs and solutions can be found here github.com/qiskit-community/qgss-2024/tree/main
--
The Qiskit Global Summer School is a two-week intensive summer program designed to empower the quantum researchers and developers of tomorrow with the know-how to explore the world of quantum computing, as well as refresh and sharpen the industry professional’s skills. This fifth-annual summer school will prepare participants for the imminent era of quantum utility. Using hands on examples, the syllabi will guide students through areas of near-term practical importance.
Labs and solutions can be found here github.com/qiskit-community/qgss-2024/tree/main
--
The Qiskit Global Summer School is a two-week intensive summer program designed to empower the quantum researchers and developers of tomorrow with the know-how to explore the world of quantum computing, as well as refresh and sharpen the industry professional’s skills. This fifth-annual summer school will prepare participants for the imminent era of quantum utility. Using hands on examples, the syllabi will guide students through areas of near-term practical importance.
Labs and solutions can be found here github.com/qiskit-community/qgss-2024/tree/main
Episode 170
A universal quantum computer can be used as a simulator capable of predicting properties of diverse quantum systems. Electronic structure problems in chemistry offer practical use cases around the hundred-qubit mark. This appears promising since current quantum processors have reached these sizes. However, mapping these use cases onto quantum computers yields deep circuits, and for for pre-fault-tolerant quantum processors, the large number of measurements to estimate molecular energies leads to prohibitive runtimes. As a result, realistic chemistry is out of reach of current quantum computers in isolation. A natural question is whether classical distributed computation can relieve quantum processors from parsing all but a core, intrinsically quantum component of a chemistry workflow. In this seminar, I will discuss the incorporation of quantum computations of chemistry in a quantum-centric supercomputing architecture, using up to 6400 nodes of the supercomputer Fugaku to assist a Heron superconducting quantum processor. We simulate the N2 triple bond breaking in a correlation-consistent cc-pVDZ basis set, and the active-space electronic structure of [2Fe–2S] and [4Fe–4S] clusters, using 58, 45 and 77 qubits respectively, with quantum circuits of up to 10570 (3590 2-qubit) quantum gates.
Javier is a Research Scientist at IBM. His research focuses on the use of quantum computers and machine learning techniques to simulate quantum many-body systems, and in particular electronic-structure problems. He obtained his PhD in Physics from New York University in 2023, where he developed machine learning techniques to tackle the quantum many-body problem. Prior to that, he obtained his B.S. in Physics from the Universidad Autónoma de Madrid in 2017.
This landmark paper discusses low-density parity-check (LDPC) codes for error correction on quantum computers. Error correction is a notoriously difficult problem, and Sergey and Ted explain how this work makes scalability much easier and paves the way for real-world implementation.
Read more about error correcting codes for near-term quantum computers here: ibm.com/quantum/blog/error-correction-codes
Link to Nature paper: nature.com/articles/s41586-024-07107-7
Join the Discussion:
Share your thoughts and questions about this groundbreaking research in the comments section below. Engage with the scientific community and explore the possibilities of quantum computing together!
Stay Updated:
If you're fascinated by the world of quantum computing and scientific exploration, don't forget to like, subscribe, and hit the notification bell to stay updated on our latest episodes and quantum discoveries.
Thank You for Watching!
#QuantumComputing #ResearchReview #Qiskit #IBMQuantum #Science #Innovation
This lesson describes measurements in full generality, including different ways that general measurements can be described in mathematical terms. It also describes quantum state discrimination and quantum state tomography, which are important notions connected with measurements.
Find the written content for this lesson on IBM Quantum Learning: learning.quantum.ibm.com/course/general-formulation-of-quantum-information/general-measurements
0:00 — Introduction
1:19 — Overview
2:35 — Descriptions of measurements
5:02 — Measurements as matrices
10:18 — Examples
13:59 — Measurements as channels
17:24 — Partial measurements
22:06 — Naimark's theorem
23:07 — Proof of Naimark's theorem
28:07 — Non-destructive measurements
31:08 — State discrimination & tomography
33:55 — Discriminating pairs of states
38:38 — Discriminating 3 or more states
40:50 — Quantum state tomography
42:13 — Qubit tomography
45:19 — Conclusion
Link to the full Understanding Quantum Information & Computation Series: youtube.com/playlist?list=PLOFEBzvs-VvqKKMXX4vbi4EB1uaErFMSO&si=EbuCeifokHs_RSJ5
#ibmquantum #qiskit #learnquantum


