-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathPolloreno_papers.html
318 lines (289 loc) · 18.3 KB
/
Polloreno_papers.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>ArXiv Papers</title>
<script type="text/javascript" id="MathJax-script" async
src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-mml-chtml.js">
</script>
<style>
body {
font-family: Arial, sans-serif;
margin: 0;
padding: 0;
background-color: #f0f0f0;
}
.header {
text-align: center;
padding: 20px;
}
.header img {
width: 150px;
height: 150px;
border-radius: 50%;
}
.header h1 {
margin-top: 10px;
margin-bottom: 0;
}
.header p {
margin-top: 0;
}
.nav {
text-align: center;
background-color: #333;
padding: 10px;
}
.nav a {
color: #fff;
text-decoration: none;
padding: 0 10px;
}
.nav a:hover {
text-decoration: underline;
}
.container {
padding: 20px;
max-width: 800px;
margin: 0 auto;
background-color: #fff;
}
.paper {
margin-bottom: 20px;
}
.paper h3 {
margin-top: 0;
}
.paper a {
text-decoration: none;
color: #1a0dab;
}
.paper a:hover {
text-decoration: underline;
}
</style>
</head>
<body>
<div class="header">
<img src="headshot.jpg" alt="Your headshot">
<h1>Your Name</h1>
<p>A summary of your career trajectory, and what you're interested in.</p>
</div>
<div class="nav">
<a href="https://twitter.com/yourusername" target="_blank">Twitter</a> |
<a href="https://www.linkedin.com/in/yourusername/" target="_blank">LinkedIn</a> |
<a href="https://github.com/yourusername" target="_blank">GitHub</a> |
<a href="your-cv.pdf" target="_blank">CV</a>
</div>
<div class="container" id="papersContainer">
<div class="paper">
<h3><a href="http://arxiv.org/abs/2001.02779v2" target="_blank">Robustly decorrelating errors with mixed quantum gates</a></h3>
<p><strong>Authors:</strong> Anthony M. Polloreno, Kevin C. Young</p>
<p>Coherent errors in quantum operations are ubiquitous. Whether arising from
spurious environmental couplings or errors in control fields, such errors can
accumulate rapidly and degrade the performance of a quantum circuit
significantly more than an average gate fidelity may indicate. As Hastings [1]
and Campbell [2] have recently shown, by replacing the deterministic
implementation of a quantum gate with a randomized ensemble of implementations,
on can dramatically suppress coherent errors. Our work begins by reformulating
the results of Hastings and Campbell as a quantum optimal control problem. We
then discuss a family of convex programs designed to improve the performance,
implementability, and robustness of the resulting mixed quantum gates. Finally,
we implement these mixed quantum gates on a superconducting qubit and discuss
randomized benchmarking results consistent with a marked reduction in the
coherent error.
[1] M. B. Hastings, Quantum Information & Computation 17, 488 (2017).
[2] E. Campbell, Physical Review A 95, 042306 (2017).</p>
</div>
<div class="paper">
<h3><a href="http://arxiv.org/abs/2108.02079v1" target="_blank">Towards Demonstrating Fault Tolerance in Small Circuits Using Bacon-Shor
Codes</a></h3>
<p><strong>Authors:</strong> Ariel Shlosberg, Anthony M. Polloreno, Graeme Smith</p>
<p>Quantum error correction is necessary to perform large-scale quantum
computations in the presence of noise and decoherence. As a result, several
aspects of quantum error correction have already been explored. These have been
primarily studies of quantum memory[1, 2], an important first step towards
quantum computation, where the objective is to increase the lifetime of the
encoded quantum information. Additionally, several works have explored the
implementation of logical gates[3-5]. In this work we study a next step -
fault-tolerantly implementing quantum circuits. We choose the \([[4, 1, 2]]\)
Bacon-Shor subsystem code, which has a particularly simple error-detection
circuit. Through both numerics and site-counting arguments, we compute
pseudo-thresholds for the Pauli error rate \(p\) in a depolarizing noise model,
below which the encoded circuits outperform the unencoded circuits. These
pseudo-threshold values are shown to be as high as \(p=3\%\) for short circuits,
and \(p=0.6\%\) for circuits of moderate depth. Additionally, we see that
multiple rounds of stabilizer measurements give an improvement over performing
a single round at the end. This provides a concrete suggestion for a
small-scale fault-tolerant demonstration of a quantum algorithm that could be
accessible with existing hardware.</p>
</div>
<div class="paper">
<h3><a href="http://arxiv.org/abs/2205.06845v4" target="_blank">The QAOA with Slow Measurements</a></h3>
<p><strong>Authors:</strong> Anthony M. Polloreno, Graeme Smith</p>
<p>The Quantum Approximate Optimization Algorithm (QAOA) was originally
developed to solve combinatorial optimization problems, but has become a
standard for assessing the performance of quantum computers. Fully descriptive
benchmarking techniques are often prohibitively expensive for large numbers of
qubits (\(n \gtrsim 10\)), so the QAOA often serves in practice as a
computational benchmark. The QAOA involves a classical optimization subroutine
that attempts to find optimal parameters for a quantum subroutine.
Unfortunately, many optimizers used for the QAOA require many shots ($N \gtrsim
1000$) per point in parameter space to get a reliable estimate of the energy
being minimized. However, some experimental quantum computing platforms such as
neutral atom quantum computers have slow repetition rates, placing unique
requirements on the classical optimization subroutine used in the QAOA in these
systems. In this paper we investigate the performance of a gradient free
classical optimizer for the QAOA - dual annealing - and demonstrate that
optimization is possible even with \(N=1\) and \(n=16\).</p>
</div>
<div class="paper">
<h3><a href="http://arxiv.org/abs/2203.05196v2" target="_blank">Individual qubit addressing of rotating ion crystals in a Penning trap</a></h3>
<p><strong>Authors:</strong> Anthony M. Polloreno, Ana Maria Rey, John J. Bollinger</p>
<p>Trapped ions boast long coherence times and excellent gate fidelities, making
them a useful platform for quantum information processing. Scaling to larger
numbers of ion qubits in RF Paul traps demands great effort. Another technique
for trapping ions is via a Penning trap where a 2D crystal of hundreds of ions
is formed by controlling the rotation of the ions in the presence of a strong
magnetic field. However, the rotation of the ion crystal makes single ion
addressability a significant challenge. We propose a protocol that takes
advantage of a deformable mirror to introduce AC Stark shift patterns that are
static in the rotating frame of the crystal. Through numerical simulations we
validate the potential of this protocol to perform high-fidelity single-ion
gates in crystalline arrays of hundreds of ions.</p>
</div>
<div class="paper">
<h3><a href="http://arxiv.org/abs/2302.10862v1" target="_blank">A Note on Noisy Reservoir Computation</a></h3>
<p><strong>Authors:</strong> Anthony M. Polloreno, Reuben R. W. Wang, Nikolas A. Tezak</p>
<p>In this note we extend the definition of the Information Processing Capacity
(IPC) by Dambre et al [1] to include the effects of stochastic reservoir
dynamics. We quantify the degradation of the IPC in the presence of this noise.
[1] Dambre et al. Scientific Reports 2, 514, (2012)</p>
</div>
<div class="paper">
<h3><a href="http://arxiv.org/abs/2302.13853v1" target="_blank">A Theory of Direct Randomized Benchmarking</a></h3>
<p><strong>Authors:</strong> Anthony M. Polloreno, Arnaud Carignan-Dugas, Jordan Hines, Robin Blume-Kohout, Kevin Young, Timothy Proctor</p>
<p>Randomized benchmarking (RB) protocols are widely used to measure an average
error rate for a set of quantum logic gates. However, the standard version of
RB is limited because it only benchmarks a processor's native gates indirectly,
by using them in composite \(n\)-qubit Clifford gates. Standard RB's reliance on
\(n\)-qubit Clifford gates restricts it to the few-qubit regime, because the
fidelity of a typical composite \(n\)-qubit Clifford gate decreases rapidly with
increasing \(n\). Furthermore, although standard RB is often used to infer the
error rate of native gates, by rescaling standard RB's error per Clifford to an
error per native gate, this is an unreliable extrapolation. Direct RB is a
method that addresses these limitations of standard RB, by directly
benchmarking a customizable gate set, such as a processor's native gates. Here
we provide a detailed introduction to direct RB, we discuss how to design
direct RB experiments, and we present two complementary theories for direct RB.
The first of these theories uses the concept of error propagation or scrambling
in random circuits to show that direct RB is reliable for gates that experience
stochastic Pauli errors. We prove that the direct RB decay is a single
exponential, and that the decay rate is equal to the average infidelity of the
benchmarked gates, under broad circumstances. This theory shows that group
twirling is not required for reliable RB. Our second theory proves that direct
RB is reliable for gates that experience general gate-dependent Markovian
errors, using similar techniques to contemporary theories for standard RB. Our
two theories for direct RB have complementary regimes of applicability, and
they provide complementary perspectives on why direct RB works. Together these
theories provide comprehensive guarantees on the reliability of direct RB.</p>
</div>
<div class="paper">
<h3><a href="http://arxiv.org/abs/2203.05520v2" target="_blank">Opportunities and Limitations in Broadband Sensing</a></h3>
<p><strong>Authors:</strong> Anthony M. Polloreno, Jacob L. Beckey, Joshua Levin, Ariel Shlosberg, James K. Thompson, Michael Foss-Feig, David Hayes, Graeme Smith</p>
<p>We consider estimating the magnitude of a monochromatic AC signal that
couples to a two-level sensor. For any detection protocol, the precision
achieved depends on the signal's frequency and can be quantified by the quantum
Fisher information. To study limitations in broadband sensing, we introduce the
integrated quantum Fisher information and derive inequality bounds that embody
fundamental tradeoffs in any sensing protocol. These inequalities show that
sensitivity in one frequency range must come at a cost of reduced sensitivity
elsewhere. For many protocols, including those with small phase accumulation
and those consisting of \(\pi\)-pulses, we find the integrated Fisher information
scales linearly with \(T\). We also find protocols with substantial phase
accumulation can have integrated QFI that grows quadratically with \(T\), which
is optimal. These protocols may allow the very rapid detection of a signal with
unknown frequency over a very wide bandwidth.</p>
</div>
<div class="paper">
<h3><a href="http://arxiv.org/abs/1901.08035v3" target="_blank">Demonstration of a Parametrically-Activated Entangling Gate Protected
from Flux Noise</a></h3>
<p><strong>Authors:</strong> Sabrina S. Hong, Alexander T. Papageorge, Prasahnt Sivarajah, Genya Crossman, Nicolas Didier, Anthony M. Polloreno, Eyob A. Sete, Stefan W. Turkowski, Marcus P. da Silva, Blake R. Johnson</p>
<p>In state-of-the-art quantum computing platforms, including superconducting
qubits and trapped ions, imperfections in the 2-qubit entangling gates are the
dominant contributions of error to system-wide performance. Recently, a novel
2-qubit parametric gate was proposed and demonstrated with superconducting
transmon qubits. This gate is activated through RF modulation of the transmon
frequency and can be operated at an amplitude where the performance is
first-order insensitive to flux-noise. In this work we experimentally validate
the existence of this AC sweet spot and demonstrate its dependence on white
noise power from room temperature electronics. With these factors in place, we
measure coherence-limited entangling-gate fidelities as high as 99.2 \(\pm\)
0.15%.</p>
</div>
<div class="paper">
<h3><a href="http://arxiv.org/abs/1806.08321v2" target="_blank">Quantum Kitchen Sinks: An algorithm for machine learning on near-term
quantum computers</a></h3>
<p><strong>Authors:</strong> C. M. Wilson, J. S. Otterbach, N. Tezak, R. S. Smith, A. M. Polloreno, Peter J. Karalekas, S. Heidel, M. Sohaib Alam, G. E. Crooks, M. P. da Silva</p>
<p>Noisy intermediate-scale quantum computing devices are an exciting platform
for the exploration of the power of near-term quantum applications. Performing
nontrivial tasks in such devices requires a fundamentally different approach
than what would be used on an error-corrected quantum computer. One such
approach is to use hybrid algorithms, where problems are reduced to a
parameterized quantum circuit that is often optimized in a classical feedback
loop. Here we describe one such hybrid algorithm for machine learning tasks by
building upon the classical algorithm known as random kitchen sinks. Our
technique, called quantum kitchen sinks, uses quantum circuits to nonlinearly
transform classical inputs into features that can then be used in a number of
machine learning algorithms. We demonstrate the power and flexibility of this
proposal by using it to solve binary classification problems for synthetic
datasets as well as handwritten digits from the MNIST database. Using the
Rigetti quantum virtual machine, we show that small quantum circuits provide
significant performance lift over standard linear classical algorithms,
reducing classification error rates from 50% to \(<0.1\%\), and from \(4.1\%\) to
\(1.4\%\) in these two examples, respectively. Further, we are able to run the
MNIST classification problem, using full-sized MNIST images, on a Rigetti
quantum processing unit, finding a modest performance lift over the linear
baseline.</p>
</div>
<div class="paper">
<h3><a href="http://arxiv.org/abs/1706.06562v2" target="_blank">Parametrically Activated Entangling Gates Using Transmon Qubits</a></h3>
<p><strong>Authors:</strong> S. Caldwell, N. Didier, C. A. Ryan, E. A. Sete, A. Hudson, P. Karalekas, R. Manenti, M. Reagor, M. P. da Silva, R. Sinclair, E. Acala, N. Alidoust, J. Angeles, A. Bestwick, M. Block, B. Bloom, A. Bradley, C. Bui, L. Capelluto, R. Chilcott, J. Cordova, G. Crossman, M. Curtis, S. Deshpande, T. El Bouayadi, D. Girshovich, S. Hong, K. Kuang, M. Lenihan, T. Manning, A. Marchenkov, J. Marshall, R. Maydra, Y. Mohan, W. O'Brien, C. Osborn, J. Otterbach, A. Papageorge, J. -P. Paquette, M. Pelstring, A. Polloreno, G. Prawiroatmodjo, V. Rawat, R. Renzas, N. Rubin, D. Russell, M. Rust, D. Scarabelli, M. Scheer, M. Selvanayagam, R. Smith, A. Staley, M. Suska, N. Tezak, D. C. Thompson, T. -W. To, M. Vahidpour, N. Vodrahalli, T. Whyland, K. Yadav, W. Zeng, C. Rigetti</p>
<p>We describe and implement a family of entangling gates activated by
radio-frequency flux modulation applied to a tunable transmon that is
statically coupled to a neighboring transmon. The effect of this modulation is
the resonant exchange of photons directly between levels of the two-transmon
system, obviating the need for mediating qubits or resonator modes and allowing
for the full utilization of all qubits in a scalable architecture. The
resonance condition is selective in both the frequency and amplitude of
modulation and thus alleviates frequency crowding. We demonstrate the use of
three such resonances to produce entangling gates that enable universal quantum
computation: one iSWAP gate and two distinct controlled Z gates. We report
interleaved randomized benchmarking results indicating gate error rates of 6%
for the iSWAP (duration 135ns) and 9% for the controlled Z gates (durations 175
ns and 270 ns), limited largely by qubit coherence.</p>
</div>
<div class="paper">
<h3><a href="http://arxiv.org/abs/1706.06570v3" target="_blank">Demonstration of Universal Parametric Entangling Gates on a Multi-Qubit
Lattice</a></h3>
<p><strong>Authors:</strong> M. Reagor, C. B. Osborn, N. Tezak, A. Staley, G. Prawiroatmodjo, M. Scheer, N. Alidoust, E. A. Sete, N. Didier, M. P. da Silva, E. Acala, J. Angeles, A. Bestwick, M. Block, B. Bloom, A. Bradley, C. Bui, S. Caldwell, L. Capelluto, R. Chilcott, J. Cordova, G. Crossman, M. Curtis, S. Deshpande, T. El Bouayadi, D. Girshovich, S. Hong, A. Hudson, P. Karalekas, K. Kuang, M. Lenihan, R. Manenti, T. Manning, J. Marshall, Y. Mohan, W. O'Brien, J. Otterbach, A. Papageorge, J. -P. Paquette, M. Pelstring, A. Polloreno, V. Rawat, C. A. Ryan, R. Renzas, N. Rubin, D. Russell, M. Rust, D. Scarabelli, M. Selvanayagam, R. Sinclair, R. Smith, M. Suska, T. -W. To, M. Vahidpour, N. Vodrahalli, T. Whyland, K. Yadav, W. Zeng, C. T. Rigetti</p>
<p>We show that parametric coupling techniques can be used to generate selective
entangling interactions for multi-qubit processors. By inducing coherent
population exchange between adjacent qubits under frequency modulation, we
implement a universal gateset for a linear array of four superconducting
qubits. An average process fidelity of \(\mathcal{F}=93\%\) is estimated for
three two-qubit gates via quantum process tomography. We establish the
suitability of these techniques for computation by preparing a four-qubit
maximally entangled state and comparing the estimated state fidelity against
the expected performance of the individual entangling gates. In addition, we
prepare an eight-qubit register in all possible bitstring permutations and
monitor the fidelity of a two-qubit gate across one pair of these qubits.
Across all such permutations, an average fidelity of \(\mathcal{F}=91.6\pm2.6\%\)
is observed. These results thus offer a path to a scalable architecture with
high selectivity and low crosstalk.</p>
</div>
</div>
</body>
</html>