Sam Pallister

Sam Pallister

Auto-generated profile, based on publicly available information

Sam Pallister

School of Mathematics, University of Bristol, Bristol BS8 1TW, United Kingdom

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 March 2016 in Physical Review A
Verified
Journal Article
Closed access
PDF file
AMAshley Montanaro
Ashley Montanaro
SPSam Pallister
Sam Pallister
The finite element method is used to approximately solve boundary value problems for differential equations. The method discretizes the parameter space and finds an approximate solution by solving a large system of linear equations. Here we investigate the extent to which the finite element method can be accelerated using an efficient quantum algorithm for solving linear equations. We consider the representative general question of approximately computing a linear functional of the solution to a boundary value problem and compare the quantum algorithm's theoretical performance with that of a standard classical algorithm—the conjugate gradient method. Prior work claimed that the quantum algorithm could be exponentially faster but did not determine the overall classical and quantum run times required to achieve a predetermined solution accuracy. Taking this into account, we find that the quantum algorithm can achieve a polynomial speedup, the extent of which grows with the dimension of the partial differential equation. In addition, we give evidence that no improvement of the quantum algorithm can lead to a superpolynomial speedup when the dimension is fixed and the solution satisfies certain smoothness properties.

24 April 2018 in Physical Review Letters
Verified
Journal Article
Open access
PDF file
SPSam Pallister
Sam Pallister
NLNoah Linden
Noah Linden
AMAshley Montanaro
Ashley Montanaro
Consider the task of verifying that a given quantum device, designed to produce a particular entangled state, does indeed produce that state. One natural approach would be to characterize the output state by quantum state tomography, or alternatively, to perform some kind of Bell test, tailored to the state of interest. We show here that neither approach is optimal among local verification strategies for 2-qubit states. We find the optimal strategy in this case and show that quadratically fewer total measurements are needed to verify to within a given fidelity than in published results for quantum state tomography, Bell test, or fidelity estimation protocols. We also give efficient verification protocols for any stabilizer state. Additionally, we show that requiring that the strategy be constructed from local, nonadaptive, and noncollective measurements only incurs a constant-factor penalty over a strategy without these restrictions.

7 April 2022 in Physical Review Research
Verified
Journal Article
Open access
PDF file
IKIsaac H. Kim
Isaac H. Kim
YLYe-Hua Liu
Ye-Hua Liu
SPSam Pallister
Sam Pallister
WPWilliam Pol
William Pol
SRSam Roberts
Sam Roberts
ELEunseok Lee
Eunseok Lee
We estimate the resources required in the fusion-based quantum computing scheme to simulate electrolyte molecules in Li-ion batteries on a fault-tolerant, photonic quantum computer. We focus on the molecules that can provide practical solutions to industrially relevant problems. Certain fault-tolerant operations require the use of single-qubit “magic states” prepared by dedicated “magic state factories” (MSFs). Producing and consuming magic states in parallel is typically a prohibitively expensive task, resulting in the serial application of fault-tolerant gates. However, for the systems considered, the MSF constitutes a negligible fraction of the total footprint of the quantum computer, allowing for the use of multiple MSFs to produce magic states in parallel. We suggest architectural and algorithmic techniques that can accommodate such a capability. We propose a method to consume multiple magic states simultaneously, which can potentially lead to an order of magnitude reduction in the computational runtime without additional expense in the footprint.

7 February 2017 in EPJ Quantum Technology
Verified
Journal Article
Open access
PDF file
SPSam Pallister
Sam Pallister
SCSimon Coop
Simon Coop
VFValerio Formichella
Valerio Formichella
NGNicolas Gampierakis
Nicolas Gampierakis
VNVirginia Notaro
Virginia Notaro
MYMadeleine Yttergren
Madeleine Yttergren
In this paper we propose an experiment designed to observe a general-relativistic effect on single photon interference. The experiment consists of a folded Mach-Zehnder interferometer, with the arms distributed between a single Earth orbiter and a ground station. By compensating for other degrees of freedom and the motion of the orbiter, this setup aims to detect the influence of general relativistic time dilation on a spatially superposed single photon. The proposal details a payload to measure the required effect, along with an extensive feasibility analysis given current technological capabilities.

29 December 2025 in PRX Quantum
Verified
Journal Article
Open access
DJDavid Jennings
David Jennings
MLMatteo Lostaglio
Matteo Lostaglio
SPSam Pallister
Sam Pallister
ASAndrew T. Sornborger
Andrew T. Sornborger
YSYiğit Subaşı
Yiğit Subaşı
Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. Subaşı . [Phys. Rev. Lett. 122, 060504 (2019)] proposed a randomized algorithm inspired by adiabatic quantum computing, based on a sequence of random Hamiltonian simulation steps, with suboptimal scaling in the condition number κ of the linear system and the target error ϵ . Here we go beyond these results in several ways. Firstly, using filtering [Lin and Tong, Quantum 4, 361 (2020)] and Poissonization techniques [Cunningham and Roland, ArXiv:2406.03972 (2024)], the algorithm complexity is improved to the optimal scaling O ( κ log  ( 1 / ϵ ) ) —an exponential improvement in ϵ , and a shaving of a log  κ scaling factor in κ . Secondly, the algorithm is further modified to achieve constant factor improvements, which are vital as we progress towards hardware implementations on fault-tolerant devices. We introduce a cheaper randomized walk operator method replacing Hamiltonian simulation—which also removes the need for potentially challenging classical precomputations; randomized routines are sampled over optimized random variables; circuit constructions are improved. We obtain a closed formula rigorously upper bounding the expected number of times one needs to apply a block-encoding of the linear system matrix to output a quantum state encoding the solution to the linear system. The upper bound is 837 κ at ϵ = 10 − 10 for Hermitian matrices.

4 November 2016 in arXiv
Verified
Preprint
Open access
PDF file
SPSam Pallister
Sam Pallister
SCSimon Coop
Simon Coop
VFValerio Formichella
Valerio Formichella
NGNicolas Gampierakis
Nicolas Gampierakis
VNVirginia Notaro
Virginia Notaro
MYMadeleine Yttergren
Madeleine Yttergren
In this paper we propose an experiment designed to observe a general-relativistic effect on single photon interference. The experiment consists of a folded Mach-Zehnder interferometer, with the arms distributed between a single Earth orbiter and a ground station. By compensating for other degrees of freedom and the motion of the orbiter, this setup aims to detect the influence of general relativistic time dilation on a spatially superposed single photon. The proposal details a payload to measure the required effect, along with an extensive feasibility analysis given current technological capabilities.