Publications (10)
Lower Bounds for Learning Quantum States with Single-Copy Measurements
Angus Lowe, Ashwin Nayak
We study the problems of quantum tomography and shadow tomography using measurements performed on individual, identical copies of an unknown -dimensional state. We first revisit…
Optimal quantum circuit cuts with application to clustered Hamiltonian simulation
Aram W. Harrow, Angus Lowe
We study methods to replace entangling operations with random local operations in a quantum computation, at the cost of increasing the number of required executions. First, we cons…
PennyLane: Automatic differentiation of hybrid quantum-classical computations
Ville Bergholm, Josh Izaac, Maria Schuld +65
PennyLane is a Python 3 software framework for differentiable programming of quantum computers. The library provides a unified architecture for near-term quantum computing devices,…
Unified approach to data-driven quantum error mitigation
Angus Lowe, Max Hunter Gordon, Piotr Czarnik +3
Achieving near-term quantum advantage will require effective methods for mitigating hardware noise. Data-driven approaches to error mitigation are promising, with popular examples…
Nearly tight bounds for testing tree tensor network states
Benjamin Lovitz, Angus Lowe
Tree tensor network states (TTNS) generalize the notion of having low Schmidt-rank to multipartite quantum states, through a parameter known as the bond dimension. This leads to su…
Random dimension reduction and learning symmetric properties of quantum states
Angus Lowe, Xinyu Tan
We introduce a procedure called random dimension reduction that simultaneously reduces the dimensions of many, potentially distinct quantum states while preserving properties invar…
Fast quantum circuit cutting with randomized measurements
Angus Lowe, Matija MedvidoviÄ, Anthony Hayes +4
We propose a new method to extend the size of a quantum computation beyond the number of physical qubits available on a single device. This is accomplished by randomly inserting me…
Randomized truncation of quantum states
Aram W. Harrow, Angus Lowe, Freek Witteveen
A fundamental task in quantum information is to approximate a pure quantum state in terms of sparse states or, for a bipartite system, states of bounded Schmidt rank. The optimal d…
Simulating key properties of lithium-ion batteries with a fault-tolerant quantum computer
Alain Delgado, Pablo A. M. Casares, Roberto dos Reis +9
There is a pressing need to develop new rechargeable battery technologies that can offer higher energy storage, faster charging, and lower costs. Despite the success of existing me…
Adaptive shot allocation for fast convergence in variational quantum algorithms
Andi Gu, Angus Lowe, Pavel A. Dub +2
Variational Quantum Algorithms (VQAs) are a promising approach for practical applications like chemistry and materials science on near-term quantum computers as they typically redu…