BEGIN:VCALENDAR VERSION:2.0 PRODID:researchseminars.org CALSCALE:GREGORIAN X-WR-CALNAME:researchseminars.org BEGIN:VEVENT SUMMARY:Nana Liu (Shanghai Jiao Tong University\, China) DTSTART:20200522T000000Z DTEND:20200522T010000Z DTSTAMP:20260422T212930Z UID:UTSQSI/1 DESCRIPTION:Title: I ntroducing Adversarial Quantum Learning: Security and machine learning on the quantum internet\nby Nana Liu (Shanghai Jiao Tong University\, Chi na) as part of Centre for Quantum Software and Information Seminar Series\ n\nAbstract: TBA\n LOCATION:https://researchseminars.org/talk/UTSQSI/1/ END:VEVENT BEGIN:VEVENT SUMMARY:Nathan Wiebe (Pacific Northwest National Labs\, University of Wash ington) DTSTART:20200529T000000Z DTEND:20200529T010000Z DTSTAMP:20260422T212930Z UID:UTSQSI/2 DESCRIPTION:Title: T raining fully quantum Boltzmann machines\nby Nathan Wiebe (Pacific Nor thwest National Labs\, University of Washington) as part of Centre for Qua ntum Software and Information Seminar Series\n\n\nAbstract\nIn recent year s quantum machine learning has grown by leaps and bounds but a major probl em still vexes the field is how to efficiently train quantum neural networ ks. This is particularly challenging because of the lack of a natural bac kpropagation algorithm for updating the quantum model. \nIn this talk\, I will focus on an approach that can mitigate this problem through generativ e training. We will show how to construct a fully quantum model of a Bolt zmann machine and train all of the parameters of that model for both the q uantum and classical parameters in the model. In contrast\, existing meth ods were not able to achieve this. \nIn particular\, we will show explicit query upper bounds for the cost of simulation\, provide a formal proof fo r BQP-completeness for evaluating such neural networks and also discuss re maining problems in the field and how to generalize the ideas presented he re to go beyond Boltzmann machines to allow efficient training of broad cl asses of quantum neural networks.\n LOCATION:https://researchseminars.org/talk/UTSQSI/2/ END:VEVENT BEGIN:VEVENT SUMMARY:Kai-Min Chung (Institute of Information Science\, Acedemia Sinica\ , Taiwan) DTSTART:20200602T010000Z DTEND:20200602T020000Z DTSTAMP:20260422T212930Z UID:UTSQSI/3 DESCRIPTION:Title: H ow well can a classical client delegate quantum computation?\nby Kai-M in Chung (Institute of Information Science\, Acedemia Sinica\, Taiwan) as part of Centre for Quantum Software and Information Seminar Series\n\n\nAb stract\nIn a recent breakthrough\, Mahadev (FOCS 2018) constructed the fir st classical verification of quantum computation (CVQC) protocol that allo ws a classical client to delegate the computation of a BQP language (i.e.\ , a decision problem) to an efficient quantum server.\n\nIn this talk\, we present several generalizations of Mahadev’s work. In particular\, we i nitiate the study of CVQC protocols for quantum *sampling* problems and co nstruct the first such protocol that allows a classical client to verifiab ly obtain a sample drawn from a quantum computation from a quantum server. We also construct the first protocol with efficient verification\, i.e.\, the client’s runtime can be sublinear in the quantum time complexity of the delegated computation. Finally\, we present a generic compiler that c ompiles any CVQC protocol to achieve blindness\, i.e.\, the server learns nothing about the client’s input\, which leads to the first constant-rou nd blind CVQC protocol.\n\nBased on joint works with Nai-Hui Chia\, Takash i Yamakawa\, Yi Lee\, Han-Husan Lin\, and Xiaodi Wu\n\nHosted by Prof Zhen gfeng Ji\, UTS Centre for Quantum Software and Information.\n LOCATION:https://researchseminars.org/talk/UTSQSI/3/ END:VEVENT BEGIN:VEVENT SUMMARY:Maria Schuld (Xanadu\, Toronto\, Canada) DTSTART:20200605T040000Z DTEND:20200605T050000Z DTSTAMP:20260422T212930Z UID:UTSQSI/4 DESCRIPTION:Title: E ncoding Classical Data into Quantum States for Machine Learning\nby Ma ria Schuld (Xanadu\, Toronto\, Canada) as part of Centre for Quantum Softw are and Information Seminar Series\n\n\nAbstract\nWhen quantum computers a re used to process classical data - a setting investigated in the emerging field of quantum machine learning - the first step is to encode data into quantum states. In fact\, this is the most important step: the way we enc ode classical data determines almost entirely the potential power of a qua ntum machine learning algorithm.\nThis talk sheds light on different aspec ts of this data encoding\, from claims of exponential speedups to quantum feature maps and quantum kernel methods.\nIn particular\, it will present the framework of quantum embeddings in which a data encoding can be adapti vely learnt from data\, while the circuit for optimal classification follo ws from well-known results in quantum information theory.\n\nHosted by A/P rof Chris Ferrie\, UTS Centre for Quantum Software and Information.\n LOCATION:https://researchseminars.org/talk/UTSQSI/4/ END:VEVENT BEGIN:VEVENT SUMMARY:Robin Blume-Kohout (Sandia National Laboratories\, Albuquerque\, N ew Mexico) DTSTART:20200612T000000Z DTEND:20200612T003000Z DTSTAMP:20260422T212930Z UID:UTSQSI/5 DESCRIPTION:Title: U nderstanding crosstalk in quantum processors\nby Robin Blume-Kohout (S andia National Laboratories\, Albuquerque\, New Mexico) as part of Centre for Quantum Software and Information Seminar Series\n\n\nAbstract\nModel-b ased quantum tomography protocols like gate set tomography optimize a nois e model with some number of parameters in order to fit experimental data. As the number of qubits increases\, two issues emerge: 1) the number of m odel parameters grows\, and 2) the cost of propagating quantum states (den sity matrices) increases exponentially. The first issue can be addressed by considering reduced models that limit errors to being low-weight and g eometrically local. \n\nIn this talk\, we focus on the second issue and pr esent a method for performing approximate density matrix propagation based on perturbative expansions of error generators. The method is tailored t o the likelihood optimization problem faced by model-based tomography prot ocols. We will discuss the advantages and drawbacks of using this method when characterizing the errors in up to 8-qubit systems.\n\nHosted by A/Pr of Chris Ferrie\, UTS Centre for Quantum Software and Information. \n\nPl ease note\, Erik Nielsen's seminar will follow directly after Robin Blume- Kohout's seminar.\n LOCATION:https://researchseminars.org/talk/UTSQSI/5/ END:VEVENT BEGIN:VEVENT SUMMARY:Lieven Vandersypen (QuTech\, Delft University of Technology\, Neth erlands) DTSTART:20200625T060000Z DTEND:20200625T070000Z DTSTAMP:20260422T212930Z UID:UTSQSI/6 DESCRIPTION:Title: S ilicon spin qubits gain traction for large-scale quantum computation and s imulation.\nby Lieven Vandersypen (QuTech\, Delft University of Techno logy\, Netherlands) as part of Centre for Quantum Software and Information Seminar Series\n\n\nAbstract\nExcellent control of over physical 50 qubit s has been achieved\, but can we also realize 50 fault-tolerant qubits? He re quantum bits encoded in the spin state of individual electrons in silic on quantum dot arrays have emerged as a highly promising avenue. In this t alk\, I will present our vision of a large-scale spin-based quantum proces sor\, and our ongoing work to realize this vision. I will also show how th e same platform offers a powerful platform for analog quantum simulation o f Fermi-Hubbard physics and quantum magnetism.\n LOCATION:https://researchseminars.org/talk/UTSQSI/6/ END:VEVENT BEGIN:VEVENT SUMMARY:Erik Nielsen (Sandia National Laboratories\, Albuquerque\, New Mex ico) DTSTART:20200612T003000Z DTEND:20200612T010000Z DTSTAMP:20260422T212930Z UID:UTSQSI/7 DESCRIPTION:Title: H old the onion: using fewer circuits to characterize your quoits\nby Er ik Nielsen (Sandia National Laboratories\, Albuquerque\, New Mexico) as pa rt of Centre for Quantum Software and Information Seminar Series\n\n\nAbst ract\nModel-based quantum tomography protocols like gate set tomography op timize a noise model with some number of parameters in order to fit experi mental data. As the number of qubits increases\, two issues emerge: 1) th e number of model parameters grows\, and 2) the cost of propagating quantu m states (density matrices) increases exponentially. The first issue can be addressed by considering reduced models that limit errors to being low -weight and geometrically local. \n\nIn this talk\, we focus on the second issue and present a method for performing approximate density matrix prop agation based on perturbative expansions of error generators. The method is tailored to the likelihood optimization problem faced by model-based to mography protocols. We will discuss the advantages and drawbacks of using this method when characterizing the errors in up to 8-qubit systems.\n\nH osted by A/Prof Chris Ferrie\, UTS Centre for Quantum Software and Informa tion. \n\nPlease note\, the starting time is only an estimate as Erik Nie lsen's seminar will follow directly after the ~30min seminar of Robin Blum e-Kohout.\n LOCATION:https://researchseminars.org/talk/UTSQSI/7/ END:VEVENT BEGIN:VEVENT SUMMARY:Marissa Giustina (Google AI Quantum\, Google Research) DTSTART:20200609T010000Z DTEND:20200609T020000Z DTSTAMP:20260422T212930Z UID:UTSQSI/8 DESCRIPTION:Title: B uilding Google’s quantum computer\nby Marissa Giustina (Google AI Qu antum\, Google Research) as part of Centre for Quantum Software and Inform ation Seminar Series\n\n\nAbstract\nThe Google AI Quantum team develops ch ip-based circuitry that one can interact with (control and read out) and w hich behaves reliably according to a simple quantum model. Such quantum ha rdware holds promise as a platform for tackling problems intractable to cl assical computing hardware. While the demonstration of a universal\, fault -tolerant\, quantum computer remains a goal for the future\, it has inform ed the design of a prototype with which we have recently controlled a quan tum system of unprecedented scale. \n\nThis talk introduces Google’s qua ntum computing effort from both hardware and quantum-information perspecti ves\, including an overview of recent technological developments and some recent results.\n\nHosted by: A/Prof Nathan Langford\, UTS Centre for Quan tum Software and Information\n LOCATION:https://researchseminars.org/talk/UTSQSI/8/ END:VEVENT BEGIN:VEVENT SUMMARY:Daniel Grier (University of Waterloo\, Canada) DTSTART:20200616T010000Z DTEND:20200616T020000Z DTSTAMP:20260422T212930Z UID:UTSQSI/9 DESCRIPTION:Title: I nteractive Shallow Clifford Circuits: Quantum advantage against NC1 and be yond\nby Daniel Grier (University of Waterloo\, Canada) as part of Cen tre for Quantum Software and Information Seminar Series\n\n\nAbstract\nRec ent work of Bravyi et al. and follow-up work by Bene Watts et al. demonstr ates a quantum advantage with shallow circuits: constant-depth quantum cir cuits can perform a task which constant-depth classical (i.e.\, AC^0) circ uits cannot. Their results have the advantage that the quantum circuit is fairly practical\, and their proofs are free of hardness assumptions. In this talk\, I'll present a follow-up result\, which attempts to hold on to these advantages\, while increasing the power of the classical simulator. \n\nThe main result is a two-round interactive task which is solved by a c onstant-depth quantum circuit (using only Clifford gates\, between neighbo ring qubits of a 2D grid\, with Pauli measurements)\, but such that any cl assical machine/circuit for the task would need to solve parity-L-hard pro blems. I'll focus on proving a slightly weaker result (NC^1-hardness)\, b ut the techniques generalize to parity-L.\n\nJoint work with Luke Schaeffe r.\n\nHosted by Michael Bremner\, UTS Centre for Quantum Software and Info rmation\n LOCATION:https://researchseminars.org/talk/UTSQSI/9/ END:VEVENT BEGIN:VEVENT SUMMARY:Guillaume Verdon (X (formerly Google X)\, CA\, USA) DTSTART:20200619T000000Z DTEND:20200619T010000Z DTSTAMP:20260422T212930Z UID:UTSQSI/10 DESCRIPTION:Title: Quantum-probabilistic Generative Models and Variational Quantum Thermaliza tion\nby Guillaume Verdon (X (formerly Google X)\, CA\, USA) as part o f Centre for Quantum Software and Information Seminar Series\n\n\nAbstract \nWe introduce a new class of generative quantum-neural-network-based mode ls called Quantum Hamiltonian-Based Models (QHBMs). In doing so\, we estab lish a paradigmatic approach for quantum-probabilistic hybrid variational learning of quantum mixed states\, where we efficiently decompose the task s of learning classical and quantum correlations in a way which maximizes the utility of both classical and quantum processors. In addition\, we int roduce the Variational Quantum Thermalizer (VQT) algorithm for generating the thermal state of a given Hamiltonian and target temperature\, a task f or which QHBMs are naturally well-suited. The VQT can be seen as a general ization of the Variational Quantum Eigensolver (VQE) to thermal states: we show that the VQT converges to the VQE in the zero temperature limit. We provide numerical results demonstrating the efficacy of these techniques i n several illustrative examples. In addition to the introduction to the th eory and applications behind these models\, we will briefly walk through t heir numerical implementation in TensorFlow Quantum.\n\nHosted by Chris Fe rrie\, UTS Centre for Quantum Software and Information\n LOCATION:https://researchseminars.org/talk/UTSQSI/10/ END:VEVENT BEGIN:VEVENT SUMMARY:Lana Mineh (QET Labs\, University of Bristol) DTSTART:20200623T070000Z DTEND:20200623T080000Z DTSTAMP:20260422T212930Z UID:UTSQSI/11 DESCRIPTION:Title: Strategies for solving the Fermi-Hubbard model on near-term quantum comput ers\nby Lana Mineh (QET Labs\, University of Bristol) as part of Centr e for Quantum Software and Information Seminar Series\n\n\nAbstract\nThe F ermi-Hubbard model is of fundamental importance in condensed-matter physic s\, yet is extremely challenging to solve numerically. Finding the ground state of the Hubbard model using variational methods has been predicted to be one of the first applications of near-term quantum computers. Here we carry out a detailed analysis and optimisation of the complexity of variat ional quantum algorithms for finding the ground state of the Hubbard model \, including costs associated with mapping to a real-world hardware platfo rm. The depth complexities we find are substantially lower than previous w ork. We performed extensive numerical experiments for systems with up to 1 2 sites. The results suggest that the variational ansätze we used -- an e fficient variant of the Hamiltonian Variational ansatz and a novel general isation thereof -- will be able to find the ground state of the Hubbard mo del with high fidelity in relatively low quantum circuit depth. Our experi ments include the effect of realistic measurements and depolarising noise. If our numerical results on small lattice sizes are representative of the somewhat larger lattices accessible to near-term quantum hardware\, they suggest that optimising over quantum circuits with a gate depth less than a thousand could be sufficient to solve instances of the Hubbard model bey ond the capacity of classical exact diagonalisation.\n\nHosted by Michael Bremner\, UTS Centre for Quantum Software and Information. Email cqsiadmi n@uts.edu.au to request interactive zoom link.\n LOCATION:https://researchseminars.org/talk/UTSQSI/11/ END:VEVENT BEGIN:VEVENT SUMMARY:Ramis Movassagh (MIT-IBM Watson AI Lab) DTSTART:20200702T233000Z DTEND:20200703T003000Z DTSTAMP:20260422T212930Z UID:UTSQSI/12 DESCRIPTION:Title: Cayley Path and Quantum Supremacy\nby Ramis Movassagh (MIT-IBM Watson AI Lab) as part of Centre for Quantum Software and Information Seminar Ser ies\n\n\nAbstract\nGiven the large push by academia and industry (e.g.\, I BM and Google)\, quantum computers with hundred(s) of qubits are at the br ink of existence with the promise of outperforming any classical computer. Demonstration of computational advantages of noisy near-term quantum comp uters over classical computers is an imperative near-term goal. The foremo st candidate task for showing this is Random Circuit Sampling (RCS)\, whic h is the task of sampling from the output distribution of a random circuit . This is exactly the task that recently Google experimentally performed o n 53-qubits.\n\nStockmeyer's theorem implies that efficient sampling allow s for estimation of probability amplitudes. Therefore\, hardness of probab ility estimation implies hardness of sampling. We prove that estimating pr obabilities to within small errors is #P-hard on average (i.e. for random circuits)\, and put the results in the context of previous works.\n\nSome ingredients that are developed to make this proof possible are constructio n of the Cayley path as a rational function valued unitary path that inter polate between two arbitrary unitaries\, an extension of Berlekamp-Welch a lgorithm that efficiently and exactly interpolates rational functions\, an d construction of probability distributions over unitaries that are arbitr arily close to the Haar measure.\n LOCATION:https://researchseminars.org/talk/UTSQSI/12/ END:VEVENT BEGIN:VEVENT SUMMARY:Rodney Van Meter (Keio University) DTSTART:20200630T020000Z DTEND:20200630T030000Z DTSTAMP:20260422T212930Z UID:UTSQSI/13 DESCRIPTION:Title: Engineering the Quantum Internet\nby Rodney Van Meter (Keio University ) as part of Centre for Quantum Software and Information Seminar Series\n\ n\nAbstract\nExperimental progress toward a general-purpose Quantum Intern et is advancing rapidly\, but the challenges in building a Quantum Interne t extend far beyond having a physical layer that can create entanglement a cross a distance. Quantum Internet nodes must share management of distrib uted tomography\, errors\, entanglement swapping\, multiplexing of resourc es\, selection of routes\, and more to support application-requested actio ns for distributed cryptographic functions\, quantum sensor networks\, and distributed quantum computation. I will introduce our RuleSet-based Quant um Internet architecture and the simulation tools that are enabling us to develop working protocols\, and discuss the need for multi-disciplinary or ganizations to address the broad range of problems.\n\nRodney Van Meter re ceived a B.S. in engineering and applied science from the California Insti tute of Technology in 1986\, an M.S. in computer engineering from the Univ ersity of Southern California in 1991\, and a Ph.D. in computer science fr om Keio University in 2006. His current research centers on quantum comput er architecture and quantum networking. Other research interests include storage systems\, networking\, and post-Moore's Law computer architecture. He is now a Professor of Environment and Information Studies at Keio Uni versity's Shonan Fujisawa Campus. He is the Vice Center Chair of Keio's Q uantum Computing Center. Dr. Van Meter is a member of AAAS\, ACM and IEEE .\n\nHosted by Simon Devitt\, UTS Centre for Quantum Software and Informat ion\n LOCATION:https://researchseminars.org/talk/UTSQSI/13/ END:VEVENT BEGIN:VEVENT SUMMARY:Adrian Chapman (University of Sydney) DTSTART:20200707T010000Z DTEND:20200707T020000Z DTSTAMP:20260422T212930Z UID:UTSQSI/14 DESCRIPTION:Title: Characterization of free-fermion-solvable spin models via graph invariants \nby Adrian Chapman (University of Sydney) as part of Centre for Quant um Software and Information Seminar Series\n\n\nAbstract\nFinding exact so lutions to spin models is a fundamental problem of many-body physics. A wo rkhorse technique for exact solution methods is mapping to an effective de scription 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. \n\nI will describ e a framework for recognizing general models which can be solved this way by utilizing the tools of graph theory. Our construction relies on a conne ction to the graph-theoretic problem of recognizing line graphs\, which ha s been solved optimally. A corollary of this result is a complete set of c onstant-sized frustration structures which obstruct a free-fermion solutio n. We classify the kinds of Pauli symmetries which can be present in model s for which a free-fermion solution exists\, and we find that they corresp ond to either: (i) gauge qubits\, (ii) cycles on the free-fermion hopping graph\, or (iii) the fermion parity. Clifford symmetries\, except in finit ely-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 o f how we expect to generalize our framework beyond generator-to-generator mappings.\n LOCATION:https://researchseminars.org/talk/UTSQSI/14/ END:VEVENT BEGIN:VEVENT SUMMARY:Sahand Mahmoodian (Max Planck Institute for Gravitational Physics\ , Leibniz University\, Hannover) DTSTART:20200903T060000Z DTEND:20200903T070000Z DTSTAMP:20260422T212930Z UID:UTSQSI/15 DESCRIPTION:Title: Quantum many-body physics of photons in waveguide QED\nby Sahand Mahmo odian (Max Planck Institute for Gravitational Physics\, Leibniz University \, Hannover) as part of Centre for Quantum Software and Information Semina r Series\n\n\nAbstract\nThe generation and control of strongly interacting photons is a long-standing goal of quantum optics. In recent years\, rema rkable experiments with cavity QED platforms\, strongly interacting Rydber g atoms\, and circuit QED have demonstrated photon-photon interactions at the few-body level. In this talk I show that a conceptually simple platfor m of two-level atoms ideally coupled to a chiral photonic mode forms an ex citing system for exploring the many-body physics of photons. Here\, a cla ss of bound photon eigenstates hold the key to understanding the dynamics of this system at the few- and many-body scale. I will show that one can u se these states to describe the entire spectrum from few-photon quantum pr opagation\, to genuine quantum many-body (atom and photon) phenomena\, and ultimately the quantum-to-classical transition.\n LOCATION:https://researchseminars.org/talk/UTSQSI/15/ END:VEVENT BEGIN:VEVENT SUMMARY:Sarah Kaiser (Independent Researcher and Consultant) DTSTART:20200908T000000Z DTEND:20200908T010000Z DTSTAMP:20260422T212930Z UID:UTSQSI/16 DESCRIPTION:Title: Introduction to Q#: A quantum development language for everyone\nby Sa rah Kaiser (Independent Researcher and Consultant) as part of Centre for Q uantum Software and Information Seminar Series\n\n\nAbstract\nAs the field of quantum computing expands from the academic to the industry realm\, we need a way that we can continue to collaborate and innovate in both regim es. Open source quantum software development platforms like the Quantum De velopment Kit and Q# from Microsoft\, serve as a bridge to connect researc h ideas to reality.\nIn this talk\, I will give you a tour of what you can do with Q# and show you an example of how I am using it in my own researc h on qRAMs. After this talk\, you will have the resources you need to dive into using Q# for your own research projects!\n\nHosted by Chris Ferrie\, UTS Centre for Quantum Software and Information\n LOCATION:https://researchseminars.org/talk/UTSQSI/16/ END:VEVENT BEGIN:VEVENT SUMMARY:Dominik Hangleiter (Institute of Theoretical Physics\, Free Univer sity of Berlin\, Germany) DTSTART:20200910T070000Z DTEND:20200910T080000Z DTSTAMP:20260422T212930Z UID:UTSQSI/17 DESCRIPTION:Title: Quantum vs Classical Learnability of Discrete Distributions\nby Domini k Hangleiter (Institute of Theoretical Physics\, Free University of Berlin \, Germany) as part of Centre for Quantum Software and Information Seminar Series\n\n\nAbstract\nQuantum machine learning has been hailed as one of the promising near-term applications of small quantum computers and much r esearch is focused on devising quantum heuristics that might yield an adva ntage over classical learning algorithms.\nIn this talk\, we will take a s tep back and ask: Can we hope for a provable quantum advantage in machine learning? To this end we focus on the following learning task: Given sampl es from some unknown discrete probability distribution\, output an efficie nt algorithm for generating new samples from that distribution.\nIndeed\, many machine learning tasks can be reduced to such generative learning of discrete distributions. But it is not at all clear whether or not discrete distributions admit a structure that can be exploited by quantum computer s. Our main result is a positive answer to the above question: We explicit ly construct a class of discrete distributions which\, under the decisiona l Diffie-Hellman assumption\, is provably not efficiently learnable by a c lassical generative modelling algorithm\, but for which we construct an ef ficient quantum learner.\nFrom a bird's eye perspective\, our proof levera ges the power of quantum computers to solve the hidden subgroup problem to a distribution learning setting. But we will also take on the mole's pers pective and work through an intricate cryptographic argument that proves t he (conditional) learning separation.\n\nHosted by Márika Kieferová\, UT S Centre for Quantum Software and Information\n LOCATION:https://researchseminars.org/talk/UTSQSI/17/ END:VEVENT BEGIN:VEVENT SUMMARY:Vincent Mourik (Fundamental Quantum Technologies Laboratory & Cent re for Quantum Computation and Communication Technology\, UNSW\, Sydney) DTSTART:20200915T000000Z DTEND:20200915T010000Z DTSTAMP:20260422T212930Z UID:UTSQSI/18 DESCRIPTION:Title: Coherent electrical control of a high spin nucleus in silicon\nby Vinc ent Mourik (Fundamental Quantum Technologies Laboratory & Centre for Quant um Computation and Communication Technology\, UNSW\, Sydney) as part of Ce ntre for Quantum Software and Information Seminar Series\n\n\nAbstract\nNu clear electric resonance (NER) enables transitions of a high spin nucleus by modulating its electrical quadrupole interaction with an electric field . In this talk I will show how we found this effect in our single 123-Sb d onor device in silicon\, with a nuclear spin of size 7/2. We demonstrate\, for the first time\, coherent\, purely electrical control of a single hig h spin nucleus. I will share our theoretical understanding of the microsco pic mechanism at play in our device. Finally\, I will discuss future resea rch directions exploiting this versatile system.\n\nHOSTED BY: Dr JP Dehol lain\, UTS Centre for Quantum Software and Information.\n LOCATION:https://researchseminars.org/talk/UTSQSI/18/ END:VEVENT BEGIN:VEVENT SUMMARY:Benjamin Huard (ENS Lyon) DTSTART:20201003T060000Z DTEND:20201003T070000Z DTSTAMP:20260422T212930Z UID:UTSQSI/19 DESCRIPTION:Title: Measuring the number of photons in a microwave mode\nby Benjamin Huard (ENS Lyon) as part of Centre for Quantum Software and Information Seminar Series\n\n\nAbstract\nCounting the number of photons in an electromagneti c mode is an important tool for quantum information processing. In order t o perform a single shot measurement\, one usually encodes information abou t the photon number into a qubit state and read out the qubit. Repeating t his procedure while varying the encoded single bit of information enables to pinpoint the number of photons. In this talk\, I will present two exper iments that address two main challenges in photocounting. \n\nFirst\, I wi ll show how one can avoid the sequential repetition of qubit measurements and instead use a single superconducting qubit in order to multiplex the m easurement of the photon number in a stationary microwave mode.\n\nSecond\ , I will show how we could convert a stationary mode counter into a photoc ounter of traveling wave packets using a quantum memory.\n\nHosted by Nath an Langford\, UTS Centre for Quantum Software and Information\n LOCATION:https://researchseminars.org/talk/UTSQSI/19/ END:VEVENT BEGIN:VEVENT SUMMARY:Kaumudibikash Goswami (University of Queensland) DTSTART:20201013T000000Z DTEND:20201013T010000Z DTSTAMP:20260422T212930Z UID:UTSQSI/20 DESCRIPTION:Title: Indefinite causal order\nby Kaumudibikash Goswami (University of Queen sland) as part of Centre for Quantum Software and Information Seminar Seri es\n\n\nAbstract\nIn our daily life\, we experience a fixed order of event s. The notion of such a fixed causal order breaks down when we enter the q uantum regime. In the quantum realm\, it is possible to have situations wh ere no definite causal structure can be attributed. Apart from the foundat ional aspect\, such exotic causal structures are useful to achieve augment ed communication.\n\nIn the first two parts of this talk\, I will present our experimental realisation of an indefinitely causal ordered scenario an d demonstrate how one can achieve a communication advantage out of it. In the last part\, I will discuss how one can attribute several information-t heoretic aspects to an arbitrary causal structure. In that part\, I will d efine a notion of classical capacity for an indefinite causal order\, and present several information-theoretic bounds obtained from our study.\n LOCATION:https://researchseminars.org/talk/UTSQSI/20/ END:VEVENT BEGIN:VEVENT SUMMARY:Menno Veldhorst (QuTech and Kavli Institute of Nanoscience Delft U niversity of Techology\, The Netherlands) DTSTART:20201022T050000Z DTEND:20201022T060000Z DTSTAMP:20260422T212930Z UID:UTSQSI/21 DESCRIPTION:Title: A four-qubit germanium quantum processor\nby Menno Veldhorst (QuTech a nd Kavli Institute of Nanoscience Delft University of Techology\, The Neth erlands) as part of Centre for Quantum Software and Information Seminar Se ries\n\n\nAbstract\nThe prospect of building quantum circuits using advanc ed semiconductor manufacturing positions quantum dots as an attractive pla tform for quantum information processing. Extensive studies on various mat erials have led to demonstrations of two-qubit logic in gallium arsenide\, silicon\, and germanium. However\, interconnecting larger numbers of qubi ts in semiconductor devices has remained an outstanding challenge. Here\, we demonstrate a four-qubit quantum processor based on hole spins in germa nium quantum dots. Furthermore\, we define the quantum dots in a two-by-tw o array and obtain controllable coupling along both directions. Qubit logi c is implemented all-electrically and the exchange interaction can be puls ed to freely program one-qubit\, two-qubit\, three-qubit\, and four-qubit operations\, resulting in a compact and high-connectivity circuit. We exec ute a quantum logic circuit that generates a four-qubit Greenberger-Horne- Zeilinger state and we obtain coherent evolution by incorporating dynamica l decoupling. These results are an important step towards quantum error co rrection and quantum simulation with quantum dots.\n\nHosted by JP Deholla in\, UTS Centre for Quantum Software and Information\n LOCATION:https://researchseminars.org/talk/UTSQSI/21/ END:VEVENT BEGIN:VEVENT SUMMARY:Pedro Costa (Macquarie University\, Sydney\, Australia) DTSTART:20210429T030000Z DTEND:20210429T040000Z DTSTAMP:20260422T212930Z UID:UTSQSI/22 DESCRIPTION:Title: Quantum-to-Classical transition via Quantum Cellular Automata\nby Pedr o Costa (Macquarie University\, Sydney\, Australia) as part of Centre for Quantum Software and Information Seminar Series\n\n\nAbstract\nA quantum c ellular automaton (QCA) is an abstract model consisting of an array of fin ite-dimensional quantum systems that evolves in discrete time by local uni tary operations. Here we propose a simple coarse-graining map\, where the spatial structure of the QCA is merged into effective ones. Starting with a QCA that simulates the Dirac equation we apply this coarse-graining map recursively until we get its effective dynamics in the semi-classical limi t\, which can be described by a classical cellular automaton. We show that the emergent-effective result of the former microscopic discrete model co nverges to the diffusion equation and to a classical transport equation un der a specific initial condition. Therefore\, QCA is a good model to valid ate the quantum-to-classical transition.\n\nPlease email cqsiadmin@uts.edu .au to request the zoom link. Include your company/organisation's email an d your Zoom account name in your request.\n LOCATION:https://researchseminars.org/talk/UTSQSI/22/ END:VEVENT BEGIN:VEVENT SUMMARY:Martin Plávala (Universität Siegen) DTSTART:20210513T060000Z DTEND:20210513T070000Z DTSTAMP:20260422T212930Z UID:UTSQSI/23 DESCRIPTION:Title: Jordan products of quantum channels and their compatibility\nby Martin Plávala (Universität Siegen) as part of Centre for Quantum Software and Information Seminar Series\n\n\nAbstract\nGiven two quantum channels\, we examine the task of determining whether they are compatible - meaning tha t one can perform both channels simultaneously but\, in the future\, choos e exactly one channel whose output is desired (while forfeiting the output of the other channel). We show several results concerning this task. Firs t\, we show it is equivalent to the quantum state marginal problem\, i.e.\ , every quantum state marginal problem can be recast as the compatibility of two channels\, and vice versa. Second\, we show that compatible measure -and-prepare channels (i.e.\, entanglement-breaking channels) do not neces sarily have a measure-and-prepare compatibilizing (i.e.\, joint) channel. Third\, we extend the notion of the Jordan product of matrices to quantum channels and present sufficient conditions for channel compatibility. Last \, we formulate the different notions of compatibility as semidefinite pro grams and numerically test when families of partially dephasing-depolarizi ng channels are compatible and when the Jordan product of channels gives a valid compatibilizing channel.\n\nTo request the zoom link\, please send a message cqsiadmin@uts.edu.au using your business email address.\nWatch p revious seminars: https://www.youtube.com/c/UTSQuantum.\n LOCATION:https://researchseminars.org/talk/UTSQSI/23/ END:VEVENT BEGIN:VEVENT SUMMARY:Richard Kueng (Johannes Kepler University Linz) DTSTART:20210527T060000Z DTEND:20210527T070000Z DTSTAMP:20260422T212930Z UID:UTSQSI/24 DESCRIPTION:Title: The classical shadow formalism and (some) implications for quantum machine learning\nby Richard Kueng (Johannes Kepler University Linz) as part of Centre for Quantum Software and Information Seminar Series\n\n\nAbstrac t\nExtracting important information from a quantum system as efficiently a nd tractably as possible is an important subroutine in most near-term appl ications of quantum hardware.\nWe present an efficient method for construc ting an approximate classical description of a quantum state using very fe w measurements of the state. This description\, called a classical shadow\ , can be used to predict many different properties. The required number of measurements is independent of the system size and saturates information- theoretic lower bounds.\nIf time permits\, I will also illustrate how one can combine classical shadows with machine learning (ML). This combination showcases that training data obtained from quantum experiments can be ver y empowering for classical ML methods. \n\nThis is joint work with Robert Huang and John Preskill (both Caltech).\n\nTo request the zoom link\, plea se send a message cqsiadmin@uts.edu.au using your institution/organisation /business email address.\n\nHOSTED BY: Dr Mária Kieferová\, Centre for Q uantum Software and Information\, University of Technology Sydney\, Austra lia\n LOCATION:https://researchseminars.org/talk/UTSQSI/24/ END:VEVENT BEGIN:VEVENT SUMMARY:Anurag Anshu (University of California\, Berkeley) DTSTART:20210610T003000Z DTEND:20210610T013000Z DTSTAMP:20260422T212930Z UID:UTSQSI/25 DESCRIPTION:Title: An area law for 2D frustration-free spin systems\nby Anurag Anshu (Uni versity of California\, Berkeley) as part of Centre for Quantum Software a nd Information Seminar Series\n\n\nAbstract\nWe prove that the entanglemen t entropy of the ground state of a locally gapped frustration-free 2D latt ice spin system satisfies an area law with respect to a vertical bipartiti on of the lattice into left and right regions. We first establish that the ground state projector of any locally gapped frustration-free 1D spin sys tem can be approximated to within error ∈ by a degree O(√nlog(∈-1)) (equation unformatted-refer to paper link) multivariate polynomial in the interaction terms of the Hamiltonian. This generalizes the optimal bound o n the approximate degree of the boolean AND function\, which corresponds t o the special case of commuting Hamiltonian terms. For 2D spin systems we then construct an approximate ground state projector (AGSP) that employs t he optimal 1D approximation in the vicinity of the boundary of the biparti tion of interest. This AGSP has sufficiently low entanglement and error to establish the area law using a known technique.\n\nJoint work with Itai A rad and David Gosset. arXiv: 2103.02492 (https://arxiv.org/abs/2103.02492) \n\nTo request the zoom link\, please send a message cqsiadmin@uts.edu.au using your business/organisation/institution email address.\nHosted by Ass ociate Professor Troy Lee\, Centre for Quantum Software and Information\, University of Technology Sydney\n LOCATION:https://researchseminars.org/talk/UTSQSI/25/ END:VEVENT BEGIN:VEVENT SUMMARY:Xin Hong (Centre for Quantum Software and Information\, University of Technology Sydney) DTSTART:20210624T060000Z DTEND:20210624T070000Z DTSTAMP:20260422T212930Z UID:UTSQSI/26 DESCRIPTION:Title: A Tensor Network based Decision Diagram for Representation of Quantum Circ uits\nby Xin Hong (Centre for Quantum Software and Information\, Unive rsity of Technology Sydney) as part of Centre for Quantum Software and Inf ormation Seminar Series\n\n\nAbstract\nTensor networks have been successfu lly applied in the simulation of quantum physical systems for decades. Rec ently\, they have also been employed in classical simulation of quantum co mputing\, in particular\, random quantum circuits.\n\nIn this talk\, I wil l introduce a decision-diagram style data structure\, called TDD (Tensor D ecision Diagram)\, for more principled and convenient applications of ten sor networks. This new data structure provides a compact and canonical re presentation for quantum circuits. By exploiting techniques for tensor net works\, the TDD of a quantum circuit can be computed efficiently.\n\nFurth ermore\, we show that the operations of tensor networks essential in their applications (e.g.\, addition and contraction)\, can also be implemented efficiently in TDD. It is expected that TDDs will play an important role in various design automation tasks related to quantum circuits\, includin g but not limited to equivalence checking\, error detection\, synthesis\, simulation\, and verification. As an example\, I will also introduce the u se of TDD in the approximate equivalence checking of noisy quantum circuit s.\n\nTo request the zoom link\, please send a message cqsiadmin@uts.edu.a u using your business/organisation/institution email address.\n LOCATION:https://researchseminars.org/talk/UTSQSI/26/ END:VEVENT BEGIN:VEVENT SUMMARY:Yihui Quek (Stanford University) DTSTART:20210708T010000Z DTEND:20210708T020000Z DTSTAMP:20260422T212930Z UID:UTSQSI/27 DESCRIPTION:Title: Introduction to Quantum Singular Value Transform with applications to Petz map\, Polar decomposition and Pretty-Good Measurements\nby Yihui Quek (Stanford University) as part of Centre for Quantum Software and Informat ion Seminar Series\n\n\nAbstract\nThe recently-introduced quantum algorith mic technique of quantum singular value transform (QSVT) has been hailed a s a `grand unification of quantum algorithms’.\n\nIn this talk\, we give a pedagogical introduction to this toolbox\, and illustrate its flexibili ty and precision by using it to implement tools in quantum linear algebra\ , quantum noise recovery and optimal quantum measurements: i) the quantum polar decomposition ii) the Petz recovery channel iii) pretty-good measure ments. Previously\, a significant hurdle to the experimental realization o f these vaunted theoretical tools was the lack of a systematic and efficie nt method to implement them\; we rectify this lack by proposing quantum al gorithms for all three tools based on QSVT.\n\nThis talk is based on arXiv :2006.16924 and arXiv:2106.07634.\n\nTo request the zoom link\, please sen d a message cqsiadmin@uts.edu.au using your business/organisation/institut ion email address.\n\nSEMINAR HOSTED BY: Dr Mária Kieferová\, Centre for Quantum Software and Information\, University of Technology Sydney\, Aust ralia\n LOCATION:https://researchseminars.org/talk/UTSQSI/27/ END:VEVENT BEGIN:VEVENT SUMMARY:Zhicheng Zhang (University of Chinese Academy of Sciences\, Beijin g) DTSTART:20210819T010000Z DTEND:20210819T020000Z DTSTAMP:20260422T212930Z UID:UTSQSI/30 DESCRIPTION:Title: Parallel Quantum Algorithm for Hamiltonian Simulation\nby Zhicheng Zha ng (University of Chinese Academy of Sciences\, Beijing) as part of Centre for Quantum Software and Information Seminar Series\n\n\nAbstract\nWe stu dy how parallelism can speed up quantum simulation. A parallel quantum alg orithm is proposed for simulating the dynamics of a large class of Hamilto nians with good sparse structures\, called uniform-structured Hamiltonians \, including various Hamiltonians of practical interest like local Hamilto nians and Pauli sums.\nGiven the oracle access to the target sparse Hamilt onian\, in both query and gate complexity\, the running time of our parall el quantum simulation algorithm measured by the quantum circuit depth has a doubly (poly-)logarithmic dependence polylog log(1/є) on the simulation precision є. This presents an exponential improvement over the dependenc e polylog(1/є) of previous optimal sparse Hamiltonian simulation algorith m without parallelism. To obtain this result\, we introduce a novel notion of parallel quantum walk\, based on Childs’ quantum walk. The target ev olution unitary is approximated by a truncated Taylor series\, which is ob tained by combining these quantum walks in a parallel way. A lower bound Ω(log log(1/є)) is established\, showing that the є-dependence of the gate depth achieved in this work cannot be significantly improved.\nOur al gorithm is applied to simulating three physical models: the Heisenberg mod el\, the Sachdev-Ye-Kitaev model and a quantum chemistry model in second q uantization. By explicitly calculating the gate complexity for implementin g the oracles\, we show that on all these models\, the total gate depth of our algorithm has a polylog log(1/є) dependence in the parallel setting. \n\nOnline Seminar. To request the zoom link\, please send a message cqsia dmin@uts.edu.au using your business/organisation/institution email address . \nSeminar Webpage: https://www.uts.edu.au/research/centre-quantum-softwa re-and-information/events/qsi-seminar-zhicheng-zhang-ucas-beijing\n LOCATION:https://researchseminars.org/talk/UTSQSI/30/ END:VEVENT BEGIN:VEVENT SUMMARY:Zixin Huang (MQ Center for Quantum Engineering\, Macquarie Univers ity\, Sydney\, Australia) DTSTART:20210916T010000Z DTEND:20210916T020000Z DTSTAMP:20260422T212930Z UID:UTSQSI/33 DESCRIPTION:Title: Sub-wavelength quantum imaging for astronomy and LIDAR detection\nby Z ixin Huang (MQ Center for Quantum Engineering\, Macquarie University\, Syd ney\, Australia) as part of Centre for Quantum Software and Information Se minar Series\n\n\nAbstract\nThe resolution limit of standard imaging techn iques is expressed by the Rayleigh criterion\, which states that two point -like sources are difficult to resolve if their transverse separation is s maller than the Rayleigh length. While the criterion is useful in the case of direct detection imaging\, other measurement techniques may not be sub ject to this limitation. Here we consider the use of imaging to estimate t he distance between an arbitrary number of incoherent point sources. In th e regime of weak signals\, a structured measurement obtained by concatenat ing a linear interferometer with on-off photo-detection is immune to the R ayleigh curse. In this way\, we clarify the relationship between imaging a nd interferometry\, and establish the optimality of linear interferometry for an arbitrary number of incoherent sources. We apply these techniques t o LIDAR detection as well as exoplanet detection\, finding optimal measure ments for both these tasks.\n\nHOSTED BY: Dr Peter Rohde\, Centre for Quan tum Software and Information\, University of Technology Sydney\n\nTo reque st the zoom link\, please send a message cqsiadmin@uts.edu.au using your b usiness/organisation/institution email address.\n LOCATION:https://researchseminars.org/talk/UTSQSI/33/ END:VEVENT BEGIN:VEVENT SUMMARY:Kamil Korzekwa (Jagiellonian University) DTSTART:20210930T060000Z DTEND:20210930T070000Z DTSTAMP:20260422T212930Z UID:UTSQSI/34 DESCRIPTION:Title: Fundamental Constraints of Quantum Thermodynamics in the Markovian Regime< /a>\nby Kamil Korzekwa (Jagiellonian University) as part of Centre for Qua ntum Software and Information Seminar Series\n\n\nAbstract\nTypical micros copic derivations of the dynamics of a finite-dimensional quantum system i nteracting with a large thermal bath lead to a master equation with a cova riant Lindbladian that obeys the second law of thermodynamics.\n\nIn this talk I will present the fundamental constraints on population dynamics gen erated by all such Markovian thermal processes based on a newly introduced concept of continuous thermo-majorisation. More precisely\, given the ini tial population of the system in the energy eigenbasis\, I will state the necessary and sufficient conditions for the existence of a Markovian therm al process that transforms the system into a state with a given final popu lation. This will provide an exhaustive H-type theorem in terms of a conti nuous family of entropic functions that need to monotonically increase dur ing the dynamics.\n\nI will also present an algorithm that in a finite num ber of steps allows one to construct the full cone of population vectors a chievable from a given initial state. Moreover\, I will demonstrate that a ll such vectors can be obtained from the initial state by a universal set of elementary thermal controls given by two-level partial thermalisations. Finally\, I will employ these results to investigate optimal work extract ion and cooling processes\, illustrating the role that memory effects play in thermodynamic protocols.\n\nTo request the zoom link\, please send a m essage cqsiadmin@uts.edu.au using your business/organisation/institution e mail address.\n LOCATION:https://researchseminars.org/talk/UTSQSI/34/ END:VEVENT BEGIN:VEVENT SUMMARY:Kunal Sharma (University of Maryland) DTSTART:20211014T000000Z DTEND:20211014T010000Z DTSTAMP:20260422T212930Z UID:UTSQSI/35 DESCRIPTION:Title: Trainability of Parameterized Quantum Circuits\nby Kunal Sharma (Unive rsity of Maryland) as part of Centre for Quantum Software and Information Seminar Series\n\n\nAbstract\nVariational quantum algorithms (VQAs) and Qu antum Neural Networks (QNNs) have emerged as promising strategies to achie ve quantum advantage on near-term quantum devices. The success of VQAs/QNN s depends on several factors\, including the trainability and expressibili ty of parameterized quantum circuits (PQCs). Along with numerical experime nts\, rigorous analytical results are necessary to guarantee the scalabili ty of these algorithms.\nIn this seminar\, I will first summarize well-kno wn results on barren plateaus\, where certain circumstances lead to expone ntially vanishing gradients. Then I will present our recent results establ ishing a fundamental relationship between expressibility and trainability of PQCs. Next\, I will outline our analysis on the trainability of percept ron-based QNNs. One common assumption to avoid barren plateaus is to empl oy problem-inspired PQCs. I will present that for problem-inspired PQCs\, such as Quantum Alternating Operator Ansatz (QAOA) and Hamiltonian Variati onal Ansatz (HVA)\, trainability depends on the controllability of the sys tem and is not always guaranteed. Finally\, I will describe the effect of hardware noise on the training landscape for a generic PQC and summarize p otential strategies to avoid trainability issues.\n\nTo request the zoom l ink\, please send a message cqsiadmin@uts.edu.au using your business/organ isation/institution email address.\n LOCATION:https://researchseminars.org/talk/UTSQSI/35/ END:VEVENT BEGIN:VEVENT SUMMARY:Anirudh Krishna (Stanford University) DTSTART:20211028T000000Z DTEND:20211028T010000Z DTSTAMP:20260422T212930Z UID:UTSQSI/36 DESCRIPTION:Title: Abstract and physical constraints on quantum LDPC codes\nby Anirudh Kr ishna (Stanford University) as part of Centre for Quantum Software and Inf ormation Seminar Series\n\n\nAbstract\nDATE: 28 October\, 2021\nTIME: 11:0 0 am – 12:00 pm AEDT (Local Sydney time)\nTITLE: Abstract and physical c onstraints on quantum LDPC codes\nTOPIC: Quantum error correction\n\nSPEAK ER: Dr Anirudh Krishna\nAFFILIATION: Stanford University\, California\, US A\n\nABSTRACT:\nSeminal results by Bravyi\, Poulin and Terhal have shown t hat quantum codes are limited by locality. As a consequence\, all topologi cal codes witness sharp tradeoffs between their rate and distance. Quantum LDPC codes can be viewed as a generalization of topological codes constru cted using spatially-nonlocal connections. It is unclear what\, if any\, f undamental constraints these codes obey. The state-of-the-art code paramet ers are far from what their classical counterparts can achieve. We explore this question and present no-go results that shed some light on what is n ot possible.\n\nWe approach this question in two ways\, using abstract and physical constraints. First\, we use a graph-theoretic representation of a quantum code to show that the connectivity of this representation allows us to understand limitations of the associated code. We obtain generaliza tions of the Bravyi-Poulin-Terhal and Bravyi-Koenig bounds. We then study the complementary problem of embedding a code in D Euclidean dimensions. W e ask how many long-range interactions we need to obtain a target code dim ension k and distance d. Focusing on 2 dimensions (and ignoring polylogart hmic corrections)\, we find that a code with distance d requires Ω(d) int eractions of length Ω(d/√n). Furthermore\, a constant-rate code distanc e d requires Ω(n) interactions of length Ω(√d).\n\nThis is joint work with Nouédyn Baspin. It is based on the papers arXiv: 2106.00765 (https:/ /arxiv.org/abs/2106.00765) and arXiv: 2109.10982 (https://arxiv.org/abs/21 09.10982)\n\nTo request the zoom link\, please send a message cqsiadmin@ut s.edu.au using your business/organisation/institution email address.\n LOCATION:https://researchseminars.org/talk/UTSQSI/36/ END:VEVENT BEGIN:VEVENT SUMMARY:Elija Perrier (UTS Centre for Quantum Software and Information) DTSTART:20211125T000000Z DTEND:20211125T010000Z DTSTAMP:20260422T212930Z UID:UTSQSI/37 DESCRIPTION:Title: Quantum Ethics\nby Elija Perrier (UTS Centre for Quantum Software and Information) as part of Centre for Quantum Software and Information Semina r Series\n\n\nAbstract\nQuantum computing is among the most significant te chnologies to emerge in recent decades\, offering the promise of paradigm- shifting computational capacity with significant ethical consequences. On a technical level\, the unique features of quantum computation have conseq uences for the imposition of fairness and ethical constraints on computati on. Despite its significance\, little if no structured research has been u ndertaken into the ethical implications of quantum technologies.\n\nIn thi s paper\, we fill this gap in the literature by presenting a roadmap for e thical quantum computing setting out prospective research programmes. We s ituate quantum ethics at the cross-disciplinary intersection of quantum in formation science\, technology ethics and moral philosophy. We summarise t he key elements of quantum information processing relevant to ethical anal ysis and set-out taxonomies for use by researchers considering the ethics of quantum technologies. In doing so\, we inaugurate the cross-disciplinar y field of the ethics of quantum computing.\n\nHOSTED BY: Associate Profes sor Chris Ferrie\, Centre for Quantum Software and Information\, Universit y of Technology Sydney\, Australia\n LOCATION:https://researchseminars.org/talk/UTSQSI/37/ END:VEVENT BEGIN:VEVENT SUMMARY:Stefano Pirandola (nodeQ & UY (UK)) DTSTART:20211208T220000Z DTEND:20211208T230000Z DTSTAMP:20260422T212930Z UID:UTSQSI/38 DESCRIPTION:Title: Quantum communications over the quantum internet\nby Stefano Pirandola (nodeQ & UY (UK)) as part of Centre for Quantum Software and Information Seminar Series\n\n\nAbstract\nABSTRACT: After reviewing the building bloc ks of the future quantum internet\, I will discuss some of the key challen ges to address for ensuring quantum-security in near-term network communic ations. In this context\, I will review some of the fundamental trade-offs and limitations to consider in the optimization of both point-to-point an d end-to-end quantum communications.\n\nTo request the zoom link\, please send a message cqsiadmin@uts.edu.au using your business/organisation/insti tution email address. \nHOSTED BY: Dr Simon Devitt\, Centre for Quantum So ftware and Information\, University of Technology Sydney\, Australia\n LOCATION:https://researchseminars.org/talk/UTSQSI/38/ END:VEVENT END:VCALENDAR