Výsledky vyhledávání - "O'Leary, Tom"

Report

Resilience-Runtime Tradeoff Relations for Quantum Algorithms

Autor: García-Pintos, Luis Pedro, O'Leary, Tom, Biswas, Tanmoy, Bringewatt, Jacob, Cincio, Lukasz, Brady, Lucas T., Liu, Yi-Kai

A leading approach to algorithm design aims to minimize the number of operations in an algorithm's compilation. One intuitively expects that reducing the number of operations may decrease the chance of errors. This paradigm is particularly prevalent

Externí odkaz: http://arxiv.org/abs/2408.02764

Zobrazit plný text záznamu

Report

Partitioned Quantum Subspace Expansion

Autor: O'Leary, Tom, Anderson, Lewis W., Jaksch, Dieter, Kiffner, Martin

We present an iterative generalisation of the quantum subspace expansion algorithm used with a Krylov basis. The iterative construction connects a sequence of subspaces via their lowest energy states. Diagonalising a Hamiltonian in a given Krylov sub

Externí odkaz: http://arxiv.org/abs/2403.08868

Zobrazit plný text záznamu

Report

Solving lattice gauge theories using the quantum Krylov algorithm and qubitization

Autor: Anderson, Lewis W., Kiffner, Martin, O'Leary, Tom, Crain, Jason, Jaksch, Dieter

Computing vacuum states of lattice gauge theories (LGTs) containing fermionic degrees of freedom can present significant challenges for classical computation using Monte-Carlo methods. Quantum algorithms may offer a pathway towards more scalable comp

Externí odkaz: http://arxiv.org/abs/2403.08859

Zobrazit plný text záznamu

Report

A framework of partial error correction for intermediate-scale quantum computers

Autor: Koukoulekidis, Nikolaos, Wang, Samson, O'Leary, Tom, Bultrini, Daniel, Cincio, Lukasz, Czarnik, Piotr

As quantum computing hardware steadily increases in qubit count and quality, one important question is how to allocate these resources to mitigate the effects of hardware noise. In a transitional era between noisy small-scale and fully fault-tolerant

Externí odkaz: http://arxiv.org/abs/2306.15531

Zobrazit plný text záznamu

Report

Using copies to improve precision in continuous-time quantum computing

Autor: Bennett, Jemma, Callison, Adam, O'Leary, Tom, West, Mia, Chancellor, Nicholas, Kendon, Viv

Publikováno v: Quantum Sci. Technol. 8 035031 (2023)

In the quantum optimisation setting, we build on a scheme introduced by Young et al [PRA 88, 062314, 2013], where physical qubits in multiple copies of a problem encoded into an Ising spin Hamiltonian are linked together to increase the logical syste

Externí odkaz: http://arxiv.org/abs/2206.02545

Zobrazit plný text záznamu