Quantum Advantage from One-Way Functions
Delve into quantum advantage theory through one-way functions, exploring inefficient-verifier proofs of quantumness and their construction from classical bit commitments in cryptography.
Oracle Separation of QMA and QCMA with Bounded Adaptivity
Delve into quantum complexity theory through an exploration of oracle separation between QMA and QCMA, focusing on bounded adaptivity in oracle queries and the novel concept of slipperiness.
One-Wayness in Quantum Cryptography
Explore fundamental concepts of quantum cryptography, focusing on one-way functions, EFI pairs, and quantum digital signatures through groundbreaking research in cryptographic primitives.
Multi-product Hamiltonian Simulation with Explicit Commutator Scaling
Delve into advanced quantum computing research exploring multi-product Hamiltonian simulation techniques, focusing on explicit commutator scaling and improved complexity analysis for practical quantum systems.
Understanding Cryptographic Hardness in a Quantum World
Explore cutting-edge research on cryptographic security challenges and theoretical frameworks in quantum computing, focusing on hardness assumptions and their implications for future systems.
Gapped Clique Homology is QMA1-Hard and Contained in QMA
Explore the complexity of homology problems in computational topology, focusing on clique complexes and their quantum complexity classification through innovative eigenvalue analysis techniques.
Quantum Spherical Codes: A Framework for Bosonic and CSS Code Construction
Explore groundbreaking research on quantum spherical codes, examining their construction framework and applications in bosonic coding, with insights into protecting against dephasing noise.
Clifford Operations and Homological Codes for Rotors and Oscillators
Delve into quantum information processing fundamentals for planar rotors, exploring Clifford group operations, homological error-correcting codes, and their applications in quantum computing systems.
Fault-Tolerant Circuits from Twisted Quantum Doubles - Quantum Error Correction Beyond Stabilizer and Clifford
Explore advanced quantum error correction through fault-tolerant circuits and twisted quantum doubles, focusing on geometric locality and abelian non-chiral topological phases implementation.
Efficient Quantum Circuits for Port-Based Teleportation
Explore efficient quantum circuit implementations for port-based teleportation, featuring novel methods from representation theory and innovative solutions for both probabilistic and deterministic protocols.
Quantum PCPs: On Adaptivity, Multiple Provers and Reductions to Local Hamiltonians
Delve into advanced quantum PCP theory, exploring adaptivity, multiple unentangled provers, and their connections to local Hamiltonians through rigorous mathematical frameworks and complexity theory analysis.
Polynomial-Time Classical Simulation of Noisy IQP Circuits
Explore groundbreaking research on classical simulation of noisy IQP circuits, revealing how quantum supremacy experiments may be more vulnerable to classical computation than previously known.
Constant-Depth Circuits for Uniformly Controlled Gates and Boolean Functions
Explore constant-depth quantum circuits using Fan-Out and Global Tunable gates, focusing on implementations for Uniformly Controlled Gates and quantum memory applications.
Quantum Cryptography Without One-Way Functions
Explore advanced quantum cryptography concepts and theoretical frameworks that challenge traditional one-way function dependencies in secure communication systems.
Majorization and Passivity in Quantum Information Theory - Lecture 4
Explore majorization and passivity concepts in quantum information theory, focusing on fundamental principles and their applications in advanced quantum systems.
Quantum Generic Hardness for Discrete Logarithms and Integer Factorization
Explore quantum computational complexity of discrete logarithm problems and integer factorization, examining generic algorithms' limitations and establishing new theoretical bounds for quantum operations.
Quantum Complexity of Testing Signed Graph Clusterability
Explore quantum algorithms for testing signed graph clusterability, featuring a novel approach with O(N^1/3) query complexity and proven advantages over classical methods.
Two Prover Perfect Zero Knowledge for MIP* - Theory of Quantum Computation
Delve into advanced quantum computing theory exploring perfect zero-knowledge protocols in MIP* systems, focusing on two-prover implementations and boolean constraint systems for quantum computation.
Tracial Embeddable Strategies - Lifting MIP* Tricks to MIPco
Delve into advanced quantum computation theory exploring tracial embeddable strategies and their applications in approximating two-party correlations in the commuting operator model.
An Improved Quantum Max Cut Approximation via Maximum Matching
Discover groundbreaking improvements in Quantum Max Cut approximation through maximum matching techniques, achieving a 0.595 approximation ratio using simplified 2-qubit state outputs.
Closed-form Analytic Expressions for Shadow Estimation with Brickwork Circuits
Explore closed-form analytical expressions for quantum shadow estimation using brickwork circuits, focusing on two-layer parallel two-local Haar-random unitaries and their practical implementations.