activity
20142026
most citedNew one shot quantum protocols with application to communication complexity

11 citations · 30 across the 8 of their papers we have counts for

collaborators

8 papers

quant-ph2026

Provable Quantum-Classical Separation for Continuous Gibbs Sampling

Enrico Olivucci, Mariia Sobchuk, Sehmimul Hoque +4

We prove the first quantum-classical separation for a sampling problem over a continuous domain. For a class of Gibbs states on the torus with smo…

quant-ph2026

Breaking the Curse of Dimensionality in Quantum PDE Solvers via Gevrey Regularity

Pooya Ronagh, Mariia Sobchuk, Xiaoran Li +2

We connect different degrees of smoothness of real-valued periodic functions to the number of qubits required for their high-precision Fourier-basis amplitude encodings. Our centra…

quant-ph2026

Nonlinear semigroups with unbounded generators under Carleman linearization

Sitanshu Gakkhar, Ala Shayeghi, David C. Del Rey Fernández

We treat the convergence of Carleman linearization of nonlinear evolutionary equations through the approximation theory of strongly continuous semigroups, by Carleman embedding the…

quant-ph2023★ 4 cited

A lower bound on the overhead of quantum error correction in low dimensions

Nouédyn Baspin, Omar Fawzi, Ala Shayeghi

We show that a quantum architecture with an error correction procedure limited to geometrically local operations incurs an overhead that grows with the system size, even if arbitra…

quant-ph2022★ 9 cited

A hierarchy of efficient bounds on quantum capacities exploiting symmetry

Omar Fawzi, Ala Shayeghi, Hoang Ta

Optimal rates for achieving an information processing task are often characterized in terms of regularized information measures. In many cases of quantum tasks, we do not know how…

quant-ph2022★ 6 cited

A lower bound on the space overhead of fault-tolerant quantum computation

Omar Fawzi, Alexander Müller-Hermes, Ala Shayeghi

The threshold theorem is a fundamental result in the theory of fault-tolerant quantum computation stating that arbitrarily long quantum computations can be performed with a polylog…

quant-ph2020

Capacity Approaching Coding for Low Noise Interactive Quantum Communication, Part I: Large Alphabets

Debbie Leung, Ashwin Nayak, Ala Shayeghi +3

We consider the problem of implementing two-party interactive quantum communication over noisy channels, a necessary endeavor if we wish to fully reap quantum advantages for commun…

quant-ph2014★ 11 cited

New one shot quantum protocols with application to communication complexity

Anurag Anshu, Rahul Jain, Priyanka Mukhopadhyay +2

In this paper we present the following quantum compression protocol: P : Let be quantum states such that , the relative entropy betwe…