Simulating macroscopic quantum correlations in linear networks
- URL: http://arxiv.org/abs/2112.13014v1
- Date: Fri, 24 Dec 2021 09:59:36 GMT
- Title: Simulating macroscopic quantum correlations in linear networks
- Authors: A. Dellios, Peter D. Drummond, Bogdan Opanchuk, Run Yan Teh, and
Margaret D. Reid
- Abstract summary: Even linear quantum networks are nontrivial, as the output photon distributions can be exponentially complex.
The methods used are transformations into equivalent phase-space representations, which can then be treated probabilistically.
This paper provides a tutorial and review of work in this area, to explain quantum phase-space techniques.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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.
Related papers
- Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties?
We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.
We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
arXiv Detail & Related papers (2024-08-22T08:21:28Z) - The curse of random quantum data [62.24825255497622]
We quantify the performances of quantum machine learning in the landscape of quantum data.
We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits.
Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
arXiv Detail & Related papers (2024-08-19T12:18:07Z) - Simulating Gaussian boson sampling quantum computers [68.8204255655161]
We briefly review recent theoretical methods to simulate experimental Gaussian boson sampling networks.
We focus mostly on methods that use phase-space representations of quantum mechanics.
A brief overview of the theory of GBS, recent experiments and other types of methods are also presented.
arXiv Detail & Related papers (2023-08-02T02:03:31Z) - Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
We explore the applicability of quantum-data learning to practical problems in high-energy physics.
We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states.
The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
arXiv Detail & Related papers (2023-06-29T18:00:01Z) - Dimension reduction and redundancy removal through successive Schmidt
decompositions [4.084744267747294]
We study the approximation of matrices and vectors by using their tensor products obtained through successive Schmidt decompositions.
We show that data with distributions such as uniform, Poisson, exponential, or similar to these distributions can be approximated by using only a few terms.
We also show how the method can be used to simplify quantum Hamiltonians.
arXiv Detail & Related papers (2023-02-09T17:47:51Z) - Learnability of the output distributions of local quantum circuits [53.17490581210575]
We investigate, within two different oracle models, the learnability of quantum circuit Born machines.
We first show a negative result, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable.
We show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable.
arXiv Detail & Related papers (2021-10-11T18:00:20Z) - Gaussian boson sampling and multi-particle event optimization by machine
learning in the quantum phase space [0.11421942894219898]
We use neural networks to represent the characteristic function of many-body Gaussian states in the quantum phase space.
We compute boson pattern probabilities by automatic differentiation.
The results are potentially useful to the creation of new sources and complex circuits for quantum technologies.
arXiv Detail & Related papers (2021-02-24T09:08:15Z) - A Derivative-free Method for Quantum Perceptron Training in
Multi-layered Neural Networks [2.962453125262748]
gradient-free approach for training multi-layered neural networks based upon quantum perceptrons.
We make use of measurable operators to define the states of the network in a manner consistent with a Markov process.
arXiv Detail & Related papers (2020-09-23T01:38:34Z) - Scattering in the Ising Model Using Quantum Lanczos Algorithm [0.32228025627337864]
We simulate one-particle propagation and two-particle scattering in the one-dimensional transverse Ising model for 3 and 4 spatial sites on a quantum computer.
Results enable us to compute one- and two-particle transition amplitudes, particle numbers for spatial sites, and the transverse magnetization as functions of time.
arXiv Detail & Related papers (2020-08-20T04:05:52Z) - Machine learning transfer efficiencies for noisy quantum walks [62.997667081978825]
We show that the process of finding requirements on both a graph type and a quantum system coherence can be automated.
The automation is done by using a convolutional neural network of a particular type that learns to understand with which network and under which coherence requirements quantum advantage is possible.
Our results are of importance for demonstration of advantage in quantum experiments and pave the way towards automating scientific research and discoveries.
arXiv Detail & Related papers (2020-01-15T18:36:53Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.