Francisca Vasconcelos
@franvasco.bsky.social
CS PhD Student @ UC Berkeley
Interested in Quantum Computing & ML
Qubit x Qubit Founding Academic Director
https://franciscavasconcelos.github.io/
Interested in Quantum Computing & ML
Qubit x Qubit Founding Academic Director
https://franciscavasconcelos.github.io/
The full paper, titled "Methods for Reducing Ancilla-Overhead in Block Encodings", can be found on arxiv: arxiv.org/abs/2507.07900
Methods for Reducing Ancilla-Overhead in Block Encodings
Block encodings are a fundamental primitive in quantum algorithms, but can often have large ancilla overhead. In this work, we introduce novel techniques for reducing this overhead in two distinct way...
arxiv.org
September 23, 2025 at 3:06 AM
The full paper, titled "Methods for Reducing Ancilla-Overhead in Block Encodings", can be found on arxiv: arxiv.org/abs/2507.07900
Beyond cryptographic implications, our approach yields novel average‑case learning lower bounds for QAC⁰ and suggests a new path towards proving Parity ∉ QAC⁰, a longstanding open problem in quantum complexity.
August 19, 2025 at 12:22 AM
Beyond cryptographic implications, our approach yields novel average‑case learning lower bounds for QAC⁰ and suggests a new path towards proving Parity ∉ QAC⁰, a longstanding open problem in quantum complexity.
Namely, by considering physically motivated models of computation—such as QAC⁰ and constant-depth circuits with mid-circuit measurements—we surpass prior constructions requiring Θ(log log n) depth.
August 19, 2025 at 12:22 AM
Namely, by considering physically motivated models of computation—such as QAC⁰ and constant-depth circuits with mid-circuit measurements—we surpass prior constructions requiring Θ(log log n) depth.
Thanks Henry 😊
December 18, 2024 at 8:52 PM
Thanks Henry 😊