147 citations · 276 across the 15 of their papers we have counts for
15 papers
Simulating dynamics of RLC circuits with a quantum differential-algebraic equations solver
Arkopal Dutt, Anirban Chowdhury, Kristan Temme +1
We introduce a quantum algorithm for simulating the dynamics of electrical circuits consisting of resistors, inductors and capacitors (aka RLC circuits) along with power sources. G…
Dissipative microcanonical ensemble preparation from KMS-detailed balance
Anirban N. Chowdhury, Samuel O. Scalet, Kunal Sharma
Stationary states of quantum many-body Hamiltonians are invariant under the Hamiltonian evolution. Besides ground and thermal states, this class includes microcanonical ensembles t…
Quantum Krylov Algorithm for Szegö Quadrature
William Kirby, Yizhi Shen, Daan Camps +3
We present a quantum algorithm to evaluate matrix elements of functions of unitary operators. The method is based on calculating quadrature nodes and weights using data collected f…
Classical Estimation of the Free Energy and Quantum Gibbs Sampling from the Markov Entropy Decomposition
Samuel O. Scalet, Angela Capel, Anirban N. Chowdhury +4
We revisit the Markov Entropy Decomposition, a classical convex relaxation algorithm introduced by Poulin and Hastings to approximate the free energy in quantum spin lattices. We i…
Quantum Approximate Counting with Additive Error: Hardness and Optimality
Mason L. Rhodes, Sam Slezak, Anirban Chowdhury +1
Quantum counting is the task of determining the dimension of the subspace of states that are accepted by a quantum verifier circuit. It is the quantum analog of counting the number…
Controlization Schemes Based on Orthogonal Arrays
Anirban Chowdhury, Ewout van den Berg, Pawel Wocjan
Realizing controlled operations is fundamental to the design and execution of quantum algorithms. In quantum simulation and learning of quantum many-body systems, an important subr…
Relaxations and Exact Solutions to Quantum Max Cut via the Algebraic Structure of Swap Operators
Adam Bene Watts, Anirban Chowdhury, Aidan Epperly +2
The Quantum Max Cut (QMC) problem has emerged as a test-problem for designing approximation algorithms for local Hamiltonian problems. In this paper we attack this problem using th…
Quantum complexity of the Kronecker coefficients
Sergey Bravyi, Anirban Chowdhury, David Gosset +2
Whether or not the Kronecker coefficients of the symmetric group count some set of combinatorial objects is a longstanding open question. In this work we show that a given Kronecke…
Space-efficient Quantization Method for Reversible Markov Chains
Chen-Fu Chiang, Anirban Chowdhury, Pawel Wocjan
In a seminal paper, Szegedy showed how to construct a quantum walk for any reversible Markov chain such that its eigenvector with eigenphase is a quantum sample of t…
On the complexity of quantum partition functions
Sergey Bravyi, Anirban Chowdhury, David Gosset +1
The partition function and free energy of a quantum many-body system determine its physical properties in thermal equilibrium. Here we study the computational complexity of approxi…
A Variational Quantum Algorithm for Preparing Quantum Gibbs States
Anirban N. Chowdhury, Guang Hao Low, Nathan Wiebe
Preparation of Gibbs distributions is an important task for quantum computation. It is a necessary first step in some types of quantum simulations and further is essential for quan…
Computing partition functions in the one clean qubit model
Anirban N. Chowdhury, Rolando D. Somma, Yigit Subasi
We present a method to approximate partition functions of quantum systems using mixed-state quantum computation. For positive semi-definite Hamiltonians, our method has expected ru…
Improved implementation of reflection operators
Anirban Narayan Chowdhury, Yigit Subasi, Rolando D. Somma
Quantum algorithms for diverse problems, including search and optimization problems, require the implementation of a reflection operator over a target state. Commonly, such reflect…
Quantum algorithms for Gibbs sampling and hitting-time estimation
Anirban Narayan Chowdhury, Rolando D. Somma
We present quantum algorithms for solving two problems regarding stochastic processes. The first algorithm prepares the thermal Gibbs state of a quantum system and runs in time alm…
Circular geodesics and accretion disks in Janis-Newman-Winicour and Gamma metric
Anirban N. Chowdhury, Mandar Patil, Daniele Malafarina +1
We study here circular timelike geodesics in the Janis-Newman-Winicour and Gamma metric spacetimes which contain a strong curvature naked singularity and reduce to the Schwarzschil…