Roy J. Garcia

Roy J. Garcia

Auto-generated profile, based on publicly available information

Roy J. Garcia

Harvard University

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 August 2021 in Physical Review Research
Verified
Journal Article
Open access
PDF file
RGRoy J. Garcia
Roy J. Garcia
YZYou Zhou
You Zhou
AJArthur Jaffe
Arthur Jaffe
Quantum dynamics is of fundamental interest and has implications in quantum information processing. The four-point out-of-time-ordered correlator (OTOC) is traditionally used to quantify quantum information scrambling under many-body dynamics. Due to the OTOC's unusual time ordering, its measurement is challenging. We propose higher-point OTOCs to reveal early-time scrambling behavior, and present protocols to measure any higher-point OTOC using the shadow estimation method. The protocols circumvent the need for time-reversal evolution and ancillary control. They can be implemented in near-term quantum devices with single-qubit readout.

8 January 2024 in npj Quantum Information
Verified
Journal Article
Open access
PDF file
KBKaifeng Bu
Kaifeng Bu
DKDax Enshan Koh
Dax Enshan Koh
RGRoy J. Garcia
Roy J. Garcia
AJArthur Jaffe
Arthur Jaffe
Classical shadows provide a noise-resilient and sample-efficient method for learning quantum system properties, relying on a user-specified unitary ensemble. What is the weakest assumption on this ensemble that can still yield meaningful results? To address this, we focus on Pauli-invariant unitary ensembles—those invariant under multiplication by Pauli operators. For these ensembles, we present explicit formulas for the reconstruction map and sample complexity bounds and extend our results to the case when noise impacts the protocol implementation. Two applications are explored: one for locally scrambled unitary ensembles, where we present formulas for the reconstruction map and sample complexity bounds that circumvent the need to solve an exponential-sized linear system, and another for the classical shadows of quantum channels. Our results establish a unified framework for classical shadows with Pauli-invariant unitary ensembles, applicable to both noisy and noiseless scenarios for states and channels and primed for implementation on near-term quantum devices.

23 June 2024 in Communications in Mathematical Physics
Verified
Journal Article
Closed access
PDF file
KBKaifeng Bu
Kaifeng Bu
RGRoy J. Garcia
Roy J. Garcia
AJArthur Jaffe
Arthur Jaffe
DKDax Enshan Koh
Dax Enshan Koh
LLLu Li
Lu Li

14 May 2024 in Physical Review B
Verified
Journal Article
Closed access
LCLiyuan Chen
Liyuan Chen
RGRoy J. Garcia
Roy J. Garcia
KBKaifeng Bu
Kaifeng Bu
AJArthur Jaffe
Arthur Jaffe

17 January 2023 in Journal of High Energy Physics
Verified
Journal Article
Open access
PDF file
RGRoy J. Garcia
Roy J. Garcia
CZChen Zhao
Chen Zhao
KBKaifeng Bu
Kaifeng Bu
AJArthur Jaffe
Arthur Jaffe
The existence of barren plateaus has recently revealed new training challenges in quantum machine learning (QML). Uncovering the mechanisms behind barren plateaus is essential in understanding the scope of problems that QML can efficiently tackle. Barren plateaus have recently been shown to exist when learning global properties of random unitaries, which is relevant when learning black hole dynamics. Establishing whether local cost functions can circumvent these barren plateaus is pertinent if we hope to apply QML to quantum many-body systems. We prove a no-go theorem showing that local cost functions encounter barren plateaus in learning random unitary properties.

4 March 2022 in Journal of High Energy Physics
Verified
Journal Article
Open access
PDF file
RGRoy J. Garcia
Roy J. Garcia
KBKaifeng Bu
Kaifeng Bu
AJArthur Jaffe
Arthur Jaffe
We quantify the role of scrambling in quantum machine learning. We characterize a quantum neural network’s (QNNs) error in terms of the network’s scrambling properties via the out-of-time-ordered correlator (OTOC). A network can be trained by minimizing a loss function. We show that the loss function can be bounded by the OTOC. We prove that the gradient of the loss function can be bounded by the gradient of the OTOC. This demonstrates that the OTOC landscape regulates the trainability of a QNN. We show numerically that this landscape is flat for maximally scrambling QNNs, which can pose a challenge to training. Our results pave the way for the exploration of quantum chaos in quantum neural networks.