Searcharxiv⌕ Search

arXiv subjects

Raghavendra D. Peddinti

Publications and source records attributed to Raghavendra D. Peddinti.

2 recordsLinked to original sources

Robust ultra-shallow shadows

We present a robust shadow estimation protocol for wide classes of low-depth measurement circuits that mitigates noise as long as the effective measurement map including noise is locally unitarily invariant. This is in practice an excellent approximation, encompassing for instance the case of ideal single-qubit Clifford gates composing the first circuit layer of an otherwise arbitrary circuit architecture and even non-Markovian, gate-dependent noise in the rest of the circuit. We argue that for weakly-correlated local noise, the measurement channel has an efficient matrix-product representation, and show how to estimate this directly from experimental data using tensor-network tools, eliminating the need for analytical or numeric calculations. We illustrate the relevance of our method with both numerics and proof-of-principle experiments on an IBM Quantum device. Numerically, we show that unmitigated shallow shadows with noisy circuits become more biased as the depth increases. In contrast, using the same number of samples, robust ultra-shallow shadows become more precise with increasing depth for relevant parameter regimes. The gain in sample efficiency is still limited by the noise per gate, resulting in an optimal circuit depth per noise level. Experimentally, we observe improved precision in two simple fidelity estimation tasks using five-qubit circuits with up to two layers of entangling gates, by about an order of magnitude. Under the practical constraints of current and near-term noisy quantum devices, our method maximally realizes the potential of shadow estimation with global rotations and identifies its fundamental limitations in the presence of noise.

quant-ph↗

Complete quantum-inspired framework for computational fluid dynamics

Computational fluid dynamics is both a thriving research field and a key tool for advanced industry applications. The central challenge is to simulate turbulent flows in complex geometries, a compute-power intensive task due to the large vector dimensions required by discretized meshes. We present a full-stack method to solve for incompressible fluids with memory and runtime scaling poly-logarithmically in the mesh size. Our framework is based on matrix-product states, a powerful compressed representation of quantum states. It is complete in that it solves for flows around immersed objects of arbitrary geometries, with non-trivial boundary conditions, and self-consistent in that it can retrieve the solution directly from the compressed encoding, i.e. without ever passing through the expensive dense-vector representation. This machinery lays the foundations for a new generation of potentially radically more efficient solvers of real-life fluid problems.

physics.flu-dyn↗