Roy J. Garcia
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Roy J. Garcia has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Arthur Jaffe
Harvard University, Cambridge, USA
11 shared publications - Kaifeng Bu
The Ohio State University
11 shared publications - Liyuan Chen
Department of Physics Harvard University 02138 Cambridge Massachusetts USA
3 shared publications - Anton Marius Graf
Harvard University
2 shared publications - Chen Zhao
Department of Physics Harvard University 02138 Cambridge Massachusetts USA
2 shared publications - Dax Enshan Koh
Institute of High Performance Computing
2 shared publications
Latest Publications
- 8 December 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 112 (6)
Resource theory of nonrevivals with applications to quantum many-body scars
- 8 December 2025
- Published by American Physical Society (APS) in Physical Review A
- Vol. 112 (6)
Resource theory of nonrevivals with applications to quantum many-body scars
- Open Access
- 23 September 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (3)
Hardness of measuring magic resource
Quantum computers promise to solve computational problems significantly faster than classical computers. These “speedups” are achieved by utilizing a resource known as magic resource. Measuring the amount of magic resource used by a device allows us to quantify its potential computational power. Without this property, quantum computers are no faster than classical computers. Whether magic resource can be accurately measured on large-scale quantum computers has remained an open problem. To address this question, we introduce as a measure of magic resource and experimentally measure it on the IBM Eagle quantum processor. We show that sufficiently small quantities of magic resource can be measured efficiently. We also prove that measuring large (i.e., extensive) quantities of magic resource with our measure is intractable. Our results lead us to surmise that magic resource may be difficult to measure when a quantum computer provides a speedup. We find that one of the most sought-after properties in quantum computation is only partially accessible to experiments. We support our conclusions with both theoretical and experimental evidence. Our work illustrates the capabilities and limitations encountered when studying the power of quantum computers.
- 23 September 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (3)
Open AccessHardness of measuring magic resource
Quantum computers promise to solve computational problems significantly faster than classical computers. These “speedups” are achieved by utilizing a resource known as magic resource. Measuring the amount of magic resource used by a device allows us to quantify its potential computational power. Without this property, quantum computers are no faster than classical computers. Whether magic resource can be accurately measured on large-scale quantum computers has remained an open problem. To address this question, we introduce as a measure of magic resource and experimentally measure it on the IBM Eagle quantum processor. We show that sufficiently small quantities of magic resource can be measured efficiently. We also prove that measuring large (i.e., extensive) quantities of magic resource with our measure is intractable. Our results lead us to surmise that magic resource may be difficult to measure when a quantum computer provides a speedup. We find that one of the most sought-after properties in quantum computation is only partially accessible to experiments. We support our conclusions with both theoretical and experimental evidence. Our work illustrates the capabilities and limitations encountered when studying the power of quantum computers.
- Open Access
On the Hardness of Measuring Magic
Quantum computers promise to solve computational problems significantly faster than classical computers. These 'speed-ups' are achieved by utilizing a resource known as magic. Measuring the amount of magic used by a device allows us to quantify its potential computational power. Without this property, quantum computers are no faster than classical computers. Whether magic can be accurately measured on large-scale quantum computers has remained an open problem. To address this question, we introduce Pauli instability as a measure of magic and experimentally measure it on the IBM Eagle quantum processor. We prove that measuring large (i.e., extensive) quantities of magic is intractable. Our results suggest that one may only measure magic when a quantum computer does not provide a speed-up. We support our conclusions with both theoretical and experimental evidence. Our work illustrates the capabilities and limitations of quantum technology in measuring one of the most important resources in quantum computation.
Open AccessOn the Hardness of Measuring Magic
Quantum computers promise to solve computational problems significantly faster than classical computers. These 'speed-ups' are achieved by utilizing a resource known as magic. Measuring the amount of magic used by a device allows us to quantify its potential computational power. Without this property, quantum computers are no faster than classical computers. Whether magic can be accurately measured on large-scale quantum computers has remained an open problem. To address this question, we introduce Pauli instability as a measure of magic and experimentally measure it on the IBM Eagle quantum processor. We prove that measuring large (i.e., extensive) quantities of magic is intractable. Our results suggest that one may only measure magic when a quantum computer does not provide a speed-up. We support our conclusions with both theoretical and experimental evidence. Our work illustrates the capabilities and limitations of quantum technology in measuring one of the most important resources in quantum computation.
- 23 June 2024
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 405 (7) , 1-44
Complexity of Quantum Circuits via Sensitivity, Magic, and Coherence
- 23 June 2024
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 405 (7) , 1-44
Complexity of Quantum Circuits via Sensitivity, Magic, and Coherence
- 14 May 2024
- Published by American Physical Society (APS) in Physical Review B
- Vol. 109 (17)
Magic of random matrix product states
- 14 May 2024
- Published by American Physical Society (APS) in Physical Review B
- Vol. 109 (17)
Magic of random matrix product states
- Open Access
Magic of Random Matrix Product States
Magic, or nonstabilizerness, characterizes how far away a state is from the stabilizer states, making it an important resource in quantum computing, under the formalism of the Gotteman-Knill theorem. In this paper, we study the magic of the $1$-dimensional Random Matrix Product States (RMPSs) using the $L_{1}$-norm measure. We firstly relate the $L_{1}$-norm to the $L_{4}$-norm. We then employ a unitary $4$-design to map the $L_{4}$-norm to a $24$-component statistical physics model. By evaluating partition functions of the model, we obtain a lower bound on the expectation values of the $L_{1}$-norm. This bound grows exponentially with respect to the qudit number $n$, indicating that the $1$D RMPS is highly magical. Our numerical results confirm that the magic grows exponentially in the qubit case.Open AccessMagic of Random Matrix Product States
Magic, or nonstabilizerness, characterizes how far away a state is from the stabilizer states, making it an important resource in quantum computing, under the formalism of the Gotteman-Knill theorem. In this paper, we study the magic of the $1$-dimensional Random Matrix Product States (RMPSs) using the $L_{1}$-norm measure. We firstly relate the $L_{1}$-norm to the $L_{4}$-norm. We then employ a unitary $4$-design to map the $L_{4}$-norm to a $24$-component statistical physics model. By evaluating partition functions of the model, we obtain a lower bound on the expectation values of the $L_{1}$-norm. This bound grows exponentially with respect to the qudit number $n$, indicating that the $1$D RMPS is highly magical. Our numerical results confirm that the magic grows exponentially in the qubit case. - Open Access
Resource Theory of Non-Revivals with Applications to Quantum Many-Body Scars
The study of state revivals has a long history in dynamical systems. We introduce a resource theory to understand the use of state revivals in quantum physics, especially in quantum many-body scarred systems. In this theory, a state is said to contain no amount of resource if it experiences perfect revivals under some unitary evolution. All other states are said to be resourceful. We show that this resource bounds information scrambling. Furthermore, we show that quantum many-body scarred dynamics can produce revivals in the Hayden-Preskill decoding protocol and can also be used to recover damaged quantum information. Our theory establishes a framework to study information retrieval and its applications in quantum many-body physics.
Open AccessResource Theory of Non-Revivals with Applications to Quantum Many-Body Scars
The study of state revivals has a long history in dynamical systems. We introduce a resource theory to understand the use of state revivals in quantum physics, especially in quantum many-body scarred systems. In this theory, a state is said to contain no amount of resource if it experiences perfect revivals under some unitary evolution. All other states are said to be resourceful. We show that this resource bounds information scrambling. Furthermore, we show that quantum many-body scarred dynamics can produce revivals in the Hayden-Preskill decoding protocol and can also be used to recover damaged quantum information. Our theory establishes a framework to study information retrieval and its applications in quantum many-body physics.
- Open Access
- 8 January 2024
- Published by Springer Nature in npj Quantum Information
- Vol. 10 (1) , 1-7
Classical shadows with Pauli-invariant unitary ensembles
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.
- 8 January 2024
- Published by Springer Nature in npj Quantum Information
- Vol. 10 (1) , 1-7
Open AccessClassical shadows with Pauli-invariant unitary ensembles
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.
- Open Access
- 17 January 2023
- Published by Springer Nature in Journal of High Energy Physics
- Vol. 2023 (1) , 1-79
Barren plateaus from learning scramblers with local cost functions
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.
- 17 January 2023
- Published by Springer Nature in Journal of High Energy Physics
- Vol. 2023 (1) , 1-79
Open AccessBarren plateaus from learning scramblers with local cost functions
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.
- Open Access
Barren plateaus from learning scramblers with local cost functions
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.
Open AccessBarren plateaus from learning scramblers with local cost functions
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.