COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Quantum Computing for Quantum Chemistry > Low-Overhead Parallelisation of Linear Combination of Unitaries
Low-Overhead Parallelisation of Linear Combination of UnitariesAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Lila Cadi Tazi. The Linear Combination of Unitaries (LCU) method is a powerful scheme for the block encoding of operators but suffers from high overheads. In this work, we discuss the parallelisation of LCU based on partitioning of observables into groups, as well as the use of adaptive circuits that allow us to perform required Clifford circuits in constant depth. This parallelisation only requires a modest increase in the number of qubits in order to produce an O(n) depth reduction. Our method can significantly reduce the overall space-time volume of the computation, even when including the increase in magic state factories required by parallelisation [1]. [1] G. Boyd, Low-Overhead Parallelisation of LCU via Commuting Operators, arXiv: 2312.00696 (2024) This talk is part of the Quantum Computing for Quantum Chemistry series. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsFERSA Lunchtime Sessions From Genotype to Phenotype: Resources and Challenges (10th June 2009, Hinxton) Assessment PrinciplesOther talksBranching Brownian motion, branching random walks, and the Fisher-KPP equation in spatially random environment Abelian Sandpiles and Abelian Networks On the degree of regular quantum graphs Moral Philosophy and the Dissenting Academies, 1660-1860 Rate, temperature and their coupled effects on the deformation process of polycarbonate and its composite Andrew Chamblin Memorial Lecture 2024 |