Charles D. Hill
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Charles D. Hill has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
- Lloyd C. L. Hollenberg
University of Melbourne
26 shared publications - Gregory A. L. White
Freie Universität Berlin
11 shared publications - Gary J. Mooney
University of Melbourne
8 shared publications - Kavan Modi
Singapore University of Technology and Design
6 shared publications - Martin E. Sevior
University of Melbourne
4 shared publications - Aidan Dang
Centre for Quantum Computation and Communication Technology, School of Physics, The University of Melbourne, Parkville, Victoria 3010, Australia
3 shared publications
Latest Publications
- Open Access
- 24 March 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (1)
Optimization-free recursive Quantum Approximate Optimization Algorithm for the binary paint shop problem
The Quantum Approximate Optimization Algorithm (QAOA) is a leading candidate for near-term quantum advantage, yet its practical impact is hindered by limited performance on symmetric local Hamiltonians and the costly optimization of variational parameters. The recursive-QAOA (RQAOA) introduced by Bravyi [] addresses the first limitation while also reducing circuit size, and parameter transfer techniques can be used to bypass the optimization loop effectively. In this work, we combine these two ideas to develop an optimization-free RQAOA and evaluate its performance on the binary paint shop problem (BPSP)—an optimization problem found in manufacturing where a sequence of cars must be painted under constraints while minimizing the number of color changes. The BPSP can be formulated as an Ising ground state problem with a symmetric local Hamiltonian in the form of MAX-CUT and properties well suited for the application of QAOA parameter transfer. We benchmark QAOA and RQAOA with parameter transfer against classical solvers and heuristics, and investigate their resilience to suboptimal parameters. For circuit optimization, we use reverse-causal cones and introduce a method of trimming outer two-qubit gates. To estimate the classical resources needed to simulate these quantum algorithms, we compute entanglement entropy and bond dimensions using matrix product state methods. We also compare circuit sizes and measurement counts across implementations. Our results show that RQAOA is inherently robust to parameter deviations, maintaining near-optimal solutions without noticeable degradation under parameter transfer while substantially reducing quantum resource requirements compared to QAOA. This highlights a viable route toward scalable quantum optimization without the overhead of the classical optimization loop and its challenges with barren plateaus.
- 24 March 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (1)
Open AccessOptimization-free recursive Quantum Approximate Optimization Algorithm for the binary paint shop problem
The Quantum Approximate Optimization Algorithm (QAOA) is a leading candidate for near-term quantum advantage, yet its practical impact is hindered by limited performance on symmetric local Hamiltonians and the costly optimization of variational parameters. The recursive-QAOA (RQAOA) introduced by Bravyi [] addresses the first limitation while also reducing circuit size, and parameter transfer techniques can be used to bypass the optimization loop effectively. In this work, we combine these two ideas to develop an optimization-free RQAOA and evaluate its performance on the binary paint shop problem (BPSP)—an optimization problem found in manufacturing where a sequence of cars must be painted under constraints while minimizing the number of color changes. The BPSP can be formulated as an Ising ground state problem with a symmetric local Hamiltonian in the form of MAX-CUT and properties well suited for the application of QAOA parameter transfer. We benchmark QAOA and RQAOA with parameter transfer against classical solvers and heuristics, and investigate their resilience to suboptimal parameters. For circuit optimization, we use reverse-causal cones and introduce a method of trimming outer two-qubit gates. To estimate the classical resources needed to simulate these quantum algorithms, we compute entanglement entropy and bond dimensions using matrix product state methods. We also compare circuit sizes and measurement counts across implementations. Our results show that RQAOA is inherently robust to parameter deviations, maintaining near-optimal solutions without noticeable degradation under parameter transfer while substantially reducing quantum resource requirements compared to QAOA. This highlights a viable route toward scalable quantum optimization without the overhead of the classical optimization loop and its challenges with barren plateaus.
- Open Access
- 8 April 2025
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 9, 1695
What can unitary sequences tell us about multi-time physics?
Multi-time quantum processes are endowed with the same richness as multipartite states, including temporal entanglement and exotic causal structures. However, experimentally probing these rich phenomena leans heavily on fast and clean mid-circuit measurements, which are rarely available. We show here how surprisingly accessible these phenomena are in nascent quantum processors even when faced with substantially limited control. We work within the limitation where only unitary control is allowed, followed by a terminating measurement. Within this setting, we first develop a witness for genuine multi-time entanglement, and then methods to bound (from top and bottom) multi-time entanglement, non-Markovianity, purity, entropy, and other correlative measures. Our tools are designed to be implemented on quantum information processors, which we proceed to demonstrate. Finally, we discuss the limitations of these methods by testing them across random multi-time processes. Conceptually, this broadens our understanding of the extent to which temporal correlations may be determined with only deterministic control. Our techniques are pertinent to generic quantum stochastic dynamical processes, with a scope ranging across condensed matter physics, quantum biology, and in-depth diagnostics of NISQ-era quantum devices.
- 8 April 2025
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 9, 1695
Open AccessWhat can unitary sequences tell us about multi-time physics?
Multi-time quantum processes are endowed with the same richness as multipartite states, including temporal entanglement and exotic causal structures. However, experimentally probing these rich phenomena leans heavily on fast and clean mid-circuit measurements, which are rarely available. We show here how surprisingly accessible these phenomena are in nascent quantum processors even when faced with substantially limited control. We work within the limitation where only unitary control is allowed, followed by a terminating measurement. Within this setting, we first develop a witness for genuine multi-time entanglement, and then methods to bound (from top and bottom) multi-time entanglement, non-Markovianity, purity, entropy, and other correlative measures. Our tools are designed to be implemented on quantum information processors, which we proceed to demonstrate. Finally, we discuss the limitations of these methods by testing them across random multi-time processes. Conceptually, this broadens our understanding of the extent to which temporal correlations may be determined with only deterministic control. Our techniques are pertinent to generic quantum stochastic dynamical processes, with a scope ranging across condensed matter physics, quantum biology, and in-depth diagnostics of NISQ-era quantum devices.
- 1 January 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 37 (1) , 146-171
On the Instance Dependence of Parameter Initialization for the Quantum Approximate Optimization Algorithm: Insights via Instance Space Analysis
The quantum approximate optimization algorithm (QAOA) tackles combinatorial optimization problems in a quantum computing context, where achieving globally optimal and exact solutions is not always feasible because of classical computational constraints or problem complexity. The performance of QAOA generally depends on finding sufficiently good parameters that facilitate competitive approximate solutions. However, this is fraught with challenges, such as “barren plateaus,” making the search for effective parameters a nontrivial endeavor. More recently, the question of whether such an optimal parameter search is even necessary has been posed, with some studies showing that optimal parameters tend to be concentrated on certain values for specific types of problem instances. However, these existing studies have only examined specific instance classes of Maximum Cut, so it is uncertain if the claims of instance independence apply to a diverse range of instances. In this paper, we use instance space analysis to study QAOA parameter initialization strategies for the first time, providing a comprehensive study of how instance characteristics affect the performance of initialization strategies across a diverse set of graph types and weight distributions. Unlike previous studies that focused on specific graph classes (e.g., d-regular or Erdős–Rényi), our work examines a much broader range of instance types, revealing insights about parameter transfer between different graph classes. We introduce and evaluate a new initialization strategy, quantum instance-based parameter initialization, that leverages instance-specific information, demonstrating its effectiveness across various instance types. Our analysis at higher QAOA depths (p = 15) provides insights into the effectiveness of different initialization strategies beyond the low-depth circuits typically studied. History: Accepted by Giacomo Nannicini, Area Editor for Quantum Computing and Operations Research. This article is accepted for Special Issue. Funding: This research was supported by the Australian Research Council [Grant IC200100009 for the Australian Research Council Training Centre in Optimization Technologies, Integrated Methodologies and Applications]. V. Katial is supported by The University of Melbourne [Research Training Program Scholarship]. The authors gratefully acknowledge the information technology infrastructure support provided by The University of Melbourne’s Research Computing Services and the Petascale Campus Initiative. This research was also supported by The University of Melbourne through the establishment of the IBM Quantum Network Hub at the university. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0564 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0564 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 1 January 2025
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 37 (1) , 146-171
On the Instance Dependence of Parameter Initialization for the Quantum Approximate Optimization Algorithm: Insights via Instance Space Analysis
The quantum approximate optimization algorithm (QAOA) tackles combinatorial optimization problems in a quantum computing context, where achieving globally optimal and exact solutions is not always feasible because of classical computational constraints or problem complexity. The performance of QAOA generally depends on finding sufficiently good parameters that facilitate competitive approximate solutions. However, this is fraught with challenges, such as “barren plateaus,” making the search for effective parameters a nontrivial endeavor. More recently, the question of whether such an optimal parameter search is even necessary has been posed, with some studies showing that optimal parameters tend to be concentrated on certain values for specific types of problem instances. However, these existing studies have only examined specific instance classes of Maximum Cut, so it is uncertain if the claims of instance independence apply to a diverse range of instances. In this paper, we use instance space analysis to study QAOA parameter initialization strategies for the first time, providing a comprehensive study of how instance characteristics affect the performance of initialization strategies across a diverse set of graph types and weight distributions. Unlike previous studies that focused on specific graph classes (e.g., d-regular or Erdős–Rényi), our work examines a much broader range of instance types, revealing insights about parameter transfer between different graph classes. We introduce and evaluate a new initialization strategy, quantum instance-based parameter initialization, that leverages instance-specific information, demonstrating its effectiveness across various instance types. Our analysis at higher QAOA depths (p = 15) provides insights into the effectiveness of different initialization strategies beyond the low-depth circuits typically studied. History: Accepted by Giacomo Nannicini, Area Editor for Quantum Computing and Operations Research. This article is accepted for Special Issue. Funding: This research was supported by the Australian Research Council [Grant IC200100009 for the Australian Research Council Training Centre in Optimization Technologies, Integrated Methodologies and Applications]. V. Katial is supported by The University of Melbourne [Research Training Program Scholarship]. The authors gratefully acknowledge the information technology infrastructure support provided by The University of Melbourne’s Research Computing Services and the Petascale Campus Initiative. This research was also supported by The University of Melbourne through the establishment of the IBM Quantum Network Hub at the university. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2024.0564 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2024.0564 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 24 November 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for On the Instance Dependence of Parameter Initialization for the Quantum Approximate Optimization Algorithm: Insights via Instance Space Analysis
This repository contains the code for the experiments in the paper "On the Instance Dependence of Parameter Initialization for the Quantum Approximate Optimization Algorithm: Insights via Instance Space Analysis" by Vivek Katial, Kate Smith-Miles, Charles Hill and Lloyd Hollenberg.
- 24 November 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for On the Instance Dependence of Parameter Initialization for the Quantum Approximate Optimization Algorithm: Insights via Instance Space Analysis
This repository contains the code for the experiments in the paper "On the Instance Dependence of Parameter Initialization for the Quantum Approximate Optimization Algorithm: Insights via Instance Space Analysis" by Vivek Katial, Kate Smith-Miles, Charles Hill and Lloyd Hollenberg.
- Open Access
- 12 August 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (3) , 033155
Characterization of entanglement on superconducting quantum computers of up to 414 qubits
As quantum technology advances and the size of quantum computers grow, it becomes increasingly important to understand the extent of quality in the devices. As large-scale entanglement is a quantum resource crucial for achieving quantum advantage, the challenge in its generation makes it a valuable benchmark for measuring the performance of universal quantum devices. In this paper, we study entanglement in Greenberger-Horne-Zeilinger (GHZ) and graph states prepared on the range of IBM Quantum devices. We generate GHZ states and investigate their coherence times with respect to state size and dynamical decoupling techniques. A GHZ fidelity of is measured on a 32-qubit GHZ state, certifying its genuine multipartite entanglement (GME). We show a substantial improvement in GHZ decoherence rates for a seven-qubit GHZ state after implementing dynamical decoupling, and observe a linear trend in the decoherence rate of for up to qubits, confirming the absence of superdecoherence. Additionally, we prepare and characterize fully bipartite entangled native-graph states on 22 superconducting quantum devices with qubit counts as high as 414 qubits, all active qubits of the 433-qubit IBM Osprey device. Analysis of the decay of two-qubit entanglement within the prepared states shows suppression of coherent noise signals with the implementation of dynamical decoupling techniques. Additionally, we observe that the entanglement in some qubit pairs oscillates over time, which is likely caused by residual ZZ-interactions. Characterizing entanglement in native-graph states, along with detecting entanglement oscillations, can be an effective approach to low-level device benchmarking that encapsulates two-qubit error rates along with additional sources of noise, with possible applications to quantum circuit compilation. We develop several tools to automate the preparation and entanglement characterization of GHZ and graph states. In particular, a method to characterize graph state bipartite entanglement using just 36 circuits, constant with respect to the number of qubits.- 12 August 2024
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 6 (3) , 033155
Open AccessCharacterization of entanglement on superconducting quantum computers of up to 414 qubits
As quantum technology advances and the size of quantum computers grow, it becomes increasingly important to understand the extent of quality in the devices. As large-scale entanglement is a quantum resource crucial for achieving quantum advantage, the challenge in its generation makes it a valuable benchmark for measuring the performance of universal quantum devices. In this paper, we study entanglement in Greenberger-Horne-Zeilinger (GHZ) and graph states prepared on the range of IBM Quantum devices. We generate GHZ states and investigate their coherence times with respect to state size and dynamical decoupling techniques. A GHZ fidelity of is measured on a 32-qubit GHZ state, certifying its genuine multipartite entanglement (GME). We show a substantial improvement in GHZ decoherence rates for a seven-qubit GHZ state after implementing dynamical decoupling, and observe a linear trend in the decoherence rate of for up to qubits, confirming the absence of superdecoherence. Additionally, we prepare and characterize fully bipartite entangled native-graph states on 22 superconducting quantum devices with qubit counts as high as 414 qubits, all active qubits of the 433-qubit IBM Osprey device. Analysis of the decay of two-qubit entanglement within the prepared states shows suppression of coherent noise signals with the implementation of dynamical decoupling techniques. Additionally, we observe that the entanglement in some qubit pairs oscillates over time, which is likely caused by residual ZZ-interactions. Characterizing entanglement in native-graph states, along with detecting entanglement oscillations, can be an effective approach to low-level device benchmarking that encapsulates two-qubit error rates along with additional sources of noise, with possible applications to quantum circuit compilation. We develop several tools to automate the preparation and entanglement characterization of GHZ and graph states. In particular, a method to characterize graph state bipartite entanglement using just 36 circuits, constant with respect to the number of qubits. - Open Access
- 2 May 2024
- Published by Springer Nature in Quantum Machine Intelligence
- Vol. 6 (1) , 1-14
Permutation invariant encodings for quantum machine learning with point cloud data
Quantum computing offers a potentially powerful new method for performing machine learning. However, several quantum machine learning techniques have been shown to exhibit poor generalisation as the number of qubits increases. We address this issue by demonstrating a permutation invariant quantum encoding method, which exhibits superior generalisation performance, and apply it to point cloud data (three-dimensional images composed of points). Point clouds naturally contain permutation symmetry with respect to the ordering of their points, making them a natural candidate for this technique. Our method captures this symmetry in a quantum encoding that contains an equal quantum superposition of all permutations and is therefore invariant under point order permutation. We test this encoding method in numerical simulations using a quantum support vector machine to classify point clouds drawn from either spherical or toroidal geometries. We show that a permutation invariant encoding improves in accuracy as the number of points contained in the point cloud increases, while non-invariant quantum encodings decrease in accuracy. This demonstrates that by implementing permutation invariance into the encoding, the model exhibits improved generalisation.
- 2 May 2024
- Published by Springer Nature in Quantum Machine Intelligence
- Vol. 6 (1) , 1-14
Open AccessPermutation invariant encodings for quantum machine learning with point cloud data
Quantum computing offers a potentially powerful new method for performing machine learning. However, several quantum machine learning techniques have been shown to exhibit poor generalisation as the number of qubits increases. We address this issue by demonstrating a permutation invariant quantum encoding method, which exhibits superior generalisation performance, and apply it to point cloud data (three-dimensional images composed of points). Point clouds naturally contain permutation symmetry with respect to the ordering of their points, making them a natural candidate for this technique. Our method captures this symmetry in a quantum encoding that contains an equal quantum superposition of all permutations and is therefore invariant under point order permutation. We test this encoding method in numerical simulations using a quantum support vector machine to classify point clouds drawn from either spherical or toroidal geometries. We show that a permutation invariant encoding improves in accuracy as the number of points contained in the point cloud increases, while non-invariant quantum encodings decrease in accuracy. This demonstrates that by implementing permutation invariance into the encoding, the model exhibits improved generalisation.
- Open Access
On the Instance Dependence of Optimal Parameters for the Quantum Approximate Optimisation Algorithm: Insights via Instance Space Analysis
The performance of the Quantum Approximate Optimisation Algorithm (QAOA) relies on the setting of optimal parameters in each layer of the circuit. This is no trivial task, and much literature has focused on the challenge of finding optimal parameters when the landscape is plagued with problems such as "barren plateaus". There are many choices of optimisation heuristics that can be used to search for optimal parameters, each with its own parameters and initialisation choices that affect performance. More recently, the question of whether such optimal parameter search is even necessary has been posed, with some studies showing that optimal parameters tend to be concentrated on certain values for specific types of problem instances. However, these existing studies have only examined specific instance classes of MaxCut, so it is uncertain if the claims of instance independence apply to a diverse range of instances. In this paper, we use Instance Space Analysis to study the dependence of instance characteristics on the performance of QAOA. Focusing on the MaxCut problem, we assess the effectiveness of parameter initialisation strategies and introduce a new initialisation approach based on instance characteristics called Quantum Instance-Based Parameter Initialisation (QIBPI). This study reveals that using insights about instance characteristics in choosing initialisation parameters can improve QAOA performance. We also show that, within certain instance classes, parameters from smaller instances can be transferred to larger ones. This research provides a foundation for further instance space analysis for quantum algorithms and encourages a broader class of instances to be considered to ensure conclusions are not limited to particular well-studied test problems or classes.
Open AccessOn the Instance Dependence of Optimal Parameters for the Quantum Approximate Optimisation Algorithm: Insights via Instance Space Analysis
The performance of the Quantum Approximate Optimisation Algorithm (QAOA) relies on the setting of optimal parameters in each layer of the circuit. This is no trivial task, and much literature has focused on the challenge of finding optimal parameters when the landscape is plagued with problems such as "barren plateaus". There are many choices of optimisation heuristics that can be used to search for optimal parameters, each with its own parameters and initialisation choices that affect performance. More recently, the question of whether such optimal parameter search is even necessary has been posed, with some studies showing that optimal parameters tend to be concentrated on certain values for specific types of problem instances. However, these existing studies have only examined specific instance classes of MaxCut, so it is uncertain if the claims of instance independence apply to a diverse range of instances. In this paper, we use Instance Space Analysis to study the dependence of instance characteristics on the performance of QAOA. Focusing on the MaxCut problem, we assess the effectiveness of parameter initialisation strategies and introduce a new initialisation approach based on instance characteristics called Quantum Instance-Based Parameter Initialisation (QIBPI). This study reveals that using insights about instance characteristics in choosing initialisation parameters can improve QAOA performance. We also show that, within certain instance classes, parameters from smaller instances can be transferred to larger ones. This research provides a foundation for further instance space analysis for quantum algorithms and encourages a broader class of instances to be considered to ensure conclusions are not limited to particular well-studied test problems or classes.
- 7 February 2024
- Published by Springer Nature in Quantum Machine Intelligence
- Vol. 6 (1) , 1-31
A kernel-based quantum random forest for improved classification
- 7 February 2024
- Published by Springer Nature in Quantum Machine Intelligence
- Vol. 6 (1) , 1-31
A kernel-based quantum random forest for improved classification
- Open Access
- 11 September 2023
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 7, 1109
Noise-robust ground state energy estimates from deep quantum circuits
In the lead up to fault tolerance, the utility of quantum computing will be determined by how adequately the effects of noise can be circumvented in quantum algorithms. Hybrid quantum-classical algorithms such as the variational quantum eigensolver (VQE) have been designed for the short-term regime. However, as problems scale, VQE results are generally scrambled by noise on present-day hardware. While error mitigation techniques alleviate these issues to some extent, there is a pressing need to develop algorithmic approaches with higher robustness to noise. Here, we explore the robustness properties of the recently introduced quantum computed moments (QCM) approach to ground state energy problems, and show through an analytic example how the underlying energy estimate explicitly filters out incoherent noise. Motivated by this observation, we implement QCM for a model of quantum magnetism on IBM Quantum hardware to examine the noise-filtering effect with increasing circuit depth. We find that QCM maintains a remarkably high degree of error robustness where VQE completely fails. On instances of the quantum magnetism model up to 20 qubits for ultra-deep trial state circuits of up to 500 CNOTs, QCM is still able to extract reasonable energy estimates. The observation is bolstered by an extensive set of experimental results. To match these results, VQE would need hardware improvement by some 2 orders of magnitude on error rates.
- 11 September 2023
- Published by Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften in Quantum
- Vol. 7, 1109
Open AccessNoise-robust ground state energy estimates from deep quantum circuits
In the lead up to fault tolerance, the utility of quantum computing will be determined by how adequately the effects of noise can be circumvented in quantum algorithms. Hybrid quantum-classical algorithms such as the variational quantum eigensolver (VQE) have been designed for the short-term regime. However, as problems scale, VQE results are generally scrambled by noise on present-day hardware. While error mitigation techniques alleviate these issues to some extent, there is a pressing need to develop algorithmic approaches with higher robustness to noise. Here, we explore the robustness properties of the recently introduced quantum computed moments (QCM) approach to ground state energy problems, and show through an analytic example how the underlying energy estimate explicitly filters out incoherent noise. Motivated by this observation, we implement QCM for a model of quantum magnetism on IBM Quantum hardware to examine the noise-filtering effect with increasing circuit depth. We find that QCM maintains a remarkably high degree of error robustness where VQE completely fails. On instances of the quantum magnetism model up to 20 qubits for ultra-deep trial state circuits of up to 500 CNOTs, QCM is still able to extract reasonable energy estimates. The observation is bolstered by an extensive set of experimental results. To match these results, VQE would need hardware improvement by some 2 orders of magnitude on error rates.
- Open Access
Filtering crosstalk from bath non-Markovianity via spacetime classical shadows
From an open system perspective non-Markovian effects due to a nearby bath or neighbouring qubits are dynamically equivalent. However, there is a conceptual distinction to account for: neighbouring qubits may be controlled. We combine recent advances in non-Markovian quantum process tomography with the framework of classical shadows to characterise spatiotemporal quantum correlations. Observables here constitute operations applied to the system, where the free operation is the maximally depolarising channel. Using this as a causal break, we systematically erase causal pathways to narrow down the progenitors of temporal correlations. We show that one application of this is to filter out the effects of crosstalk and probe only non-Markovianity from an inaccessible bath. It also provides a lens on spatiotemporally spreading correlated noise throughout a lattice from common environments. We demonstrate both examples on synthetic data. Owing to the scaling of classical shadows, we can erase arbitrarily many neighbouring qubits at no extra cost. Our procedure is thus efficient and amenable to systems even with all-to-all interactions.
Open AccessFiltering crosstalk from bath non-Markovianity via spacetime classical shadows
From an open system perspective non-Markovian effects due to a nearby bath or neighbouring qubits are dynamically equivalent. However, there is a conceptual distinction to account for: neighbouring qubits may be controlled. We combine recent advances in non-Markovian quantum process tomography with the framework of classical shadows to characterise spatiotemporal quantum correlations. Observables here constitute operations applied to the system, where the free operation is the maximally depolarising channel. Using this as a causal break, we systematically erase causal pathways to narrow down the progenitors of temporal correlations. We show that one application of this is to filter out the effects of crosstalk and probe only non-Markovianity from an inaccessible bath. It also provides a lens on spatiotemporally spreading correlated noise throughout a lattice from common environments. We demonstrate both examples on synthetic data. Owing to the scaling of classical shadows, we can erase arbitrarily many neighbouring qubits at no extra cost. Our procedure is thus efficient and amenable to systems even with all-to-all interactions.