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:20260404T094832Z
UID:UTSQSI/1
DESCRIPTION:Title: Introducing Adversarial Quantum Learning: Security and machine learn
ing on the quantum internet\nby Nana Liu (Shanghai Jiao Tong Universit
y\, China) as part of Centre for Quantum Software and Information Seminar
Series\n\nAbstract: TBA\n
LOCATION:https://stable.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:20260404T094832Z
UID:UTSQSI/2
DESCRIPTION:Title: Training fully quantum Boltzmann machines\nby Nathan Wiebe (Paci
fic Northwest National Labs\, University of Washington) as part of Centre
for Quantum Software and Information Seminar Series\n\n\nAbstract\nIn rece
nt years quantum machine learning has grown by leaps and bounds but a majo
r problem still vexes the field is how to efficiently train quantum neural
networks. This is particularly challenging because of the lack of a natu
ral backpropagation algorithm for updating the quantum model. \nIn this ta
lk\, I will focus on an approach that can mitigate this problem through ge
nerative training. We will show how to construct a fully quantum model of
a Boltzmann machine and train all of the parameters of that model for bot
h the quantum and classical parameters in the model. In contrast\, existi
ng methods were not able to achieve this. \nIn particular\, we will show e
xplicit query upper bounds for the cost of simulation\, provide a formal p
roof for BQP-completeness for evaluating such neural networks and also dis
cuss remaining problems in the field and how to generalize the ideas prese
nted here to go beyond Boltzmann machines to allow efficient training of b
road classes of quantum neural networks.\n
LOCATION:https://stable.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:20260404T094832Z
UID:UTSQSI/3
DESCRIPTION:Title: How well can a classical client delegate quantum computation?\nb
y Kai-Min Chung (Institute of Information Science\, Acedemia Sinica\, Taiw
an) as part of Centre for Quantum Software and Information Seminar Series\
n\n\nAbstract\nIn a recent breakthrough\, Mahadev (FOCS 2018) constructed
the first classical verification of quantum computation (CVQC) protocol th
at allows a classical client to delegate the computation of a BQP language
(i.e.\, a decision problem) to an efficient quantum server.\n\nIn this ta
lk\, we present several generalizations of Mahadev’s work. In particular
\, we initiate the study of CVQC protocols for quantum *sampling* problems
and construct the first such protocol that allows a classical client to v
erifiably 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 comple
xity of the delegated computation. Finally\, we present a generic compiler
that compiles any CVQC protocol to achieve blindness\, i.e.\, the server
learns nothing about the client’s input\, which leads to the first const
ant-round blind CVQC protocol.\n\nBased on joint works with Nai-Hui Chia\,
Takashi Yamakawa\, Yi Lee\, Han-Husan Lin\, and Xiaodi Wu\n\nHosted by Pr
of Zhengfeng Ji\, UTS Centre for Quantum Software and Information.\n
LOCATION:https://stable.researchseminars.org/talk/UTSQSI/3/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Maria Schuld (Xanadu\, Toronto\, Canada)
DTSTART:20200605T040000Z
DTEND:20200605T050000Z
DTSTAMP:20260404T094832Z
UID:UTSQSI/4
DESCRIPTION:Title: Encoding Classical Data into Quantum States for Machine Learning
\nby Maria Schuld (Xanadu\, Toronto\, Canada) as part of Centre for Quantu
m Software and Information Seminar Series\n\n\nAbstract\nWhen quantum comp
uters are used to process classical data - a setting investigated in the e
merging field of quantum machine learning - the first step is to encode da
ta into quantum states. In fact\, this is the most important step: the way
we encode classical data determines almost entirely the potential power o
f a quantum machine learning algorithm.\nThis talk sheds light on differen
t aspects of this data encoding\, from claims of exponential speedups to q
uantum feature maps and quantum kernel methods.\nIn particular\, it will p
resent the framework of quantum embeddings in which a data encoding can be
adaptively learnt from data\, while the circuit for optimal classificatio
n follows from well-known results in quantum information theory.\n\nHosted
by A/Prof Chris Ferrie\, UTS Centre for Quantum Software and Information.
\n
LOCATION:https://stable.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:20260404T094832Z
UID:UTSQSI/5
DESCRIPTION:Title: Understanding crosstalk in quantum processors\nby Robin Blume-Ko
hout (Sandia National Laboratories\, Albuquerque\, New Mexico) as part of
Centre for Quantum Software and Information Seminar Series\n\n\nAbstract\n
Model-based quantum tomography protocols like gate set tomography optimize
a noise model with some number of parameters in order to fit experimental
data. As the number of qubits increases\, two issues emerge: 1) the numb
er of model parameters grows\, and 2) the cost of propagating quantum stat
es (density matrices) increases exponentially. The first issue can be ad
dressed by considering reduced models that limit errors to being low-weigh
t and geometrically local. \n\nIn this talk\, we focus on the second issue
and present a method for performing approximate density matrix propagatio
n based on perturbative expansions of error generators. The method is tai
lored to the likelihood optimization problem faced by model-based tomograp
hy protocols. 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/Prof Chris Ferrie\, UTS Centre for Quantum Software and Information.
\n\nPlease note\, Erik Nielsen's seminar will follow directly after Robin
Blume-Kohout's seminar.\n
LOCATION:https://stable.researchseminars.org/talk/UTSQSI/5/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Lieven Vandersypen (QuTech\, Delft University of Technology\, Neth
erlands)
DTSTART:20200625T060000Z
DTEND:20200625T070000Z
DTSTAMP:20260404T094832Z
UID:UTSQSI/6
DESCRIPTION:Title: Silicon spin qubits gain traction for large-scale quantum computatio
n and simulation.\nby Lieven Vandersypen (QuTech\, Delft University of
Technology\, Netherlands) as part of Centre for Quantum Software and Info
rmation Seminar Series\n\n\nAbstract\nExcellent control of over physical 5
0 qubits has been achieved\, but can we also realize 50 fault-tolerant qub
its? Here quantum bits encoded in the spin state of individual electrons i
n 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 simul
ation of Fermi-Hubbard physics and quantum magnetism.\n
LOCATION:https://stable.researchseminars.org/talk/UTSQSI/6/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Erik Nielsen (Sandia National Laboratories\, Albuquerque\, New Mex
ico)
DTSTART:20200612T003000Z
DTEND:20200612T010000Z
DTSTAMP:20260404T094832Z
UID:UTSQSI/7
DESCRIPTION:Title: Hold the onion: using fewer circuits to characterize your quoits
\nby Erik Nielsen (Sandia National Laboratories\, Albuquerque\, New Mexico
) as part of Centre for Quantum Software and Information Seminar Series\n\
n\nAbstract\nModel-based quantum tomography protocols like gate set tomogr
aphy optimize a noise 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 model parameters grows\, and 2) the cost of propagating
quantum states (density matrices) increases exponentially. The first is
sue can be addressed by considering reduced models that limit errors to be
ing low-weight and geometrically local. \n\nIn this talk\, we focus on the
second issue and present a method for performing approximate density matr
ix propagation based on perturbative expansions of error generators. The
method is tailored to the likelihood optimization problem faced by model-b
ased tomography protocols. We will discuss the advantages and drawbacks o
f using this method when characterizing the errors in up to 8-qubit system
s.\n\nHosted by A/Prof Chris Ferrie\, UTS Centre for Quantum Software and
Information. \n\nPlease note\, the starting time is only an estimate as E
rik Nielsen's seminar will follow directly after the ~30min seminar of Rob
in Blume-Kohout.\n
LOCATION:https://stable.researchseminars.org/talk/UTSQSI/7/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Marissa Giustina (Google AI Quantum\, Google Research)
DTSTART:20200609T010000Z
DTEND:20200609T020000Z
DTSTAMP:20260404T094832Z
UID:UTSQSI/8
DESCRIPTION:Title: Building Google’s quantum computer\nby Marissa Giustina (Googl
e AI Quantum\, Google Research) as part of Centre for Quantum Software and
Information Seminar Series\n\n\nAbstract\nThe Google AI Quantum team deve
lops chip-based circuitry that one can interact with (control and read out
) and which behaves reliably according to a simple quantum model. Such qua
ntum hardware holds promise as a platform for tackling problems intractabl
e to classical computing hardware. While the demonstration of a universal\
, fault-tolerant\, quantum computer remains a goal for the future\, it has
informed the design of a prototype with which we have recently controlled
a quantum system of unprecedented scale. \n\nThis talk introduces Google
’s quantum computing effort from both hardware and quantum-information p
erspectives\, including an overview of recent technological developments a
nd some recent results.\n\nHosted by: A/Prof Nathan Langford\, UTS Centre
for Quantum Software and Information\n
LOCATION:https://stable.researchseminars.org/talk/UTSQSI/8/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Daniel Grier (University of Waterloo\, Canada)
DTSTART:20200616T010000Z
DTEND:20200616T020000Z
DTSTAMP:20260404T094832Z
UID:UTSQSI/9
DESCRIPTION:Title: Interactive Shallow Clifford Circuits: Quantum advantage against NC1
and beyond\nby Daniel Grier (University of Waterloo\, Canada) as part
of Centre for Quantum Software and Information Seminar Series\n\n\nAbstra
ct\nRecent work of Bravyi et al. and follow-up work by Bene Watts et al. d
emonstrates a quantum advantage with shallow circuits: constant-depth quan
tum circuits can perform a task which constant-depth classical (i.e.\, AC^
0) circuits cannot. Their results have the advantage that the quantum circ
uit is fairly practical\, and their proofs are free of hardness assumption
s. In this talk\, I'll present a follow-up result\, which attempts to hol
d on to these advantages\, while increasing the power of the classical sim
ulator.\n\nThe main result is a two-round interactive task which is solved
by a constant-depth quantum circuit (using only Clifford gates\, between
neighboring qubits of a 2D grid\, with Pauli measurements)\, but such that
any classical machine/circuit for the task would need to solve parity-L-h
ard problems. I'll focus on proving a slightly weaker result (NC^1-hardne
ss)\, but the techniques generalize to parity-L.\n\nJoint work with Luke S
chaeffer.\n\nHosted by Michael Bremner\, UTS Centre for Quantum Software a
nd Information\n
LOCATION:https://stable.researchseminars.org/talk/UTSQSI/9/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Guillaume Verdon (X (formerly Google X)\, CA\, USA)
DTSTART:20200619T000000Z
DTEND:20200619T010000Z
DTSTAMP:20260404T094832Z
UID:UTSQSI/10
DESCRIPTION:Title: Quantum-probabilistic Generative Models and Variational Quantum The
rmalization\nby Guillaume Verdon (X (formerly Google X)\, CA\, USA) as
part of Centre for Quantum Software and Information Seminar Series\n\n\nA
bstract\nWe introduce a new class of generative quantum-neural-network-bas
ed models called Quantum Hamiltonian-Based Models (QHBMs). In doing so\, w
e establish a paradigmatic approach for quantum-probabilistic hybrid varia
tional learning of quantum mixed states\, where we efficiently decompose t
he tasks of learning classical and quantum correlations in a way which max
imizes the utility of both classical and quantum processors. In addition\,
we introduce the Variational Quantum Thermalizer (VQT) algorithm for gene
rating the thermal state of a given Hamiltonian and target temperature\, a
task for which QHBMs are naturally well-suited. The VQT can be seen as a
generalization of the Variational Quantum Eigensolver (VQE) to thermal sta
tes: we show that the VQT converges to the VQE in the zero temperature lim
it. We provide numerical results demonstrating the efficacy of these techn
iques in several illustrative examples. In addition to the introduction to
the theory and applications behind these models\, we will briefly walk th
rough their numerical implementation in TensorFlow Quantum.\n\nHosted by C
hris Ferrie\, UTS Centre for Quantum Software and Information\n
LOCATION:https://stable.researchseminars.org/talk/UTSQSI/10/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Lana Mineh (QET Labs\, University of Bristol)
DTSTART:20200623T070000Z
DTEND:20200623T080000Z
DTSTAMP:20260404T094832Z
UID:UTSQSI/11
DESCRIPTION:Title: Strategies for solving the Fermi-Hubbard model on near-term quantum
computers\nby Lana Mineh (QET Labs\, University of Bristol) as part o
f Centre for Quantum Software and Information Seminar Series\n\n\nAbstract
\nThe Fermi-Hubbard model is of fundamental importance in condensed-matter
physics\, yet is extremely challenging to solve numerically. Finding the
ground state of the Hubbard model using variational methods has been predi
cted to be one of the first applications of near-term quantum computers. H
ere we carry out a detailed analysis and optimisation of the complexity of
variational quantum algorithms for finding the ground state of the Hubbar
d model\, including costs associated with mapping to a real-world hardware
platform. The depth complexities we find are substantially lower than pre
vious work. We performed extensive numerical experiments for systems with
up to 12 sites. The results suggest that the variational ansätze we used
-- an efficient variant of the Hamiltonian Variational ansatz and a novel
generalisation thereof -- will be able to find the ground state of the Hub
bard model with high fidelity in relatively low quantum circuit depth. Our
experiments 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 les
s than a thousand could be sufficient to solve instances of the Hubbard mo
del beyond the capacity of classical exact diagonalisation.\n\nHosted by M
ichael Bremner\, UTS Centre for Quantum Software and Information. Email c
qsiadmin@uts.edu.au to request interactive zoom link.\n
LOCATION:https://stable.researchseminars.org/talk/UTSQSI/11/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ramis Movassagh (MIT-IBM Watson AI Lab)
DTSTART:20200702T233000Z
DTEND:20200703T003000Z
DTSTAMP:20260404T094832Z
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 Semi
nar Series\n\n\nAbstract\nGiven 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 co
mputer. Demonstration of computational advantages of noisy near-term quant
um 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 perf
ormed on 53-qubits.\n\nStockmeyer's theorem implies that efficient samplin
g allows for estimation of probability amplitudes. Therefore\, hardness of
probability estimation implies hardness of sampling. We prove that estima
ting 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.\n
\nSome ingredients that are developed to make this proof possible are cons
truction of the Cayley path as a rational function valued unitary path tha
t interpolate between two arbitrary unitaries\, an extension of Berlekamp-
Welch algorithm that efficiently and exactly interpolates rational functio
ns\, and construction of probability distributions over unitaries that are
arbitrarily close to the Haar measure.\n
LOCATION:https://stable.researchseminars.org/talk/UTSQSI/12/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Rodney Van Meter (Keio University)
DTSTART:20200630T020000Z
DTEND:20200630T030000Z
DTSTAMP:20260404T094832Z
UID:UTSQSI/13
DESCRIPTION:Title: Engineering the Quantum Internet\nby Rodney Van Meter (Keio Uni
versity) as part of Centre for Quantum Software and Information Seminar Se
ries\n\n\nAbstract\nExperimental progress toward a general-purpose Quantum
Internet is advancing rapidly\, but the challenges in building a Quantum
Internet extend far beyond having a physical layer that can create entangl
ement across a distance. Quantum Internet nodes must share management of
distributed tomography\, errors\, entanglement swapping\, multiplexing of
resources\, selection of routes\, and more to support application-requeste
d actions for distributed cryptographic functions\, quantum sensor network
s\, and distributed quantum computation. I will introduce our RuleSet-base
d Quantum Internet architecture and the simulation tools that are enabling
us to develop working protocols\, and discuss the need for multi-discipli
nary organizations to address the broad range of problems.\n\nRodney Van M
eter received a B.S. in engineering and applied science from the Californi
a Institute of Technology in 1986\, an M.S. in computer engineering from t
he University of Southern California in 1991\, and a Ph.D. in computer sci
ence from Keio University in 2006. His current research centers on quantum
computer architecture and quantum networking. Other research interests i
nclude storage systems\, networking\, and post-Moore's Law computer archit
ecture. He is now a Professor of Environment and Information Studies at K
eio University's Shonan Fujisawa Campus. He is the Vice Center Chair of K
eio's Quantum Computing Center. Dr. Van Meter is a member of AAAS\, ACM a
nd IEEE.\n\nHosted by Simon Devitt\, UTS Centre for Quantum Software and I
nformation\n
LOCATION:https://stable.researchseminars.org/talk/UTSQSI/13/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Adrian Chapman (University of Sydney)
DTSTART:20200707T010000Z
DTEND:20200707T020000Z
DTSTAMP:20260404T094832Z
UID:UTSQSI/14
DESCRIPTION:Title: Characterization of free-fermion-solvable spin models via graph inv
ariants\nby Adrian Chapman (University of Sydney) as part of Centre fo
r Quantum Software and Information Seminar Series\n\n\nAbstract\nFinding e
xact solutions to spin models is a fundamental problem of many-body physic
s. A workhorse technique for exact solution methods is mapping to an effec
tive description by noninteracting fermions. The paradigmatic example of t
his is the Jordan-Wigner transformation for finding an exact solution to t
he one-dimensional XY model. Another important example is the exact free-f
ermion solution to the two-dimensional Kitaev honeycomb model. \n\nI will
describe a framework for recognizing general models which can be solved th
is way by utilizing the tools of graph theory. Our construction relies on
a connection to the graph-theoretic problem of recognizing line graphs\, w
hich has been solved optimally. A corollary of this result is a complete s
et of constant-sized frustration structures which obstruct a free-fermion
solution. We classify the kinds of Pauli symmetries which can be present i
n 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 h
opping graph\, or (iii) the fermion parity. Clifford symmetries\, except i
n 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 discu
ssion of how we expect to generalize our framework beyond generator-to-gen
erator mappings.\n
LOCATION:https://stable.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:20260404T094832Z
UID:UTSQSI/15
DESCRIPTION:Title: Quantum many-body physics of photons in waveguide QED\nby Sahan
d Mahmoodian (Max Planck Institute for Gravitational Physics\, Leibniz Uni
versity\, Hannover) as part of Centre for Quantum Software and Information
Seminar Series\n\n\nAbstract\nThe generation and control of strongly inte
racting photons is a long-standing goal of quantum optics. In recent years
\, remarkable experiments with cavity QED platforms\, strongly interacting
Rydberg atoms\, and circuit QED have demonstrated photon-photon interacti
ons at the few-body level. In this talk I show that a conceptually simple
platform of two-level atoms ideally coupled to a chiral photonic mode form
s an exciting system for exploring the many-body physics of photons. Here\
, a class of bound photon eigenstates hold the key to understanding the dy
namics of this system at the few- and many-body scale. I will show that on
e can use these states to describe the entire spectrum from few-photon qua
ntum propagation\, to genuine quantum many-body (atom and photon) phenomen
a\, and ultimately the quantum-to-classical transition.\n
LOCATION:https://stable.researchseminars.org/talk/UTSQSI/15/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sarah Kaiser (Independent Researcher and Consultant)
DTSTART:20200908T000000Z
DTEND:20200908T010000Z
DTSTAMP:20260404T094832Z
UID:UTSQSI/16
DESCRIPTION:Title: Introduction to Q#: A quantum development language for everyone
\nby Sarah Kaiser (Independent Researcher and Consultant) as part of Centr
e for Quantum Software and Information Seminar Series\n\n\nAbstract\nAs th
e field of quantum computing expands from the academic to the industry rea
lm\, we need a way that we can continue to collaborate and innovate in bot
h regimes. Open source quantum software development platforms like the Qua
ntum Development Kit and Q# from Microsoft\, serve as a bridge to connect
research 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
research 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 F
errie\, UTS Centre for Quantum Software and Information\n
LOCATION:https://stable.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:20260404T094832Z
UID:UTSQSI/17
DESCRIPTION:Title: Quantum vs Classical Learnability of Discrete Distributions\nby
Dominik 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 research is focused on devising quantum heuristics that might yield
an advantage over classical learning algorithms.\nIn this talk\, we will t
ake a step back and ask: Can we hope for a provable quantum advantage in m
achine learning? To this end we focus on the following learning task: Give
n samples from some unknown discrete probability distribution\, output an
efficient algorithm for generating new samples from that distribution.\nIn
deed\, many machine learning tasks can be reduced to such generative learn
ing of discrete distributions. But it is not at all clear whether or not d
iscrete distributions admit a structure that can be exploited by quantum c
omputers. Our main result is a positive answer to the above question: We e
xplicitly construct a class of discrete distributions which\, under the de
cisional Diffie-Hellman assumption\, is provably not efficiently learnable
by a classical generative modelling algorithm\, but for which we construc
t an efficient quantum learner.\nFrom a bird's eye perspective\, our proof
leverages the power of quantum computers to solve the hidden subgroup pro
blem to a distribution learning setting. But we will also take on the mole
's perspective and work through an intricate cryptographic argument that p
roves the (conditional) learning separation.\n\nHosted by Márika Kieferov
á\, UTS Centre for Quantum Software and Information\n
LOCATION:https://stable.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:20260404T094832Z
UID:UTSQSI/18
DESCRIPTION:Title: Coherent electrical control of a high spin nucleus in silicon\n
by Vincent Mourik (Fundamental Quantum Technologies Laboratory & Centre fo
r Quantum Computation and Communication Technology\, UNSW\, Sydney) as par
t of Centre for Quantum Software and Information Seminar Series\n\n\nAbstr
act\nNuclear electric resonance (NER) enables transitions of a high spin n
ucleus by modulating its electrical quadrupole interaction with an electri
c field. In this talk I will show how we found this effect in our single 1
23-Sb donor device in silicon\, with a nuclear spin of size 7/2. We demons
trate\, for the first time\, coherent\, purely electrical control of a sin
gle high spin nucleus. I will share our theoretical understanding of the m
icroscopic mechanism at play in our device. Finally\, I will discuss futur
e research directions exploiting this versatile system.\n\nHOSTED BY: Dr J
P Dehollain\, UTS Centre for Quantum Software and Information.\n
LOCATION:https://stable.researchseminars.org/talk/UTSQSI/18/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Benjamin Huard (ENS Lyon)
DTSTART:20201003T060000Z
DTEND:20201003T070000Z
DTSTAMP:20260404T094832Z
UID:UTSQSI/19
DESCRIPTION:Title: Measuring the number of photons in a microwave mode\nby Benjami
n Huard (ENS Lyon) as part of Centre for Quantum Software and Information
Seminar Series\n\n\nAbstract\nCounting the number of photons in an electro
magnetic mode is an important tool for quantum information processing. In
order to perform a single shot measurement\, one usually encodes informati
on about the photon number into a qubit state and read out the qubit. Repe
ating this procedure while varying the encoded single bit of information e
nables to pinpoint the number of photons. In this talk\, I will present tw
o experiments that address two main challenges in photocounting. \n\nFirst
\, I will show how one can avoid the sequential repetition of qubit measur
ements and instead use a single superconducting qubit in order to multiple
x the measurement of the photon number in a stationary microwave mode.\n\n
Second\, I will show how we could convert a stationary mode counter into a
photocounter of traveling wave packets using a quantum memory.\n\nHosted
by Nathan Langford\, UTS Centre for Quantum Software and Information\n
LOCATION:https://stable.researchseminars.org/talk/UTSQSI/19/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Kaumudibikash Goswami (University of Queensland)
DTSTART:20201013T000000Z
DTEND:20201013T010000Z
DTSTAMP:20260404T094832Z
UID:UTSQSI/20
DESCRIPTION:Title: Indefinite causal order\nby Kaumudibikash Goswami (University o
f Queensland) as part of Centre for Quantum Software and Information Semin
ar Series\n\n\nAbstract\nIn our daily life\, we experience a fixed order o
f events. The notion of such a fixed causal order breaks down when we ente
r the quantum regime. In the quantum realm\, it is possible to have situat
ions where no definite causal structure can be attributed. Apart from the
foundational aspect\, such exotic causal structures are useful to achieve
augmented communication.\n\nIn the first two parts of this talk\, I will p
resent our experimental realisation of an indefinitely causal ordered scen
ario and demonstrate how one can achieve a communication advantage out of
it. In the last part\, I will discuss how one can attribute several inform
ation-theoretic aspects to an arbitrary causal structure. In that part\, I
will define a notion of classical capacity for an indefinite causal order
\, and present several information-theoretic bounds obtained from our stud
y.\n
LOCATION:https://stable.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:20260404T094832Z
UID:UTSQSI/21
DESCRIPTION:Title: A four-qubit germanium quantum processor\nby Menno Veldhorst (Q
uTech and Kavli Institute of Nanoscience Delft University of Techology\, T
he Netherlands) as part of Centre for Quantum Software and Information Sem
inar Series\n\n\nAbstract\nThe prospect of building quantum circuits using
advanced semiconductor manufacturing positions quantum dots as an attract
ive platform for quantum information processing. Extensive studies on vari
ous materials have led to demonstrations of two-qubit logic in gallium ars
enide\, silicon\, and germanium. However\, interconnecting larger numbers
of qubits in semiconductor devices has remained an outstanding challenge.
Here\, we demonstrate a four-qubit quantum processor based on hole spins i
n germanium quantum dots. Furthermore\, we define the quantum dots in a tw
o-by-two array and obtain controllable coupling along both directions. Qub
it logic is implemented all-electrically and the exchange interaction can
be pulsed to freely program one-qubit\, two-qubit\, three-qubit\, and four
-qubit operations\, resulting in a compact and high-connectivity circuit.
We execute a quantum logic circuit that generates a four-qubit Greenberger
-Horne-Zeilinger state and we obtain coherent evolution by incorporating d
ynamical decoupling. These results are an important step towards quantum e
rror correction and quantum simulation with quantum dots.\n\nHosted by JP
Dehollain\, UTS Centre for Quantum Software and Information\n
LOCATION:https://stable.researchseminars.org/talk/UTSQSI/21/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Pedro Costa (Macquarie University\, Sydney\, Australia)
DTSTART:20210429T030000Z
DTEND:20210429T040000Z
DTSTAMP:20260404T094832Z
UID:UTSQSI/22
DESCRIPTION:Title: Quantum-to-Classical transition via Quantum Cellular Automata\n
by Pedro Costa (Macquarie University\, Sydney\, Australia) as part of Cent
re for Quantum Software and Information Seminar Series\n\n\nAbstract\nA qu
antum cellular automaton (QCA) is an abstract model consisting of an array
of finite-dimensional quantum systems that evolves in discrete time by lo
cal unitary operations. Here we propose a simple coarse-graining map\, whe
re the spatial structure of the QCA is merged into effective ones. Startin
g with a QCA that simulates the Dirac equation we apply this coarse-graini
ng map recursively until we get its effective dynamics in the semi-classic
al limit\, which can be described by a classical cellular automaton. We sh
ow that the emergent-effective result of the former microscopic discrete m
odel converges to the diffusion equation and to a classical transport equa
tion under a specific initial condition. Therefore\, QCA is a good model t
o validate the quantum-to-classical transition.\n\nPlease email cqsiadmin@
uts.edu.au to request the zoom link. Include your company/organisation's e
mail and your Zoom account name in your request.\n
LOCATION:https://stable.researchseminars.org/talk/UTSQSI/22/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Martin Plávala (Universität Siegen)
DTSTART:20210513T060000Z
DTEND:20210513T070000Z
DTSTAMP:20260404T094832Z
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 Softw
are and Information Seminar Series\n\n\nAbstract\nGiven two quantum channe
ls\, we examine the task of determining whether they are compatible - mean
ing that one can perform both channels simultaneously but\, in the future\
, choose exactly one channel whose output is desired (while forfeiting the
output of the other channel). We show several results concerning this tas
k. First\, we show it is equivalent to the quantum state marginal problem\
, i.e.\, every quantum state marginal problem can be recast as the compati
bility of two channels\, and vice versa. Second\, we show that compatible
measure-and-prepare channels (i.e.\, entanglement-breaking channels) do no
t necessarily have a measure-and-prepare compatibilizing (i.e.\, joint) ch
annel. Third\, we extend the notion of the Jordan product of matrices to q
uantum channels and present sufficient conditions for channel compatibilit
y. Last\, we formulate the different notions of compatibility as semidefin
ite programs and numerically test when families of partially dephasing-dep
olarizing channels are compatible and when the Jordan product of channels
gives a valid compatibilizing channel.\n\nTo request the zoom link\, pleas
e send a message cqsiadmin@uts.edu.au using your business email address.\n
Watch previous seminars: https://www.youtube.com/c/UTSQuantum.\n
LOCATION:https://stable.researchseminars.org/talk/UTSQSI/23/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Richard Kueng (Johannes Kepler University Linz)
DTSTART:20210527T060000Z
DTEND:20210527T070000Z
DTSTAMP:20260404T094832Z
UID:UTSQSI/24
DESCRIPTION:Title: The classical shadow formalism and (some) implications for quantum
machine learning\nby Richard Kueng (Johannes Kepler University Linz) a
s part of Centre for Quantum Software and Information Seminar Series\n\n\n
Abstract\nExtracting important information from a quantum system as effici
ently and tractably as possible is an important subroutine in most near-te
rm applications of quantum hardware.\nWe present an efficient method for c
onstructing an approximate classical description of a quantum state using
very few measurements of the state. This description\, called a classical
shadow\, can be used to predict many different properties. The required nu
mber of measurements is independent of the system size and saturates infor
mation-theoretic lower bounds.\nIf time permits\, I will also illustrate h
ow one can combine classical shadows with machine learning (ML). This comb
ination showcases that training data obtained from quantum experiments can
be very empowering for classical ML methods. \n\nThis is joint work with
Robert Huang and John Preskill (both Caltech).\n\nTo request the zoom link
\, please send a message cqsiadmin@uts.edu.au using your institution/organ
isation/business email address.\n\nHOSTED BY: Dr Mária Kieferová\, Centr
e for Quantum Software and Information\, University of Technology Sydney\,
Australia\n
LOCATION:https://stable.researchseminars.org/talk/UTSQSI/24/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Anurag Anshu (University of California\, Berkeley)
DTSTART:20210610T003000Z
DTEND:20210610T013000Z
DTSTAMP:20260404T094832Z
UID:UTSQSI/25
DESCRIPTION:Title: An area law for 2D frustration-free spin systems\nby Anurag Ans
hu (University of California\, Berkeley) as part of Centre for Quantum Sof
tware and Information Seminar Series\n\n\nAbstract\nWe prove that the enta
nglement entropy of the ground state of a locally gapped frustration-free
2D lattice spin system satisfies an area law with respect to a vertical bi
partition of the lattice into left and right regions. We first establish t
hat the ground state projector of any locally gapped frustration-free 1D s
pin system 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 on the approximate degree of the boolean AND function\, which corre
sponds to the special case of commuting Hamiltonian terms. For 2D spin sys
tems we then construct an approximate ground state projector (AGSP) that e
mploys the optimal 1D approximation in the vicinity of the boundary of the
bipartition of interest. This AGSP has sufficiently low entanglement and
error to establish the area law using a known technique.\n\nJoint work wit
h Itai Arad and David Gosset. arXiv: 2103.02492 (https://arxiv.org/abs/210
3.02492)\n\nTo request the zoom link\, please send a message cqsiadmin@uts
.edu.au using your business/organisation/institution email address.\nHoste
d by Associate Professor Troy Lee\, Centre for Quantum Software and Inform
ation\, University of Technology Sydney\n
LOCATION:https://stable.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:20260404T094832Z
UID:UTSQSI/26
DESCRIPTION:Title: A Tensor Network based Decision Diagram for Representation of Quant
um Circuits\nby Xin Hong (Centre for Quantum Software and Information\
, University of Technology Sydney) as part of Centre for Quantum Software
and Information Seminar Series\n\n\nAbstract\nTensor networks have been su
ccessfully applied in the simulation of quantum physical systems for decad
es. Recently\, they have also been employed in classical simulation of qua
ntum computing\, in particular\, random quantum circuits.\n\nIn this talk\
, I will introduce a decision-diagram style data structure\, called TDD (T
ensor Decision Diagram)\, for more principled and convenient applications
of tensor networks. This new data structure provides a compact and canon
ical representation for quantum circuits. By exploiting techniques for ten
sor networks\, the TDD of a quantum circuit can be computed efficiently.\n
\nFurthermore\, we show that the operations of tensor networks essential i
n their applications (e.g.\, addition and contraction)\, can also be impl
emented efficiently in TDD. It is expected that TDDs will play an importa
nt role in various design automation tasks related to quantum circuits\, i
ncluding but not limited to equivalence checking\, error detection\, synth
esis\, simulation\, and verification. As an example\, I will also introduc
e the use of TDD in the approximate equivalence checking of noisy quantum
circuits.\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://stable.researchseminars.org/talk/UTSQSI/26/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Yihui Quek (Stanford University)
DTSTART:20210708T010000Z
DTEND:20210708T020000Z
DTSTAMP:20260404T094832Z
UID:UTSQSI/27
DESCRIPTION:Title: Introduction to Quantum Singular Value Transform with applications
to Petz map\, Polar decomposition and Pretty-Good Measurements\nby Yih
ui Quek (Stanford University) as part of Centre for Quantum Software and I
nformation Seminar Series\n\n\nAbstract\nThe recently-introduced quantum a
lgorithmic technique of quantum singular value transform (QSVT) has been h
ailed as a `grand unification of quantum algorithms’.\n\nIn this talk\,
we give a pedagogical introduction to this toolbox\, and illustrate its fl
exibility and precision by using it to implement tools in quantum linear a
lgebra\, quantum noise recovery and optimal quantum measurements: i) the q
uantum polar decomposition ii) the Petz recovery channel iii) pretty-good
measurements. Previously\, a significant hurdle to the experimental realiz
ation of these vaunted theoretical tools was the lack of a systematic and
efficient method to implement them\; we rectify this lack by proposing qua
ntum algorithms for all three tools based on QSVT.\n\nThis talk is based o
n arXiv:2006.16924 and arXiv:2106.07634.\n\nTo request the zoom link\, ple
ase send a message cqsiadmin@uts.edu.au using your business/organisation/i
nstitution email address.\n\nSEMINAR HOSTED BY: Dr Mária Kieferová\, Cen
tre for Quantum Software and Information\, University of Technology Sydney
\, Australia\n
LOCATION:https://stable.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:20260404T094832Z
UID:UTSQSI/30
DESCRIPTION:Title: Parallel Quantum Algorithm for Hamiltonian Simulation\nby Zhich
eng Zhang (University of Chinese Academy of Sciences\, Beijing) as part of
Centre for Quantum Software and Information Seminar Series\n\n\nAbstract\
nWe study how parallelism can speed up quantum simulation. A parallel quan
tum algorithm is proposed for simulating the dynamics of a large class of
Hamiltonians with good sparse structures\, called uniform-structured Hamil
tonians\, including various Hamiltonians of practical interest like local
Hamiltonians and Pauli sums.\nGiven the oracle access to the target sparse
Hamiltonian\, in both query and gate complexity\, the running time of our
parallel quantum simulation algorithm measured by the quantum circuit dep
th has a doubly (poly-)logarithmic dependence polylog log(1/є) on the sim
ulation precision є. This presents an exponential improvement over the de
pendence polylog(1/є) of previous optimal sparse Hamiltonian simulation a
lgorithm without parallelism. To obtain this result\, we introduce a novel
notion of parallel quantum walk\, based on Childs’ quantum walk. The ta
rget evolution unitary is approximated by a truncated Taylor series\, whic
h is obtained by combining these quantum walks in a parallel way. A lower
bound Ω(log log(1/є)) is established\, showing that the є-dependence o
f the gate depth achieved in this work cannot be significantly improved.\n
Our algorithm is applied to simulating three physical models: the Heisenbe
rg model\, the Sachdev-Ye-Kitaev model and a quantum chemistry model in se
cond quantization. By explicitly calculating the gate complexity for imple
menting the oracles\, we show that on all these models\, the total gate de
pth of our algorithm has a polylog log(1/є) dependence in the parallel se
tting.\n\nOnline Seminar. To request the zoom link\, please send a message
cqsiadmin@uts.edu.au using your business/organisation/institution email a
ddress. \nSeminar Webpage: https://www.uts.edu.au/research/centre-quantum-
software-and-information/events/qsi-seminar-zhicheng-zhang-ucas-beijing\n
LOCATION:https://stable.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:20260404T094832Z
UID:UTSQSI/33
DESCRIPTION:Title: Sub-wavelength quantum imaging for astronomy and LIDAR detection\nby Zixin Huang (MQ Center for Quantum Engineering\, Macquarie Universit
y\, Sydney\, Australia) as part of Centre for Quantum Software and Informa
tion Seminar Series\n\n\nAbstract\nThe resolution limit of standard imagin
g techniques is expressed by the Rayleigh criterion\, which states that tw
o point-like sources are difficult to resolve if their transverse separati
on is smaller than the Rayleigh length. While the criterion is useful in t
he case of direct detection imaging\, other measurement techniques may not
be subject to this limitation. Here we consider the use of imaging to est
imate the distance between an arbitrary number of incoherent point sources
. In the regime of weak signals\, a structured measurement obtained by con
catenating a linear interferometer with on-off photo-detection is immune t
o the Rayleigh curse. In this way\, we clarify the relationship between im
aging and interferometry\, and establish the optimality of linear interfer
ometry for an arbitrary number of incoherent sources. We apply these techn
iques to LIDAR detection as well as exoplanet detection\, finding optimal
measurements for both these tasks.\n\nHOSTED BY: Dr Peter Rohde\, Centre f
or Quantum Software and Information\, University of Technology Sydney\n\nT
o request the zoom link\, please send a message cqsiadmin@uts.edu.au using
your business/organisation/institution email address.\n
LOCATION:https://stable.researchseminars.org/talk/UTSQSI/33/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Kamil Korzekwa (Jagiellonian University)
DTSTART:20210930T060000Z
DTEND:20210930T070000Z
DTSTAMP:20260404T094832Z
UID:UTSQSI/34
DESCRIPTION:Title: Fundamental Constraints of Quantum Thermodynamics in the Markovian
Regime\nby Kamil Korzekwa (Jagiellonian University) as part of Centre
for Quantum Software and Information Seminar Series\n\n\nAbstract\nTypical
microscopic derivations of the dynamics of a finite-dimensional quantum s
ystem interacting with a large thermal bath lead to a master equation with
a covariant Lindbladian that obeys the second law of thermodynamics.\n\nI
n this talk I will present the fundamental constraints on population dynam
ics generated by all such Markovian thermal processes based on a newly int
roduced concept of continuous thermo-majorisation. More precisely\, given
the initial population of the system in the energy eigenbasis\, I will sta
te the necessary and sufficient conditions for the existence of a Markovia
n thermal process that transforms the system into a state with a given fin
al population. This will provide an exhaustive H-type theorem in terms of
a continuous family of entropic functions that need to monotonically incre
ase during the dynamics.\n\nI will also present an algorithm that in a fin
ite number of steps allows one to construct the full cone of population ve
ctors achievable from a given initial state. Moreover\, I will demonstrate
that all such vectors can be obtained from the initial state by a univers
al set of elementary thermal controls given by two-level partial thermalis
ations. Finally\, I will employ these results to investigate optimal work
extraction and cooling processes\, illustrating the role that memory effec
ts play in thermodynamic protocols.\n\nTo request the zoom link\, please s
end a message cqsiadmin@uts.edu.au using your business/organisation/instit
ution email address.\n
LOCATION:https://stable.researchseminars.org/talk/UTSQSI/34/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Kunal Sharma (University of Maryland)
DTSTART:20211014T000000Z
DTEND:20211014T010000Z
DTSTAMP:20260404T094832Z
UID:UTSQSI/35
DESCRIPTION:Title: Trainability of Parameterized Quantum Circuits\nby Kunal Sharma
(University of Maryland) as part of Centre for Quantum Software and Infor
mation Seminar Series\n\n\nAbstract\nVariational quantum algorithms (VQAs)
and Quantum Neural Networks (QNNs) have emerged as promising strategies t
o achieve quantum advantage on near-term quantum devices. The success of V
QAs/QNNs depends on several factors\, including the trainability and expre
ssibility of parameterized quantum circuits (PQCs). Along with numerical e
xperiments\, rigorous analytical results are necessary to guarantee the sc
alability of these algorithms.\nIn this seminar\, I will first summarize w
ell-known results on barren plateaus\, where certain circumstances lead to
exponentially vanishing gradients. Then I will present our recent results
establishing a fundamental relationship between expressibility and traina
bility of PQCs. Next\, I will outline our analysis on the trainability of
perceptron-based QNNs. One common assumption to avoid barren plateaus is
to employ problem-inspired PQCs. I will present that for problem-inspired
PQCs\, such as Quantum Alternating Operator Ansatz (QAOA) and Hamiltonian
Variational Ansatz (HVA)\, trainability depends on the controllability of
the system and is not always guaranteed. Finally\, I will describe the eff
ect of hardware noise on the training landscape for a generic PQC and summ
arize potential strategies to avoid trainability issues.\n\nTo request the
zoom link\, please send a message cqsiadmin@uts.edu.au using your busines
s/organisation/institution email address.\n
LOCATION:https://stable.researchseminars.org/talk/UTSQSI/35/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Anirudh Krishna (Stanford University)
DTSTART:20211028T000000Z
DTEND:20211028T010000Z
DTSTAMP:20260404T094832Z
UID:UTSQSI/36
DESCRIPTION:Title: Abstract and physical constraints on quantum LDPC codes\nby Ani
rudh Krishna (Stanford University) as part of Centre for Quantum Software
and Information Seminar Series\n\n\nAbstract\nDATE: 28 October\, 2021\nTIM
E: 11:00 am – 12:00 pm AEDT (Local Sydney time)\nTITLE: Abstract and phy
sical constraints on quantum LDPC codes\nTOPIC: Quantum error correction\n
\nSPEAKER: Dr Anirudh Krishna\nAFFILIATION: Stanford University\, Californ
ia\, USA\n\nABSTRACT:\nSeminal results by Bravyi\, Poulin and Terhal have
shown that quantum codes are limited by locality. As a consequence\, all t
opological codes witness sharp tradeoffs between their rate and distance.
Quantum LDPC codes can be viewed as a generalization of topological codes
constructed using spatially-nonlocal connections. It is unclear what\, if
any\, fundamental constraints these codes obey. The state-of-the-art code
parameters are far from what their classical counterparts can achieve. We
explore this question and present no-go results that shed some light on wh
at is not possible.\n\nWe approach this question in two ways\, using abstr
act and physical constraints. First\, we use a graph-theoretic representat
ion of a quantum code to show that the connectivity of this representation
allows us to understand limitations of the associated code. We obtain gen
eralizations of the Bravyi-Poulin-Terhal and Bravyi-Koenig bounds. We then
study the complementary problem of embedding a code in D Euclidean dimens
ions. We ask how many long-range interactions we need to obtain a target c
ode dimension k and distance d. Focusing on 2 dimensions (and ignoring pol
ylogarthmic corrections)\, we find that a code with distance d requires Ω
(d) interactions of length Ω(d/√n). Furthermore\, a constant-rate code
distance d requires Ω(n) interactions of length Ω(√d).\n\nThis is join
t 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/2109.10982)\n\nTo request the zoom link\, please send a message cqsia
dmin@uts.edu.au using your business/organisation/institution email address
.\n
LOCATION:https://stable.researchseminars.org/talk/UTSQSI/36/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Elija Perrier (UTS Centre for Quantum Software and Information)
DTSTART:20211125T000000Z
DTEND:20211125T010000Z
DTSTAMP:20260404T094832Z
UID:UTSQSI/37
DESCRIPTION:Title: Quantum Ethics\nby Elija Perrier (UTS Centre for Quantum Softwa
re and Information) as part of Centre for Quantum Software and Information
Seminar Series\n\n\nAbstract\nQuantum computing is among the most signifi
cant technologies to emerge in recent decades\, offering the promise of pa
radigm-shifting computational capacity with significant ethical consequenc
es. On a technical level\, the unique features of quantum computation have
consequences for the imposition of fairness and ethical constraints on co
mputation. Despite its significance\, little if no structured research has
been undertaken into the ethical implications of quantum technologies.\n\
nIn this paper\, we fill this gap in the literature by presenting a roadma
p for ethical quantum computing setting out prospective research programme
s. We situate quantum ethics at the cross-disciplinary intersection of qua
ntum information science\, technology ethics and moral philosophy. We summ
arise the key elements of quantum information processing relevant to ethic
al analysis and set-out taxonomies for use by researchers considering the
ethics of quantum technologies. In doing so\, we inaugurate the cross-disc
iplinary field of the ethics of quantum computing.\n\nHOSTED BY: Associate
Professor Chris Ferrie\, Centre for Quantum Software and Information\, Un
iversity of Technology Sydney\, Australia\n
LOCATION:https://stable.researchseminars.org/talk/UTSQSI/37/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Stefano Pirandola (nodeQ & UY (UK))
DTSTART:20211208T220000Z
DTEND:20211208T230000Z
DTSTAMP:20260404T094832Z
UID:UTSQSI/38
DESCRIPTION:Title: Quantum communications over the quantum internet\nby Stefano Pi
randola (nodeQ & UY (UK)) as part of Centre for Quantum Software and Infor
mation Seminar Series\n\n\nAbstract\nABSTRACT: After reviewing the buildi
ng blocks of the future quantum internet\, I will discuss some of the key
challenges to address for ensuring quantum-security in near-term network c
ommunications. In this context\, I will review some of the fundamental tra
de-offs and limitations to consider in the optimization of both point-to-p
oint and end-to-end quantum communications.\n\nTo request the zoom link\,
please send a message cqsiadmin@uts.edu.au using your business/organisatio
n/institution email address. \nHOSTED BY: Dr Simon Devitt\, Centre for Qua
ntum Software and Information\, University of Technology Sydney\, Australi
a\n
LOCATION:https://stable.researchseminars.org/talk/UTSQSI/38/
END:VEVENT
END:VCALENDAR