11028 papers
Quantum physics explores the strange and often counterintuitive rules that govern the universe at its smallest scales. This field investigates how particles like electrons and photons behave in ways that defy our everyday intuition, forming the backbone of modern technologies from lasers to future quantum computers. While the mathematics can be daunting, the core ideas promise to revolutionize how we understand reality and process information.
At Gist.Science, we make these complex discoveries accessible to everyone. We systematically process every new preprint published in the Quant-Ph category on arXiv, transforming dense academic papers into clear, plain-language explanations alongside detailed technical summaries. Whether you are a seasoned researcher or a curious reader, our goal is to bridge the gap between cutting-edge theory and human understanding.
Below are the latest papers in quantum physics, distilled to help you grasp the newest breakthroughs without getting lost in the jargon.
This paper introduces a general-purpose, interpretable path-recording oracle that perfectly simulates random elements of any closed subgroup of by storing superposed input-output pairs, thereby enabling direct comparisons between different groups to derive new pseudorandomness results, such as a simplified construction of pseudorandom unitaries.
This paper demonstrates that mutually orthogonal stabilizer states cannot be perfectly distinguished using only stabilizer operations, thereby establishing an efficient method to test for nonstabilizerness and revealing a fundamental asymmetry between the preparation and discrimination of free states that parallels "nonlocality without entanglement."
This paper bridges the gap between theoretical GKP error correction models and practical superconducting device limitations by demonstrating that loss and dephasing can be approximated as random displacements, proposing decoder modifications to drastically reduce gate infidelity, and outlining a quantum trajectory-based scheme to mitigate measurement inefficiencies during read-out.
This paper develops a quantum Local Coordinate-wise Linear (LCL) framework to prove a threshold theorem for random CSS codes and leverages it to construct the first explicit qLDPC codes that achieve optimal parameters for quantum list-decodability, list-recoverability, and subspace designs.
This paper presents the first quantum algorithm to achieve an asymptotic speedup over the best classical combinatorial approach for the maximum-weight perfect matching problem in general graphs, running in time by adapting the Duan-Pettie-Su framework with quantum methods and specialized data structures.
This paper presents a general compiler enabling classical clients to upload quantum ciphertexts to servers for publicly verifiable certified deletion and non-destructive auditing, relying on the post-quantum hardness of LWE and introducing a novel simulation technique to adapt purification-based security arguments to classical interactions.
This paper demonstrates that any -qubit unitary can be approximated to arbitrary precision by a quantum circuit of constant depth using unbounded fan-out gates, or polynomial depth with standard gates, provided an exponential number of ancilla qubits are available, thereby resolving the open question of whether exponential depth is necessary for general unitary synthesis.
This paper resolves the long-standing open problem regarding the optimal security scaling of multipartite Werner state data hiding by proving that the distinguishing bias under PPT measurements scales as , thereby extending the certified hiding regime to and establishing new lower bounds for quantum property testing via mixed Schur-Weyl duality.
This paper presents three quantum algorithms that achieve significant query and gate complexity improvements over classical methods for learning linear threshold functions under real-domain membership queries, sparse support identification, and Gaussian quantum example access.
This paper investigates the information-theoretic limits of detecting planted cliques using quantum encodings, demonstrating that while binary phase state encoding requires many copies for detection, symmetry-adapted measurements can preserve distinguishing information and a single coherent quantum sample enables an efficient distinguisher that offers a conditional computational separation from classical methods.