arXiv subjects

Thomas R. Bromley

Publications and source records attributed to Thomas R. Bromley.

At least 19 recordsLinked to original sources

arXiv2026

Multivariate quantum state preparation with optimized tensor networks

Quantics tensor trains are attracting intense interest for quantum-inspired computing and quantum state preparation. These methods, which approximate continuum functions by representing their amplitude encoding as a matrix product state (MPS), are exceedingly powerful for univariate functions but rapidly become challenging when handling multivariate functions, since the linear chain topology leads to a large distance between highly-entangled qubits. We overcome this limitation by introducing SCENT (Spectral Clustering for Entanglement miNimizing Trees). SCENT is a protocol that utilizes efficiently-computable pairwise entanglement metrics to determine a suitable tree tensor network (TTN) structure, which can then be efficiently approximated using tensor cross-interpolation (TCI); we find that it substantially outperforms MPS methods and improves upon previous TTN methods. We then apply these optimized TTNs to state preparation, introducing an approximate circuit compilation method based on environment-tensor methods without significantly conceding overall accuracy. Importantly, the inherent gauge freedom of TTNs can be directly exploited in this method, resulting in higher fidelity at a given circuit depth. We demonstrate this quantum state-preparation pipeline on archetypal state-preparation problems in quantum chemistry and financial portfolio optimization. In our flagship demonstration, we encode a 20-variable probability distribution with long-ranged, non-nearest neighbor inter-variable correlations in a 200-qubit state-preparation circuit with infidelity $7.44\times 10^{-9}$ using only 43284 CNOTs; depth and fidelity can be traded, allowing the same distribution to be prepared to infidelity $10^{-3}$ with as few as 5584 CNOTs.

quant-ph↗

arXiv2026

Fullqubit alchemist: Quantum algorithm for alchemical free energy calculations

Accurately computing the free energies of biological processes is a cornerstone of computer-aided drug design, but it is a daunting task. The need to sample vast conformational spaces and account for entropic contributions makes the estimation of binding free energies very expensive. While classical methods, such as thermodynamic integration and alchemical free energy calculations, have significantly contributed to reducing computational costs, they still face limitations in terms of efficiency and scalability. We tackle this through a quantum algorithm for the estimation of free energy differences by adapting the existing Liouvillian approach and introducing several key algorithmic improvements. We directly implement the Liouvillian operator and provide an efficient description of electronic forces acting on both nuclear and electronic particles on the quantum ground state potential energy surface. This leads to super-polynomial runtime scaling improvements in the precision of our Liouvillian simulation approach and quadratic improvements in the scaling with the number of particles relative to prior quantum algorithms. Second, our algorithm calculates free energy differences via a fully quantum implementation of thermodynamic integration and alchemy, thereby foregoing expensive entropy estimation subroutines used in prior works. Our results open new avenues towards the application of quantum computers in drug discovery.

quant-ph↗

arXiv2024

Quantum Monte Carlo for Economics: Stress Testing and Macroeconomic Deep Learning

Computational methods both open the frontiers of economic analysis and serve as a bottleneck in what can be achieved. We are the first to study whether Quantum Monte Carlo (QMC) algorithm can improve the runtime of economic applications and challenges in doing so. We provide a detailed introduction to quantum computing and especially the QMC algorithm. Then, we illustrate how to formulate and encode into quantum circuits (a) a bank stress testing model with credit shocks and fire sales, (b) a neoclassical investment model solved with deep learning, and (c) a realistic macro model solved with deep neural networks. We discuss potential computational gains of QMC versus classical computing systems and present a few innovations in benchmarking QMC.

quant-ph↗

arXiv2023

Fast quantum circuit cutting with randomized measurements

We propose a new method to extend the size of a quantum computation beyond the number of physical qubits available on a single device. This is accomplished by randomly inserting measure-and-prepare channels to express the output state of a large circuit as a separable state across distinct devices. Our method employs randomized measurements, resulting in a sample overhead that is $\widetilde{O}(4^k / \varepsilon ^2)$, where $\varepsilon $ is the accuracy of the computation and $k$ the number of parallel wires that are "cut" to obtain smaller sub-circuits. We also show an information-theoretic lower bound of $Ω(2^k / \varepsilon ^2)$ for any comparable procedure. We use our techniques to show that circuits in the Quantum Approximate Optimization Algorithm (QAOA) with $p$ entangling layers can be simulated by circuits on a fraction of the original number of qubits with an overhead that is roughly $2^{O(pκ)}$, where $κ$ is the size of a known balanced vertex separator of the graph which encodes the optimization problem. We obtain numerical evidence of practical speedups using our method applied to the QAOA, compared to prior work. Finally, we investigate the practical feasibility of applying the circuit cutting procedure to large-scale QAOA problems on clustered graphs by using a $30$-qubit simulator to evaluate the variational energy of a $129$-qubit problem as well as carry out a $62$-qubit optimization.

quant-ph↗

arXiv2021

Estimating the gradient and higher-order derivatives on quantum hardware

For a large class of variational quantum circuits, we show how arbitrary-order derivatives can be analytically evaluated in terms of simple parameter-shift rules, i.e., by running the same circuit with different shifts of the parameters. As particular cases, we obtain parameter-shift rules for the Hessian of an expectation value and for the metric tensor of a variational state, both of which can be efficiently used to analytically implement second-order optimization algorithms on a quantum computer. We also consider the impact of statistical noise by studying the mean squared error of different derivative estimators. In the second part of this work, some of the theoretical techniques for evaluating quantum derivatives are applied to their typical use case: the implementation of quantum optimizers. We find that the performance of different estimators and optimizers is intertwined with the values of different hyperparameters, such as a step size or a number of shots. Our findings are supported by several numerical and hardware experiments, including an experimental estimation of the Hessian of a simple variational circuit and an implementation of the Newton optimizer.

quant-ph↗

arXiv2020

Transfer learning in hybrid classical-quantum neural networks

We extend the concept of transfer learning, widely applied in modern machine learning algorithms, to the emerging context of hybrid neural networks composed of classical and quantum elements. We propose different implementations of hybrid transfer learning, but we focus mainly on the paradigm in which a pre-trained classical network is modified and augmented by a final variational quantum circuit. This approach is particularly attractive in the current era of intermediate-scale quantum technology since it allows to optimally pre-process high dimensional data (e.g., images) with any state-of-the-art classical network and to embed a select set of highly informative features into a quantum processor. We present several proof-of-concept examples of the convenient application of quantum transfer learning for image recognition and quantum state classification. We use the cross-platform software library PennyLane to experimentally test a high-resolution image classifier with two different quantum computers, respectively provided by IBM and Rigetti.

quant-ph↗

arXiv2019

Applications of Near-Term Photonic Quantum Computers: Software and Algorithms

Gaussian Boson Sampling (GBS) is a near-term platform for photonic quantum computing. Recent efforts have led to the discovery of GBS algorithms with applications to graph-based problems, point processes, and molecular vibronic spectra in chemistry. The development of dedicated quantum software is a key enabler in permitting users to program devices and implement algorithms. In this work, we introduce a new applications layer for the Strawberry Fields photonic quantum computing library. The applications layer provides users with the necessary tools to design and implement algorithms using GBS with only a few lines of code. This paper serves a dual role as an introduction to the software, supported with example code, and also a review of the current state of the art in GBS algorithms.

quant-ph↗

arXiv2019

Demonstrating quantum coherence and metrology that is resilient to transversal noise

Quantum systems can be exploited for disruptive technologies but in practice quantum features are fragile due to noisy environments. Quantum coherence, a fundamental such feature, is a basis-dependent property that is known to exhibit a resilience to certain types of Markovian noise. Yet, it is still unclear whether this resilience can be relevant in practical tasks. Here, we experimentally investigate the resilient effect of quantum coherence in a photonic Greenberger-Horne-Zeilinger state under Markovian bit-flip noise, and explore its applications in a noisy metrology scenario. In particular, using up to six-qubit probes, we demonstrate that the standard quantum limit can be outperformed under a transversal noise strength of approximately equal magnitude to the signal, providing experimental evidence of metrological advantage even in the presence of uncorrelated Markovian noise. This work highlights the important role of passive control in noisy quantum hardware, which can act as a low-overhead complement to more traditional approaches such as quantum error correction, thus impacting on the deployment of quantum technologies in real-world settings.

quant-ph↗

arXiv2019

Batched quantum state exponentiation and quantum Hebbian learning

Machine learning is a crucial aspect of artificial intelligence. This paper details an approach for quantum Hebbian learning through a batched version of quantum state exponentiation. Here, batches of quantum data are interacted with learning and processing quantum bits (qubits) by a series of elementary controlled partial swap operations, resulting in a Hamiltonian simulation of the statistical ensemble of the data. We decompose this elementary operation into one and two qubit quantum gates from the Clifford+T set and use the decomposition to perform an efficiency analysis. Our construction of quantum Hebbian learning is motivated by extension from the established classical approach, and it can be used to find details about the data such as eigenvalues through phase estimation. This work contributes to the near-term development and implementation of quantum machine learning techniques.

quant-ph↗

arXiv2018

Accessible bounds for general quantum resources

The recent development of general quantum resource theories has given a sound basis for the quantification of useful quantum effects. Nevertheless, the evaluation of a resource measure can be highly non-trivial, involving an optimisation that is often intractable analytically or intensive numerically. In this paper, we describe a general framework that provides quantitative lower bounds to any resource quantifier that satisfies the essential property of monotonicity under the corresponding set of free operations. Our framework relies on projecting all quantum states onto a restricted subset using a fixed resource non-increasing operation. The resources of the resultant family can then be evaluated using a simplified optimisation, with the result providing lower bounds on the resource contents of any state. This approach also reduces the experimental overhead, requiring only the relevant statistics of the restricted family of states. We illustrate the application of our framework by focusing on the resource of multiqubit entanglement and outline applications to other quantum resources.

quant-ph↗

arXiv2018

Quantum Hopfield neural network

Quantum computing allows for the potential of significant advancements in both the speed and the capacity of widely used machine learning techniques. Here we employ quantum algorithms for the Hopfield network, which can be used for pattern recognition, reconstruction, and optimization as a realization of a content-addressable memory system. We show that an exponentially large network can be stored in a polynomial number of quantum bits by encoding the network into the amplitudes of quantum states. By introducing a classical technique for operating the Hopfield network, we can leverage quantum algorithms to obtain a quantum computational complexity that is logarithmic in the dimension of the data. We also present an application of our method as a genetic sequence recognizer.

quant-ph↗

arXiv2018

Classical benchmarking of Gaussian Boson Sampling on the Titan supercomputer

Gaussian Boson Sampling is a model of photonic quantum computing where single-mode squeezed states are sent through linear-optical interferometers and measured using single-photon detectors. In this work, we employ a recent exact sampling algorithm for GBS with threshold detectors to perform classical simulations on the Titan supercomputer. We determine the time and memory resources as well as the amount of computational nodes required to produce samples for different numbers of modes and detector clicks. It is possible to simulate a system with 800 optical modes postselected on outputs with 20 detector clicks, producing a single sample in roughly two hours using $40\%$ of the available nodes of Titan. Additionally, we benchmark the performance of GBS when applied to dense subgraph identification, even in the presence of photon loss. We perform sampling for several graphs containing as many as 200 vertices. Our findings indicate that large losses can be tolerated and that the use of threshold detectors is preferable over using photon-number-resolving detectors postselected on collision-free outputs.

quant-ph↗

arXiv2018

Photonic quantum algorithm for Monte Carlo integration

We present a continuous-variable photonic quantum algorithm for the Monte Carlo evaluation of multi-dimensional integrals. Our algorithm encodes n-dimensional integration into n+3 modes and can provide a quadratic speedup in runtime compared to the classical Monte Carlo approach. The speedup is achieved by developing a continuous-variable adaptation of amplitude estimation. We provide an error analysis for each element of the algorithm and account for the effects of finite squeezing. Our findings show that Monte Carlo integration is a natural use case for algorithms using the continuous-variable setting.

quant-ph↗

arXiv2018

Certification and Quantification of Multilevel Quantum Coherence

Quantum coherence, present whenever a quantum system exists in a superposition of multiple classically distinct states, marks one of the fundamental departures from classical physics. Quantum coherence has recently been investigated rigorously within a resource-theoretic formalism. However, the finer-grained notion of multilevel coherence, which explicitly takes into account the number of superposed classical states, has remained relatively unexplored. A comprehensive analysis of multi-level coherence, which acts as the single-party analogue to multi-partite entanglement, is essential for understanding natural quantum processes as well as for gauging the performance of quantum technologies. Here we develop the theoretical and experimental groundwork for characterizing and quantifying multilevel coherence. We prove that non-trivial levels of purity are required for multilevel coherence, as there is a ball of states around the maximally mixed state that do not exhibit multilevel coherence in any basis. We provide a simple necessary and sufficient analytical criterion to verify multilevel coherence, which leads to a complete classification for three-level systems. We present the robustness of multilevel coherence, a bona fide quantifier which we show to be numerically computable via semidefinite programming and experimentally accessible via multilevel coherence witnesses. We further verify and lower-bound the robustness of multilevel coherence by performing a semi-device-independent phase discrimination task, implemented experimentally with four-level probes in a photonic setup. Our results contribute to understanding the operational relevance of genuine multilevel coherence, also by demonstrating the key role it plays in enhanced phase discrimination---a primitive for quantum communication and metrology---and suggest new ways to reliably test the quantum behaviour of physical systems.

quant-ph↗

arXiv2018

Quantum computational finance: Monte Carlo pricing of financial derivatives

Financial derivatives are contracts that can have a complex payoff dependent upon underlying benchmark assets. In this work, we present a quantum algorithm for the Monte Carlo pricing of financial derivatives. We show how the relevant probability distributions can be prepared in quantum superposition, the payoff functions can be implemented via quantum circuits, and the price of financial derivatives can be extracted via quantum measurements. We show how the amplitude estimation algorithm can be applied to achieve a quadratic quantum speedup in the number of steps required to obtain an estimate for the price with high confidence. This work provides a starting point for further research at the interface of quantum computing and finance.

quant-ph↗

arXiv2018

Quantum approximate optimization with Gaussian boson sampling

Hard optimization problems are often approached by finding approximate solutions. Here, we highlight the concept of proportional sampling and discuss how it can be used to improve the performance of stochastic algorithms for optimization. We introduce an NP-Hard problem called Max-Haf and show that Gaussian boson sampling (GBS) can be used to enhance any stochastic algorithm for this problem. These results are applied by enhancing the random search, simulated annealing, and greedy algorithms. With numerical simulations, we confirm that all algorithms are improved when employing GBS, and that GBS-enhanced random search performs the best despite being the one with the simplest underlying classical routine.

quant-ph↗

arXiv2018

Using Gaussian Boson Sampling to Find Dense Subgraphs

Boson sampling devices are a prime candidate for exhibiting quantum supremacy, yet their application for solving problems of practical interest is less well understood. Here we show that Gaussian boson sampling (GBS) can be used for dense subgraph identification. Focusing on the NP-hard densest k-subgraph problem, we find that stochastic algorithms are enhanced through GBS, which selects dense subgraphs with high probability. These findings rely on a link between graph density and the number of perfect matchings -- enumerated by the Hafnian -- which is the relevant quantity determining sampling probabilities in GBS. We test our findings by constructing GBS-enhanced versions of the random search and simulated annealing algorithms and apply them through numerical simulations of GBS to identify the densest subgraph of a 30 vertex graph.

quant-ph↗

arXiv2018

Machine learning method for state preparation and gate synthesis on photonic quantum computers

We show how techniques from machine learning and optimization can be used to find circuits of photonic quantum computers that perform a desired transformation between input and output states. In the simplest case of a single input state, our method discovers circuits for preparing a desired quantum state. In the more general case of several input and output relations, our method obtains circuits that reproduce the action of a target unitary transformation. We use a continuous-variable quantum neural network as the circuit architecture. The network is composed of several layers of optical gates with variable parameters that are optimized by applying automatic differentiation using the TensorFlow backend of the Strawberry Fields photonic quantum computer simulator. We demonstrate the power and versatility of our methods by learning how to use short-depth circuits to synthesize single photons, Gottesman-Kitaev-Preskill states, NOON states, cubic phase gates, random unitaries, cross-Kerr interactions, as well as several other states and gates. We routinely obtain high fidelities above 99\% using short-depth circuits, typically consisting of a few hundred gates. The circuits are obtained automatically by simply specifying the target state or gate and running the optimization algorithm.

quant-ph↗