Related papers: Hidden Quantum Advantage near the Decoding Thresho…
Recently, Jordan et al. (Nature, 2025) introduced a novel quantum-algorithmic technique called Decoded Quantum Interferometry (DQI) for solving specific combinatorial optimization problems associated with classical codes. They presented a…
It is critically important to analyze the achievability of quantum advantage under realistic imperfections. In this work, we show that quantum advantage in distributed sensing can be achieved with noisy quantum networks which can only…
Recent advancements in quantum technologies have opened new horizons for exploring the physical world in ways once deemed impossible. Central to these breakthroughs is the concept of quantum advantage, where quantum systems outperform their…
In adversarial settings, where attackers can deliberately and strategically corrupt quantum data, standard quantum error correction reaches its limits. It can only correct up to half the code distance and must output a unique answer.…
Decoded Quantum Interferometry (DQI) is a recently proposed quantum optimization algorithm that exploits sparsity in the Fourier spectrum of objective functions, with the potential for exponential speedups over classical algorithms on…
We implement an experiment on a photonic quantum processor establishing efficacy of the elementary quantum system in classical information storage. The advantage is established by considering a class of simple bipartite games played with…
Quantum Machine Learning algorithms based on Variational Quantum Circuits (VQCs) are important candidates for useful application of quantum computing. It is known that a VQC is a linear model in a feature space determined by its…
We discuss the realization of quantum advantage in a system without quantum entanglement but with non-zero quantum discord. We propose an optical realization of symmetric two-qubit $X$-states with controllable anti-diagonal elements. This…
It is well known that quantum, randomized and deterministic (sequential) query complexities are polynomially related for total boolean functions. We find that significantly larger separations between the parallel generalizations of these…
Recent progress in quantum computing has enabled systems with tens of reliable logical qubits, built from thousands of noisy physical qubits. However, many impactful applications demand quantum computations with millions of logical qubits,…
Achieving superpolynomial speedups for optimization has long been a central goal for quantum algorithms. Here we introduce Decoded Quantum Interferometry (DQI), a quantum algorithm that uses the quantum Fourier transform to reduce…
Under ideal conditions, quantum metrology promises a precision gain over classical techniques scaling quadratically with the number of probe particles. At the same time, no-go results have shown that generic, uncorrelated noise limits the…
Demonstrating quantum advantage with less powerful but more realistic devices is of great importance in modern quantum information science. Recently, a significant quantum speedup was achieved in the problem of learning a hidden parity…
The inevitable accumulation of errors in near-future quantum devices represents a key obstacle in delivering practical quantum advantages, motivating the development of various quantum error-mitigation methods. Here, we derive fundamental…
Attaining a quantum speedup in solving practically useful optimization problems has been one of the holy grails in the field of quantum computing. While prior approaches have demonstrated speedups for certain structured problem classes,…
Decoy-state quantum key distribution (QKD) is undoubtedly the most efficient solution to handle multi-photon signals emitted by laser sources, and provides the same secret key rate scaling as ideal single-photon sources. It requires,…
We show that in presence of a local and uncorrelated dephasing noise, quantum advantage can be obtained in the Fisher information-based lower bound of the minimum uncertainty in estimating parameters of the system Hamiltonian. The quantum…
In practical decoy-state quantum key distribution, the raw key length is finite. Thus, deviation of the estimated single photon yield and single photon error rate from their respective true values due to finite sample size can seriously…
We report two analytical bounds for quantum error-correcting codes that do not have preexisting classical counterparts. Firstly the quantum Hamming and Singleton bounds are combined into a single tighter bound, and then the combined bound…
The textbook adversary bound for function evaluation states that to evaluate a function $f\colon D\to C$ with success probability $\frac{1}{2}+\delta$ in the quantum query model, one needs at least $\left( 2\delta -\sqrt{1-4\delta^2}…