Classical shadow tomography is a powerful randomized measurement protocol for predicting many properties of a quantum state with few measurements. Two classical shadow protocols have been extensively studied in the literature: the single-qubit (local) Pauli measurement, which is well suited for predicting local operators but inefficient for large operators; and the global Clifford measurement, which is efficient for low-rank operators but infeasible on near-term quantum devices due to the extensive gate overhead. In this work, we demonstrate a scalable classical shadow tomography approach for generic randomized measurements implemented with finite-depth local Clifford random unitary circuits, which interpolates between the limits of Pauli a...
Variational Quantum Algorithms (VQA) have been identified as a promising candidate for the demonstra...
A common requirement of quantum simulations and algorithms is the preparation of complex states thro...
Quantum computers solve ever more complex tasks using steadily growing system sizes. Characterizing ...
We generalize the classical shadow tomography scheme to a broad class of finite-depth or finite-time...
Properties of quantum systems can be estimated using classical shadows, which implement measurements...
We study classical shadows protocols based on randomized measurements in $n$-qubit entangled bases, ...
Quantum process tomography is a powerful tool for understanding quantum channels and characterizing ...
The constantly increasing dimensionality of artificial quantum systems demands for highly efficient ...
With quantum computing devices increasing in scale and complexity, there is a growing need for tools...
Advances in quantum technology require scalable techniques to efficiently extract information from a...
With quantum computing devices increasing in scale and complexity, there is a growing need for tools...
Tensor Networks (TN) are approximations of high-dimensional tensors designed to represent locally en...
We consider the classical shadows task for pure states in the setting of both joint and independent ...
Shadow tomography for quantum states provides a sample efficient approach for predicting the propert...
Variational quantum algorithms are promising algorithms for achieving quantum advantage on near-term...
Variational Quantum Algorithms (VQA) have been identified as a promising candidate for the demonstra...
A common requirement of quantum simulations and algorithms is the preparation of complex states thro...
Quantum computers solve ever more complex tasks using steadily growing system sizes. Characterizing ...
We generalize the classical shadow tomography scheme to a broad class of finite-depth or finite-time...
Properties of quantum systems can be estimated using classical shadows, which implement measurements...
We study classical shadows protocols based on randomized measurements in $n$-qubit entangled bases, ...
Quantum process tomography is a powerful tool for understanding quantum channels and characterizing ...
The constantly increasing dimensionality of artificial quantum systems demands for highly efficient ...
With quantum computing devices increasing in scale and complexity, there is a growing need for tools...
Advances in quantum technology require scalable techniques to efficiently extract information from a...
With quantum computing devices increasing in scale and complexity, there is a growing need for tools...
Tensor Networks (TN) are approximations of high-dimensional tensors designed to represent locally en...
We consider the classical shadows task for pure states in the setting of both joint and independent ...
Shadow tomography for quantum states provides a sample efficient approach for predicting the propert...
Variational quantum algorithms are promising algorithms for achieving quantum advantage on near-term...
Variational Quantum Algorithms (VQA) have been identified as a promising candidate for the demonstra...
A common requirement of quantum simulations and algorithms is the preparation of complex states thro...
Quantum computers solve ever more complex tasks using steadily growing system sizes. Characterizing ...