Harriet Apel
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
Harriet Apel has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Toby Cubitt
Phasecraft Ltd
6 shared publications - Tamara Kohler
Instituto de Ciencias Matemáticas, Madrid, Spain
3 shared publications - David Pérez-García
Departamento de Análisis Matemático y Matemática Aplicada, Universidad Complutense de Madrid, Madrid, Spain
1 shared publication - Maite Arcos
Department of Physics and Astronomy University College London UK
1 shared publication - Nouédyn Baspin
School of Physics, University of Sydney, Sydney, NSW 2006, Australia
1 shared publication - Patrick Hayden
Department of Physics Stanford University
1 shared publication
Latest Publications
- Open Access
- 1 May 2025
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 134 (17) , 170602
Simulating Sparse Hamiltonians on 2D Lattices
Systems with sparse, yet long-range interactions, form a rich class capable of exhibiting various interesting physics, including good error correction. In this Letter we show how to simulate any sparse Pauli Hamiltonian with a 2D nearest neighbor Hamiltonian, using fewer resources than previous techniques. As an application we demonstrate how to simulate a good quantum code Hamiltonian, effectively approximating a [ [ N , Ω ( N ) , Ω ( N ) ] ] code in two dimensions. Published by the American Physical Society 2025
- 1 May 2025
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 134 (17) , 170602
Open AccessSimulating Sparse Hamiltonians on 2D Lattices
Systems with sparse, yet long-range interactions, form a rich class capable of exhibiting various interesting physics, including good error correction. In this Letter we show how to simulate any sparse Pauli Hamiltonian with a 2D nearest neighbor Hamiltonian, using fewer resources than previous techniques. As an application we demonstrate how to simulate a good quantum code Hamiltonian, effectively approximating a [ [ N , Ω ( N ) , Ω ( N ) ] ] code in two dimensions. Published by the American Physical Society 2025
- Open Access
Encodings of Observable Subalgebras
Simulating complex systems remains an ongoing challenge for classical computers, while being recognised as a task where a quantum computer has a natural advantage. In both digital and analogue quantum simulations the system description is first mapped onto qubits or the physical system of the analogue simulator by an encoding. Previously mathematical definitions and characterisations of encodings have focused on preserving the full physics of the system. In this work, we consider encodings that only preserve a subset of the observables of the system. We motivate that such encodings are best described as maps between formally real Jordan algebras describing the subset of observables. Our characterisation of encodings is general, but notably holds for maps between finite-dimensional and semisimple $C^{*}$-algebras. Fermionic encodings are a pertinent example where a mathematical characterisation was absent. Our work applies to encodings of the the full CAR algebra, but also to encodings of just the even parity sector, corresponding to the physically relevant fermionic operators.
Open AccessEncodings of Observable Subalgebras
Simulating complex systems remains an ongoing challenge for classical computers, while being recognised as a task where a quantum computer has a natural advantage. In both digital and analogue quantum simulations the system description is first mapped onto qubits or the physical system of the analogue simulator by an encoding. Previously mathematical definitions and characterisations of encodings have focused on preserving the full physics of the system. In this work, we consider encodings that only preserve a subset of the observables of the system. We motivate that such encodings are best described as maps between formally real Jordan algebras describing the subset of observables. Our characterisation of encodings is general, but notably holds for maps between finite-dimensional and semisimple $C^{*}$-algebras. Fermionic encodings are a pertinent example where a mathematical characterisation was absent. Our work applies to encodings of the the full CAR algebra, but also to encodings of just the even parity sector, corresponding to the physically relevant fermionic operators.
- Open Access
- 20 August 2024
- Published by Springer Nature in Journal of High Energy Physics
- Vol. 2024 (8) , 1-40
Security of quantum position-verification limits Hamiltonian simulation via holography
A bstract: We investigate the link between quantum position-verification (QPV) and holography established in [1] using holographic quantum error correcting codes as toy models. By inserting the “temporal” scaling of the AdS metric by hand via the bulk Hamiltonian interaction strength, we recover a toy model with consistent causality structure. This leads to an interesting implication between two topics in quantum information: if position-based verification is secure against attacks with small entanglement then there are new fundamental lower bounds for resources required for one Hamiltonian to simulate another.
- 20 August 2024
- Published by Springer Nature in Journal of High Energy Physics
- Vol. 2024 (8) , 1-40
Open AccessSecurity of quantum position-verification limits Hamiltonian simulation via holography
A bstract: We investigate the link between quantum position-verification (QPV) and holography established in [1] using holographic quantum error correcting codes as toy models. By inserting the “temporal” scaling of the AdS metric by hand via the bulk Hamiltonian interaction strength, we recover a toy model with consistent causality structure. This leads to an interesting implication between two topics in quantum information: if position-based verification is secure against attacks with small entanglement then there are new fundamental lower bounds for resources required for one Hamiltonian to simulate another.
- Open Access
A mathematical framework for quantum Hamiltonian simulation and duality
Analogue Hamiltonian simulation is a promising near-term application of quantum computing and has recently been put on a theoretical footing. In Hamiltonian simulation, a physical Hamiltonian is engineered to have identical physics to another - often very different - Hamiltonian. This is qualitatively similar to the notion of duality in physics, whereby two superficially different theories are mathematically equivalent in some precise sense. However, existing characterisations of Hamiltonian simulations are not sufficiently general to extend to all dualities in physics. In particular, they cannot encompass the important cases of strong/weak and high-temperature/low-temperature dualities. In this work, we give three physically motivated axiomatisations of duality, formulated respectively in terms of observables, partition functions and entropies. We prove that these axiomatisations are equivalent, and characterise the mathematical form that any duality satisfying these axioms must take. A building block in one of our results is a strengthening of earlier results on entropy-preserving maps to maps that are entropy-preserving up to an additive constant, which we prove decompose as a direct sum of unitary and anti-unitary components, which may be of independent mathematical interest.
Open AccessA mathematical framework for quantum Hamiltonian simulation and duality
Analogue Hamiltonian simulation is a promising near-term application of quantum computing and has recently been put on a theoretical footing. In Hamiltonian simulation, a physical Hamiltonian is engineered to have identical physics to another - often very different - Hamiltonian. This is qualitatively similar to the notion of duality in physics, whereby two superficially different theories are mathematically equivalent in some precise sense. However, existing characterisations of Hamiltonian simulations are not sufficiently general to extend to all dualities in physics. In particular, they cannot encompass the important cases of strong/weak and high-temperature/low-temperature dualities. In this work, we give three physically motivated axiomatisations of duality, formulated respectively in terms of observables, partition functions and entropies. We prove that these axiomatisations are equivalent, and characterise the mathematical form that any duality satisfying these axioms must take. A building block in one of our results is a strengthening of earlier results on entropy-preserving maps to maps that are entropy-preserving up to an additive constant, which we prove decompose as a direct sum of unitary and anti-unitary components, which may be of independent mathematical interest.
- Open Access
- 10 April 2024
- Published by Springer Nature in Annales Henri Poincare
- Vol. 26 (1) , 317-364
A Mathematical Framework for Quantum Hamiltonian Simulation and Duality
Analogue Hamiltonian simulation is a promising near-term application of quantum computing and has recently been put on a theoretical footing alongside experiencing wide-ranging experimental success. These ideas are closely related to the notion of duality in physics, whereby two superficially different theories are mathematically equivalent in some precise sense. However, existing characterisations of Hamiltonian simulations are not sufficiently general to extend to all dualities in physics. We give a generalised duality definition encompassing dualities transforming a strongly interacting system into a weak one and vice versa. We characterise the dual map on operators and states and prove equivalence ofduality formulated in terms of observables, partition functions and entropies. A building block is a strengthening of earlier results on entropy preserving maps—extensions of Wigner’s celebrated theorem- –to maps that are entropy preserving up to an additive constant. We show such maps decompose as a direct sum of unitary and antiunitary components conjugated by a further unitary, a result that may be of independent mathematical interest.
- 10 April 2024
- Published by Springer Nature in Annales Henri Poincare
- Vol. 26 (1) , 317-364
Open AccessA Mathematical Framework for Quantum Hamiltonian Simulation and Duality
Analogue Hamiltonian simulation is a promising near-term application of quantum computing and has recently been put on a theoretical footing alongside experiencing wide-ranging experimental success. These ideas are closely related to the notion of duality in physics, whereby two superficially different theories are mathematically equivalent in some precise sense. However, existing characterisations of Hamiltonian simulations are not sufficiently general to extend to all dualities in physics. We give a generalised duality definition encompassing dualities transforming a strongly interacting system into a weak one and vice versa. We characterise the dual map on operators and states and prove equivalence ofduality formulated in terms of observables, partition functions and entropies. A building block is a strengthening of earlier results on entropy preserving maps—extensions of Wigner’s celebrated theorem- –to maps that are entropy preserving up to an additive constant. We show such maps decompose as a direct sum of unitary and antiunitary components conjugated by a further unitary, a result that may be of independent mathematical interest.
- Open Access
Holographic duality between local Hamiltonians from random tensor networks
The AdS/CFT correspondence realises the holographic principle where information in the bulk of a space is encoded at its border. We are yet a long way from a full mathematical construction of AdS/CFT, but toy models in the form of holographic quantum error correcting codes (HQECC) have replicated some interesting features of the correspondence. In this work we construct new HQECCs built from random stabilizer tensors that describe a duality between models encompassing local Hamiltonians whilst exactly obeying the Ryu-Takayanagi entropy formula for all boundary regions. We also obtain complementary recovery of local bulk operators for any boundary bipartition. Existing HQECCs have been shown to exhibit these properties individually, whereas our mathematically rigorous toy models capture these features of AdS/CFT simultaneously, advancing further towards a complete construction of holographic duality.
Open AccessHolographic duality between local Hamiltonians from random tensor networks
The AdS/CFT correspondence realises the holographic principle where information in the bulk of a space is encoded at its border. We are yet a long way from a full mathematical construction of AdS/CFT, but toy models in the form of holographic quantum error correcting codes (HQECC) have replicated some interesting features of the correspondence. In this work we construct new HQECCs built from random stabilizer tensors that describe a duality between models encompassing local Hamiltonians whilst exactly obeying the Ryu-Takayanagi entropy formula for all boundary regions. We also obtain complementary recovery of local bulk operators for any boundary bipartition. Existing HQECCs have been shown to exhibit these properties individually, whereas our mathematically rigorous toy models capture these features of AdS/CFT simultaneously, advancing further towards a complete construction of holographic duality.
- Open Access
- 8 March 2022
- Published by Springer Nature in Journal of High Energy Physics
- Vol. 2022 (3) , 1-43
Holographic duality between local Hamiltonians from random tensor networks
- 8 March 2022
- Published by Springer Nature in Journal of High Energy Physics
- Vol. 2022 (3) , 1-43
Open AccessHolographic duality between local Hamiltonians from random tensor networks