arXiv subjects

Luke Mortimer

Publications and source records attributed to Luke Mortimer.

10 recordsLinked to original sources

arXiv2026

Bounding many-body properties under partial information and finite measurement statistics

Calculating bounds of properties of many-body quantum systems is of paramount importance, since they guide our understanding of emergent quantum phenomena and complement the insights obtained from estimation methods. Recent semidefinite programming approaches enable probabilistic bounds from finite-shot measurements of easily accessible, yet informationally incomplete, observables. Here we render these methods scalable in the number of qubits by instead utilizing moment-matrix relaxations. After introducing the general formalism, we show how the approach can be adapted with specific knowledge of the system, such as it being the ground state of a given Hamiltonian, possessing specific symmetries or being the steady state of a given Lindbladian. Our approach defines a scalable real-world certification scheme leveraging semidefinite programming relaxations and experimental estimations which, unavoidably, contain shot noise.

quant-ph↗

arXiv2025

Mapping Phase Diagrams of Quantum Spin Systems through Semidefinite-Programming Relaxations

Identifying quantum phase transitions poses a significant challenge in condensed matter physics, as this requires methods that both provide accurate results and scale well with system size. In this work, we demonstrate how relaxation methods can be used to generate the phase diagram for one- and two-dimensional quantum systems. To do so, we formulate a relaxed version of the ground-state problem as a semidefinite program, which we can solve efficiently. Then, by taking the resulting vector of moments for different model parameters, we identify all phase transitions based on their cosine similarity. Furthermore, we show how spontaneous symmetry breaking is naturally captured by bounding the corresponding observable. Using these methods, we reproduce the phase transitions for the one-dimensional transverse field Ising model and the two-dimensional frustrated bilayer Heisenberg model. We also illustrate how the phase diagram of the latter changes when a next-nearest-neighbor interaction is introduced. Overall, our work demonstrates how relaxation methods provide a novel framework for studying and understanding quantum phase transitions.

cond-mat.str-el↗

arXiv2024

Quandoom -- DOOM as a quantum circuit

Since the early 2000s there has existed the meme that "DOOM can run on anything". Whether it be an ATM or a calculator, someone at some point has recompiled DOOM to run on it. Now the quantum computer finally joins the list. More specifically, this project represents the first level of DOOM loosely rewritten using Hadamards and Toffolis which, despite being a universal gate set, has been designed in such a way that it's classically simulable, able to reach 10-20 frames per second on a laptop. The circuit uses 72,376 total qubits and at least 80 million gates, thus it may have use as a benchmark for quantum simulation software.

physics.pop-ph↗

arXiv2024

Bounding Large-Scale Bell Inequalities

Bell inequalities are an important tool for studying non-locality, however quickly become computationally intractable as the system size grows. We consider a novel method for finding an upper bound for the quantum violation of such inequalities by combining the NPA hierarchy, the method of alternating projections, and the memory-efficient optimisation algorithm L-BFGS. Whilst our method may not give the tightest upper bound possible, it often does so several orders of magnitude faster than state-of-the-art solvers, with minimal memory usage, thus allowing solutions to problems that would otherwise be intractable. We benchmark using the well-studied I3322 inequality as well as a more general large-scale randomized inequality RXX22. For randomized inequalities with 130 inputs either side (a first-level moment matrix of size 261x261), our method is ~100x faster than both MOSEK and SCS whilst giving a bound only ~2% above the optimum.

quant-ph↗

arXiv2024

Certifying steady-state properties of open quantum systems

Estimating the steady-state properties of open many-body quantum systems is a fundamental challenge in quantum science and technologies. In this work, we present a scalable approach based on semi-definite programming to derive certified bounds on the expectation value of an arbitrary observable in the steady state of Lindbladian dynamics. We illustrate our method on a series of many-body systems, including paradigmatic spin-1/2 chains and two-dimensional ladders, considering both equilibrium and nonequilibrium steady-states. We benchmark our method with state-of-the-art tensor-network approaches that, unlike our method, are only able to provide estimates, with no guarantee, on steady-state quantities. For the tested models, only modest computational effort is needed to obtain certified non-trivial bounds for system sizes intractable by exact methods. Our method introduces the first general numerical tool for bounding steady-state properties of open quantum dynamics, opening a new avenue in the understanding of stable configurations in many-body systems.

quant-ph↗

arXiv2024

Qudit-inspired optimization for graph coloring

We introduce a quantum-inspired algorithm for graph coloring problems (GCPs) that utilizes qudits in a product state, with each qudit representing a node in the graph and parameterized by d-dimensional spherical coordinates. We propose and benchmark two optimization strategies: qudit gradient descent, initiating qudits in random states and employing gradient descent to minimize a cost function, and qudit local quantum annealing, which adapts the local quantum annealing method to optimize an adiabatic transition from a tractable initial function to a problem-specific cost function. Our approaches are benchmarked against established solutions for standard GCPs, showing that our methods not only rival but frequently surpass the performance of recent state-of-the-art algorithms in terms of solution quality and computational efficiency. The adaptability of our algorithm and its high-quality solutions, achieved with minimal computational resources, point to an advancement in the field of quantum-inspired optimization, with potential applications extending to a broad spectrum of optimization problems.

quant-ph↗

arXiv2023

Reducing Entanglement With Physically-Inspired Fermion-To-Qubit Mappings

In ab-initio electronic structure simulations, fermion-to-qubit mappings represent the initial encoding step of the fermionic problem into qubits. This work introduces a physically-inspired method for constructing mappings that significantly simplify entanglement requirements when simulating states of interest. The presence of electronic excitations drives the construction of our mappings, reducing correlations for target states in the qubit space. To benchmark our method, we simulate ground states of small molecules and observe an enhanced performance when compared to classical and quantum variational approaches from prior research employing conventional mappings. In particular, on the quantum side, our mappings require a reduced number of entangling layers to achieve accuracy for $LiH$, $H_2$, $(H_2)_2$, the $H_4$ stretching and benzene's {\pi} system using the RY hardware efficient ansatz. In addition, our mappings also provide an enhanced ground state simulation performance in the density matrix renormalization group algorithm for the $N_2$ molecule.

quant-ph↗

arXiv2023

Mutually unbiased bases as a commuting polynomial optimisation problem

We consider the problem of mutually unbiased bases as a polynomial optimization problem over the reals. We heavily reduce it using known symmetries before exploring it using two methods, combining a number of optimization techniques. The first of these is a search for bases using Lagrange-multipliers that converges rapidly in case of MUB existence, whilst the second combines a hierarchy of semidefinite programs with branch-and-bound techniques to perform a global search. We demonstrate that such an algorithm would eventually solve the open question regarding dimension 6 with finite memory, although it still remains intractable. We explore the idea that to show the inexistence of bases, it suffices to search for orthonormal vector sets of certain smaller sizes, rather than full bases. We use our two methods to conjecture the minimum set sizes required to show infeasibility, proving it for dimensions 3. The fact that such sub-problems seem to also be infeasible heavily reduces the number of variables, by 66\% in the case of the open problem, potentially providing an large speedup for other algorithms and bringing them into the realm of tractability.

quant-ph↗

arXiv2022

Three numerical approaches to find mutually unbiased bases using Bell inequalities

Mutually unbiased bases correspond to highly useful pairs of measurements in quantum information theory. In the smallest composite dimension, six, it is known that between three and seven mutually unbiased bases exist, with a decades-old conjecture, known as Zauner's conjecture, stating that there exist at most three. Here we tackle Zauner's conjecture numerically through the construction of Bell inequalities for every pair of integers $n,d \ge 2$ that can be maximally violated in dimension $d$ if and only if $n$ MUBs exist in that dimension. Hence we turn Zauner's conjecture into an optimisation problem, which we address by means of three numerical methods: see-saw optimisation, non-linear semidefinite programming and Monte Carlo techniques. All three methods correctly identify the known cases in low dimensions and all suggest that there do not exist four mutually unbiased bases in dimension six, with all finding the same bases that numerically optimise the corresponding Bell inequality. Moreover, these numerical optimisers appear to coincide with the "four most distant bases" in dimension six, found through numerically optimising a distance measure in [P. Raynal, X. L\"u, B.-G. Englert, Phys. Rev. A, 83 062303 (2011)]. Finally, the Monte Carlo results suggest that at most three MUBs exist in dimension ten.

quant-ph↗

arXiv2020

Evolutionary computation for adaptive quantum device design

As Noisy Intermediate-Scale Quantum (NISQ) devices grow in number of qubits, determining good or even adequate parameter configurations for a given application, or for device calibration, becomes a cumbersome task. An evolutionary algorithm is presented here which allows for the automatic tuning of the parameters of any arrangement of coupled qubits, to perform a given task with high fidelity. The algorithm's use is exemplified with the generation of schemes for the distribution of quantum states and the design of multi-qubit gates. The algorithm is demonstrated to converge very rapidly, yielding unforeseeable designs of quantum devices that perform their required tasks with excellent fidelities. Given these promising results, practical scalability and application versatility, the approach has the potential to become a powerful technique to aid the design and calibration of NISQ devices.

quant-ph↗