arXiv subjects

Margaret D. Reid

Publications and source records attributed to Margaret D. Reid.

At least 19 recordsLinked to original sources

arXiv2026

Matrix phase-space representations for quantum symmetries

We introduce a general phase-space representation that includes global quantum symmetries in the basis expansion. This method, called matrix phase-space, projects the basis onto a reduced Hilbert space, which can greatly reduce sampling errors of many-body quantum simulations and unifies several previous phase-space methods. The purpose of this paper is to provide detailed proofs of basic theorems and operator identities. We also treat several different types of symmetries. To illustrate the benefits of matrix phase-space methods, we give a detailed derivation of a recent application to the topical problem of verifying the outputs of Gaussian boson sampling (GBS) quantum computers with photon number resolving detectors. This has exponential complexity, and using parity symmetry reduces sampling errors by very large factors relative to earlier methods.

quant-ph↗

arXiv2026

Matrix phase-space representations for gaussian boson sampling

We introduce coherent matrix phase-space distributions. These use conservation laws and symmetries to improve the accuracy and speed of quantum phase-space representations. As an example, this is applied to validation of low-loss Gaussian boson sampling (GBS) quantum computational advantage experiments, where classical generation of the random photon-number counts is exponentially hard. Large improvements in sampling errors are demonstrated compared to previous methods. Matrix phase-space representations also provide a large numerical speed-up, due to their (at worst) quadratic scaling, compared to other methods for validating total count probabilities of large-scale, low-loss GBS networks.

quant-ph↗

arXiv2026

Non-periodic Fourier propagation algorithms for partial differential equations

Spectral methods for partial differential equations (PDEs) with non-periodic boundary conditions arising in computational physics often use polynomial expansions on non-uniform grids. Here, we implement a Fourier method that employs fast trigonometric expansions on a uniform grid with non-periodic boundaries using fast discrete sine transforms (DST) or/and discrete cosine transforms (DCT) to solve parabolic PDEs. We implement this method in two ways: either using a Fourier spectral derivative or a Fourier interaction picture. Both methods can treat vector fields with a combination of Dirichlet and/or Neumann boundary conditions in one or more space dimensions. As examples, we use them to solve a variety of computational physics PDEs with analytical solutions, including the Peregrine solitary wave solution. For the 1D heat equation problem, our method with an interaction picture is accurate up to machine precision. Soluble examples of stochastic partial differential equation (SPDE) with non-periodic boundaries in one and two space dimensions, with physics and interdisciplinary applications are also treated. We compare the results obtained from these algorithms with publicly available solvers that use polynomial spectral methods, and study their relative performance and error scaling. Polynomial methods with non-uniform spatial grids have lower spatial discretization errors when the solutions change slowly in space, typically with large spatial grids. For problems with rapid spatial variation, Fourier methods can outperform polynomial expansions, owing to their smaller maximum space interval, and are generally faster due to the computational efficiency of discrete Fourier transform methods. We verified this by making a complexity analysis in which we studied the total error at the optimum combination of time and space steps for a given resource use.

math.NA↗

arXiv2026

Gaussian boson sampling: Benchmarking quantum advantage

Quantum computers solve intractable problems which classically require an exponentially long time to compute. With the development of large-scale experiments that claim quantum advantage, a vital issue has now emerged. What are the errors, and how do they affect the complexity of the problem solved? Large-scale Gaussian boson sampling (GBS) experiments give an example in which random numbers are generated. Despite classical hardness, these have computable benchmarks for checking data validity. While there are other quantum computing architectures, Gaussian boson sampling is uniquely testable at all scales. Several large, pioneering quantum computing (QC) experiments have been carried out to investigate quantum advantage. Here, we introduce a highly scalable but classical algorithm that can solve GBS approximately. Our numerical simulation of the output count data is closer to the exact solution than current experiments up to 1152 modes. This algorithm outperforms all previous classical, approximate algorithms and scales efficiently to larger experiments. Our results show that effects beyond losses can cause the errors that allow classical simulability. This work will lead to more precise algorithms and is a step towards understanding how QC quantum advantage is affected by the underlying physics.

quant-ph↗

arXiv2025

Validation tests of Gaussian boson samplers with photon-number resolving detectors

An important challenge with the current generation of noisy, large-scale quantum computers is the question of validation. Does the hardware generate correct answers? If not, what are the errors? This issue is often combined with questions of computational advantage, but it is a fundamentally distinct issue. In current experiments, complete validation of the output statistics is generally not possible because it is exponentially hard to do so. Here, we apply phase-space simulation methods to partially verify recent experiments on Gaussian boson sampling (GBS) implementing photon-number resolving (PNR) detectors. The positive-P phase-space distribution is employed, as it uses probabilistic sampling to reduce complexity. It is \sim10^{18} times faster than direct classical simulation for experiments on 288 modes where quantum computational advantage is claimed. When combined with binning and marginalization to improve statistics, multiple validation tests are efficiently computable, of which some tests can be carried out on experimental data. We show that the data as a whole shows discrepancies with theoretical predictions for perfect squeezing. However, a small modification of the GBS parameters greatly improves agreement for some tests. We suggest that such validation tests could form the basis of feedback methods to improve GBS experiments.

quant-ph↗

arXiv2024

The Quantum and Stochastic Toolbox: xSPDE4.2

This is the fourth major release of the xSPDE toolbox, which solves stochastic partial and ordinary differential equations, with applications in biology, chemistry, engineering, medicine, physics and quantum technologies. It computes statistical averages, including time-step and sampling error estimation. xSPDE can provide higher order convergence, Fourier spectra and probability densities. The toolbox has graphical output and $χ^{2}$ statistics, as well as weighted, projected, or forward-backward equations. It can generate input-output quantum spectra. The equations can have independent periodic, Dirichlet, and Neumann or Robin boundary conditions in any dimension, for any vector component, and at either end of any interval. xSPDE has functions that can numerically solve both ordinary and partial differential stochastic equations of any type, obtaining correlations, probabilities and averages. The toolbox has a core treating stochastic differential equations, with averages, probability distributions and full error estimates. There are stochastic extensions treating applications to partial differential equations, projected equations, quantum stochastic equations, master equations and quantum phase-space simulations including Gaussian boson sampling experiments.

quant-ph↗

arXiv2023

Simulating Gaussian boson sampling quantum computers

A growing cohort of experimental linear photonic networks implementing Gaussian boson sampling (GBS) have now claimed quantum advantage. However, many open questions remain on how to effectively verify these experimental results, as scalable methods are needed that fully capture the rich array of quantum correlations generated by these photonic quantum computers. In this paper, we briefly review recent theoretical methods to simulate experimental GBS networks. We focus mostly on methods that use phase-space representations of quantum mechanics, as these methods are highly scalable and can be used to validate experimental outputs and claims of quantum advantage for a variety of input states, ranging from the ideal pure squeezed vacuum state to more realistic thermalized squeezed states. A brief overview of the theory of GBS, recent experiments and other types of methods are also presented. Although this is not an exhaustive review, we aim to provide a brief introduction to phase-space methods applied to linear photonic networks to encourage further theoretical investigations.

quant-ph↗

arXiv2023

Validation tests of GBS quantum computers give evidence for quantum advantage with a decoherent target

Computational validation is vital for all large-scale quantum computers. One needs computers that are both fast and accurate. Here we apply precise, scalable, high order statistical tests to data from large Gaussian boson sampling (GBS) quantum computers that claim quantum computational advantage. These tests can be used to validate the output results for such technologies. Our method allows investigation of accuracy as well as quantum advantage. Such issues have not been investigated in detail before. Our highly scalable technique is also applicable to other applications of linear bosonic networks. We utilize positive-P phase-space simulations of grouped count probabilities (GCP) as a fingerprint for verifying multi-mode data. This is exponentially more efficient than other phase-space methods, due to much lower sampling errors. We randomly generate tests from exponentially many high-order, grouped count tests. Each of these can be efficiently measured and simulated, providing a quantum verification method that is hard to replicate classically. We give a detailed comparison of theory with a 144-channel GBS experiment, including grouped correlations up to the largest order measured. We show how one can disprove faked data, and apply this to a classical count algorithm. There are multiple distance measures for evaluating the fidelity and computational complexity of a distribution. We compute these and explain them. The best fit to the data is a partly thermalized Gaussian model, which is neither the ideal case, nor the model that gives classically computable counts. Even with this model, discrepancies of $Z>100$ were observed from some $χ^2$ tests, indicating likely parameter estimation errors. Total count distributions were much closer to a thermalized quantum model than the classical model, giving evidence consistent with quantum computational advantage for a modified target problem.

quant-ph↗

arXiv2022

Simulating complex networks in phase space: Gaussian boson sampling

We show how phase-space simulations of Gaussian quantum states in a photonic network permit verification of measurable correlations of Gaussian boson sampling (GBS) quantum computers. Our results agree with experiments for up to 100-th order correlations, provided decoherence is included. We extend this to more than 16,000 modes, and describe how to simulate genuine multipartite entanglement.

quant-ph↗

arXiv2021

Full multipartite steering inseparability, genuine multipartite steering and monogamy for continuous variable systems

We derive inequalities sufficient to detect the genuine $N$-partite steering of $N$ distinct systems. Here, we are careful to distinguish between the concepts of full $N$-partite steering inseparability (where steering is confirmed individually for all bipartitions of the $N$ systems, thus negating the bilocal hidden state model for each bipartition) and genuine $N$-partite steering (which excludes all convex combinations of the bilocal hidden state models). Other definitions of multipartite steering are possible and we derive inequalities to detect a stricter genuine $N$-partite steering based on only one trusted site. The inequalities are expressed as variances of quadrature phase amplitudes and thus apply to continuous variable systems. We show how genuine $N$-partite steerable states can be created and detected for the nodes of a network formed from a single-mode squeezed state passed through a sequence of $N-1$ beam splitters. A stronger genuine $N$-partite steering is created, if one uses two squeezed inputs, or $N$ squeezed inputs. We are able to confirm that genuine tripartite steering (by the above definition and the stricter definition) has been realised experimentally. Finally, we analyze how bipartite steering and entanglement is distributed among the systems in the tripartite case, illustrating with monogamy inequalities. While we use Gaussian states to benchmark the criteria, the inequalities derived in this paper are not based on the assumption of Gaussian states, which gives advantage for quantum communication protocols.

quant-ph↗

arXiv2021

Simulating macroscopic quantum correlations in linear networks

Many developing quantum technologies make use of quantum networks of different types. Even linear quantum networks are nontrivial, as the output photon distributions can be exponentially complex. Despite this, they can still be computationally simulated. The methods used are transformations into equivalent phase-space representations, which can then be treated probabilistically. This provides an exceptionally useful tool for the prediction and validation of experimental results, including decoherence. As well as experiments in Gaussian boson sampling, which are intended to demonstrate quantum computational advantage, these methods are applicable to other types of entangled linear quantum networks as well. This paper provides a tutorial and review of work in this area, to explain quantum phase-space techniques using the positive-P and Wigner distributions.

quant-ph↗

arXiv2020

Q-functions as models of physical reality

We show that one may interpret physical reality as random fields in space-time. These have a probability given by the expectation of a coherent state projection operator, called the Q-function. The resulting dynamical evolution includes retrocausal effects. This suggests that a physical universe exists without requiring observers, but with a well-defined probability for its field configuration. By including the meter dynamics, we show that field trajectories have quantum measurement properties without wave-function collapse, including sharp measured eigenvalues. We treat continuous and discrete measurements, and show that this model predicts Bell inequality violations for measurements on correlated spins. A discussion is give of a number of well-known quantum paradoxes, showing how these can be treated in a realistic model of measurement. Our theory resolves a number of practical and philosophical issues in quantum measurement, and we compare it with earlier theories.

quant-ph↗

arXiv2019

Discrete time symmetry breaking in quantum circuits: exact solutions and tunneling

We discuss general properties of discrete time quantum symmetry breaking in degenerate parametric oscillators. Recent experiments in superconducting quantum circuit with Josephson junction nonlinearities give rise to new properties of strong parametric coupling and nonlinearities. Exact analytic solutions are obtained for the steady-state of this single-mode case of subharmonic generation. We also obtain analytic solutions for the tunneling time over which the time symmetry-breaking is lost above threshold. We find that additional anharmonic terms found in the superconducting case increase the tunneling rate, and can also lead to new regimes of tristability as well as bistability. Our analytic results are confirmed by number state calculations.

quant-ph↗

arXiv2019

Schrödinger cats and steady states in subharmonic generation with Kerr nonlinearities

We discuss general properties of the equilibrium state of parametric down-conversion in superconducting quantum circuits with detunings and Kerr anharmonicities, in the strongly nonlinear regime. By comparing moments of the steady state and those of a Schrödinger cat, we show that true Schrödinger cats cannot survive in the steady state if there is any single-photon loss. A delta-function 'cat-like' steady-state distribution can be formed, but this only exists in the limit of an extremely large nonlinearity. The steady state is a mixed state, which is more complex than a mixture or linear combination of delta-functions, and whose purity is reduced by driving. We expect this general behaviour to occur in other driven, dissipative quantum subharmonic non-equilibrium open systems.

quant-ph↗

arXiv2018

Nonlocal pair correlations in a higher-order Bose gas soliton

The truncated Wigner and positive-P phase-space representations are used to study the dynamics of a one-dimensional Bose gas. This allows calculations of the breathing quantum dynamics of higher-order solitons with 10^{3}-10^{5} particles, as in realistic Bose-Einstein condensation (BEC) experiments. Although classically stable, these decay quantum mechanically. Our calculations show that there are large nonlocal correlations. These also violate the Cauchy-Schwarz inequality, showing the presence of nonclassical quantum entanglement.

cond-mat.quant-gas↗

arXiv2018

Robustness of quantum Fourier transform interferometry

We analyse the effect of decoherence and noise on quantum Fourier transform interferometry, in which a boson sampling photonic network is used to measure optical phase gradients. This novel type of metrology is shown to be robust against phase decoherence. One can also measure gradients using lower order correlations without substantial degradation. Our results involve estimation of up to a 100 x 100 matrix permanent.

quant-ph↗

arXiv2018

Quantum fidelity measures for mixed states

Applications of quantum technology often require fidelities to quantify performance. These provide a fundamental yardstick for the comparison of two quantum states. While this is straightforward in the case of pure states, it is much more subtle for the more general case of mixed quantum states often found in practice. A large number of different proposals exist. In this review, we summarize the required properties of a quantum fidelity measure, and compare them, to determine which properties each of the different measures has. We show that there are large classes of measures that satisfy all the required properties of a fidelity measure, just as there are many norms of Hilbert space operators, and many measures of entropy. We compare these fidelities, with detailed proofs of their properties. We also summarize briefly the applications of these measures in teleportation, quantum memories, quantum computers, quantum communications, and quantum phase-space simulations.

quant-ph↗

arXiv2018

Einstein-Podolsky-Rosen steering, depth of steering and planar spin squeezing in two-mode Bose-Einstein condensates

We show how one can prepare and detect entanglement and Einstein-Podolsky-Rosen (EPR) steering between two distinguishable groups (modes) of atoms in a Bose-Einstein condensate (BEC) atom interferometer. Our paper extends previous work that developed criteria for two-mode entanglement and EPR steering based on the reduced variances of two spins defined in a plane. Observation of planar spin squeezing will imply entanglement, and sufficient planar spin squeezing implies EPR steering, between the two groups of atoms. By using a two-mode dynamical model to describe BEC interferometry experiments, we show that the two-mode entanglement and EPR steering criteria are predicted to be satisfied for realistic parameters. The reported observation of spin squeezing in these parameter regimes suggests it is very likely that the criteria can be used to infer an EPR steering between mesoscopic groups of atoms, provided the total atom number can be determined to sub-Poissonian uncertainty. The criteria also apply to a photonic Mach-Zehnder interferometer. Finally, we give a method based on the amount of planar spin squeezing to determine a lower bound on the number of particles that are genuinely comprise the two-mode EPR steerable state - the so-called two-mode EPR steering depth.

quant-ph↗