activity
20062026
most citedStrong Parallel Repetition Theorem for Quantum XOR Proof Systems

26 citations · 48 across the 12 of their papers we have counts for

collaborators
Showing quant-phShow all

8 papers · 1 filter

quant-ph2026

When AI meets quantum information: A comprehensive review

Min Chen, Yu Gan, Xin Jin +15

Artificial intelligence (AI) and quantum information (QI) are rapidly co-evolving. AI is becoming a practical tool for learning, designing, controlling, and verifying quantum syste…

quant-ph2026

Exponentially Fast Solution State Preparation for the Heat Equation and its use for Option Pricing

Gumaro Rendon, Stepan Smid, Sarvagya Upadhyay

In this work, we present the methods necessary to price an important set of derivatives on a quantum device while offering an advantage over existing classical methods. The methods…

quant-ph2026

On the importance of hyperparameters in initializing parameterized quantum circuits

Ankit Kulshrestha, Sarvagya Upadhyay

There has been intensive research on increasing the utility and performance of Parameterized Quantum Circuits (PQCs) in the past couple of years. Owing to this research, there are…

quant-ph2023★ 1 cited

A hybrid quantum-classical algorithm for Bayes-optimal quantum state discrimination using the source code

Ankith Mohan, Jamie Sikora, Sarvagya Upadhyay

Quantum state discrimination is a fundamental primitive in quantum information processing, underpinning tasks in quantum communication, sensing, and learning. We consider the gener…

quant-ph2020

Compressed Quadratization of Higher Order Binary Optimization Problems

Avradip Mandal, Arnab Roy, Sarvagya Upadhyay +1

Recent hardware advances in quantum and quantum-inspired annealers promise substantial speedup for solving NP-hard combinatorial optimization problems compared to general-purpose c…

quant-ph2011★ 2 cited

QMA variants with polynomially many provers

Sevag Gharibian, Jamie Sikora, Sarvagya Upadhyay

We study three variants of multi-prover quantum Merlin-Arthur proof systems. We first show that the class of problems that can be efficiently verified using polynomially many quant…