About meet the meQuanics - Quantum Computing Discussions
meet the meQuanics is a regular podcast discussing the developments in quantum technologies. Targeted at the lay person, we will discuss the state of the art research in quantum enabled technologies with experts worldwide.
meQuanics - QSI@UTS Seminar Series - S25 - Adrian Chapman (University of Sydney)
During this time of lockdown, the centre for quantum software and information (QSI) at the University of Technology Sydney has launched an online seminar series. With talks once or twice a week from leading researchers in the field, meQuanics is supporting this series by mirroring the audio from each talk. I would encourage if you listen to this episode, to visit and subscribe to the UTS:QSI YouTube page to see each of these talks with the associated slides to help it make more sense.
https://youtu.be/4KIXVQtR9Qw
Free-Fermion Solutions and Frustration Graphs
TITLE: Characterization of free-fermion-solvable spin models via graph invariants
SPEAKER: Dr Adrian Chapman
AFFILIATION: ARC Centre of Excellence for Engineered Quantum Systems (EQUS), University of Sydney, Australia
HOSTED BY: A/Prof Chris Ferrie, UTS Centre for Quantum Software and Information
ABSTRACT: Finding exact solutions to spin models is a fundamental problem of many-body physics. A workhorse technique for exact solution methods is mapping to an effective description by noninteracting fermions. The paradigmatic example of this is the Jordan-Wigner transformation for finding an exact solution to the one-dimensional XY model. Another important example is the exact free-fermion solution to the two-dimensional Kitaev honeycomb model. I will describe a framework for recognizing general models which can be solved this way by utilizing the tools of graph theory. Our construction relies on a connection to the graph-theoretic problem of recognizing line graphs, which has been solved optimally. A corollary of this result is a complete set of constant-sized frustration structures which obstruct a free-fermion solution. We classify the kinds of Pauli symmetries which can be present in models for which a free-fermion solution exists, and we find that they correspond to either: (i) gauge qubits, (ii) cycles on the free-fermion hopping graph, or (iii) the fermion parity. Clifford symmetries, except in finitely-many cases, must be symmetries of the free-fermion Hamiltonian itself. We expect our characterization to motivate a renewed exploration of free-fermion-solvable models, and I will close with an elaborate discussion of how we expect to generalize our framework beyond generator-to-generator mappings.
RELATED ARTICLES: Characterization of solvable spin models via graph invariants. Quantum 4, 278 (2020). Characterization of solvable spin models via graph invariants: quantum-journal.org/papers/q-2020-06-04-278/
OTHER LINKS: Adrian Chapman Webpage: https://equs.org/users/adrian-chapman (https://www.youtube.com/redirect?event=video_description&redir_token=QUFFLUhqbG8ydnhTVVhjVUl2YnlKMEwtMTRYRGh4c3JIQXxBQ3Jtc0ttSmY4bk5xSmppU2hLVW5lcGJEeldyU2xBNkExZ0xmeWJhYVd1VDFxMmhuQ3NieGQwVlh3MU9fa2NDcTQ0aXBSYzlKTmRWTnRKd1V0SXpkM1A2TGU5eGFkWElZX3RvdXhHMG9XTUNXazIzeHR2el9hbw&q=https%3A%2F%2Fequs.org%2Fusers%2Fadrian-chapman)
2 Apr 2022
meQuanics - QSI@UTS Seminar Series - S24 - Ramis Movassagh (Watson AI Lab)
During this time of lockdown, the centre for quantum software and information (QSI) at the University of Technology Sydney has launched an online seminar series. With talks once or twice a week from leading researchers in the field, meQuanics is supporting this series by mirroring the audio from each talk. I would encourage if you listen to this episode, to visit and subscribe to the UTS:QSI YouTube page to see each of these talks with the associated slides to help it make more sense.
https://youtu.be/2syrO_asU5Y
Hardness of Random Circuit Sampling (Google's supremacy experiment)
TITLE: Cayley Path and Quantum Supremacy SPEAKER: Dr Ramis Movassagh
AFFILIATION: MIT-IBM Watson AI Lab, Cambridge MA, USA
HOSTED BY: Prof Michael Bremner, UTS Centre for Quantum Software and Information
ABSTRACT: Given the large push by academia and industry (e.g., IBM and Google), quantum computers with hundred(s) of qubits are at the brink of existence with the promise of outperforming any classical computer. Demonstration of computational advantages of noisy near-term quantum computers over classical computers is an imperative near-term goal. The foremost candidate task for showing this is Random Circuit Sampling (RCS), which is the task of sampling from the output distribution of a random circuit. This is exactly the task that recently Google experimentally performed on 53-qubits. Stockmeyer's theorem implies that efficient sampling allows for estimation of probability amplitudes. Therefore, hardness of probability estimation implies hardness of sampling. We prove that estimating probabilities to within small errors is #P-hard on average (i.e. for random circuits), and put the results in the context of previous works. Some ingredients that are developed to make this proof possible are construction of the Cayley path as a rational function valued unitary path that interpolate between two arbitrary unitaries, an extension of Berlekamp-Welch algorithm that efficiently and exactly interpolates rational functions, and construction of probability distributions over unitaries that are arbitrarily close to the Haar measure.
RELATED ARTICLES: Unitary-valued paths, and an algebraic proof technique in complexity theory: https://ramismovassagh.wordpress.com/... Cayley path and quantum computational supremacy: A proof of average-case #P−hardness of Random Circuit Sampling with quantified robustness: https://arxiv.org/abs/1909.06210 Efficient unitary paths and quantum computational supremacy: A proof of average-case hardness of Random Circuit Sampling: https://arxiv.org/abs/1810.04681
OTHER LINKS: Ramis Movassagh Personal Webpage: https://ramismovassagh.wordpress.com/
MIT-IBM Watson AI Lab: https://mitibmwatsonailab.mit.edu/
2 Apr 2022
meQuanics - QSI@UTS Seminar Series - S23 - Lieven Vandersypen (QuTech, U. Delft)
During this time of lockdown, the centre for quantum software and information (QSI) at the University of Technology Sydney has launched an online seminar series. With talks once or twice a week from leading researchers in the field, meQuanics is supporting this series by mirroring the audio from each talk. I would encourage if you listen to this episode, to visit and subscribe to the UTS:QSI YouTube page to see each of these talks with the associated slides to help it make more sense.
https://youtu.be/Dg6Q_F9uI8s
Silicon spin qubits gain traction for large-scale quantum computation and simulation.
TITLE: A Scalable “Spins-Inside” Quantum Processor and Simulator SPEAKER: Prof Lieven Vandersypen
AFFILIATION: QuTech, Kavli Institute of Nanoscience, Dept of Quantum Nanoscience, Delft University of Technology, Netherlands
HOSTED BY: Dr JP (Juan Pablo) Dehollain, UTS Centre for Quantum Software and Information
ABSTRACT: Excellent control of over physical 50 qubits has been achieved, but can we also realize 50 fault-tolerant qubits? Here quantum bits encoded in the spin state of individual electrons in silicon quantum dot arrays have emerged as a highly promising avenue. In this talk, I will present our vision of a large-scale spin-based quantum processor, and our ongoing work to realize this vision. I will also show how the same platform offers a powerful platform for analog quantum simulation of Fermi-Hubbard physics and quantum magnetism.
RELATED ARTICLES: Physics Today 72(8), 38 (2019) npj Quantum Information 3, 34 (2017) Nature 555, 633 (2018) Science 359, 1123 (2018) Phys. Rev. X 9, 021011 (2019) Nature 579, 528 (2020) Nature 580, 355 (2020)
OTHER LINKS: Vandersypen Lab: qutech.nl/vandersypen-lab/ Delft University of Technology: https://www.tudelft.nl/ (https://www.youtube.com/redirect?event=video_description&redir_token=QUFFLUhqa3dCRk83ZGgzWHMxSGdfR2E5Q2pIU3dDWGk0UXxBQ3Jtc0trcnNyTEZtT3YwNGYyVWdQVFAwdzNoXzFGcUQyeGN1cXVmcEtSam5BTGZXLURZaFZIdWZGbE1OMUxIcURHVU9jMVJ0NzZRTmRMUjBZUXFlNUVaRFVEOE9kN2NrSjdaZnlhM3hQQWZpRk5feEVpTHZCVQ&q=https%3A%2F%2Fwww.tudelft.nl%2F)
Reach and audience
Public platform figures. Ratings count people who left a rating, not total listeners.
Apple Podcasts (US)
4.9 / 5
11 ratings
Host of meet the meQuanics - Quantum Computing Discussions?
Claim your podcast to manage its listing and keep your show details accurate.
Pod Engine is an independent podcast discovery and analytics service and is not affiliated with or endorsed by this podcast. Artwork and show content belong to their owners. Full legal notice.
Explore this show Podcast research with Pod Engine
