Classical simulation of lossy boson sampling using matrix product
operators
- URL: http://arxiv.org/abs/2101.11234v3
- Date: Thu, 5 Aug 2021 17:47:23 GMT
- Title: Classical simulation of lossy boson sampling using matrix product
operators
- Authors: Changhun Oh, Kyungjoo Noh, Bill Fefferman, Liang Jiang
- Abstract summary: We numerically investigate the computational power of NISQ devices focusing on boson sampling.
We show by simulating lossy boson sampling using an MPO that as an input photon number grows, its computational cost, or MPO EE, behaves differently depending on a loss-scaling.
- Score: 3.696640001804864
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Characterizing the computational advantage from noisy intermediate-scale
quantum (NISQ) devices is an important task from theoretical and practical
perspectives. Here, we numerically investigate the computational power of NISQ
devices focusing on boson sampling, one of the well-known promising problems
which can exhibit quantum supremacy. We study hardness of lossy boson sampling
using matrix product operator (MPO) simulation to address the effect of
photon-loss on classical simulability using MPO entanglement entropy (EE),
which characterizes a running time of an MPO algorithm. An advantage of MPO
simulation over other classical algorithms proposed to date is that its
simulation accuracy can be efficiently controlled by increasing an MPO's bond
dimension. Notably, we show by simulating lossy boson sampling using an MPO
that as an input photon number grows, its computational cost, or MPO EE,
behaves differently depending on a loss-scaling, exhibiting a different feature
from that of lossless boson sampling. Especially when an output photon number
scales faster than the square root of an input photon number, our study shows
an exponential scaling of time complexity for MPO simulation. On the contrary,
when an output photon number scales slower than the square root of an input
photon number, MPO EE may decrease, indicating that an exponential time
complexity might not be necessary.
Related papers
- Quantum Computing Simulation of a Mixed Spin-Boson Hamiltonian and Its Performance for a Cavity Quantum Electrodynamics Problem [0.0]
We present a methodology for simulating a phase transition in a pair of cavities that permit photon hopping.
We find that the simulation can be performed with a modest amount of quantum resources.
arXiv Detail & Related papers (2023-10-17T15:25:35Z) - Robust Extraction of Thermal Observables from State Sampling and
Real-Time Dynamics on Quantum Computers [49.1574468325115]
We introduce a technique that imposes constraints on the density of states, most notably its non-negativity, and show that this way, we can reliably extract Boltzmann weights from noisy time series.
Our work enables the implementation of the time-series algorithm on present-day quantum computers to study finite temperature properties of many-body quantum systems.
arXiv Detail & Related papers (2023-05-30T18:00:05Z) - Simulating lossy Gaussian boson sampling with matrix product operators [7.33258560389563]
We show that efficient tensor network simulations are likely possible under the $N_textoutproptosqrtN$ scaling of the number of surviving photons.
We overcome previous challenges due to the large local space dimensions in Gaussian boson sampling with hardware acceleration.
arXiv Detail & Related papers (2023-01-30T12:10:39Z) - Importance sampling for stochastic quantum simulations [68.8204255655161]
We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients.
We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage.
Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
arXiv Detail & Related papers (2022-12-12T15:06:32Z) - Simulating the Mott transition on a noisy digital quantum computer via
Cartan-based fast-forwarding circuits [62.73367618671969]
Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model.
Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models.
This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
arXiv Detail & Related papers (2021-12-10T17:32:15Z) - Classical simulation of boson sampling based on graph structure [2.5496329090462626]
We present classical sampling algorithms for single-photon and Gaussian input states that take advantage of a graph structure of a linear-optical circuit.
We show that when the circuit depth is less than the quadratic in the lattice spacing, the efficient simulation is possible with an exponentially small error.
We implement a likelihood test with a recent numerically Gaussian boson sampling experiment and show that the treewidth-based algorithm with a limited treewidth renders a larger likelihood than the experimental data.
arXiv Detail & Related papers (2021-10-04T17:02:35Z) - Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
We present a constructive algorithm for generating quantum circuits with time-independent depth.
We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model.
In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
arXiv Detail & Related papers (2021-04-01T19:06:00Z) - Continuous-time dynamics and error scaling of noisy highly-entangling
quantum circuits [58.720142291102135]
We simulate a noisy quantum Fourier transform processor with up to 21 qubits.
We take into account microscopic dissipative processes rather than relying on digital error models.
We show that depending on the dissipative mechanisms at play, the choice of input state has a strong impact on the performance of the quantum algorithm.
arXiv Detail & Related papers (2021-02-08T14:55:44Z) - Fast and differentiable simulation of driven quantum systems [58.720142291102135]
We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods.
We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
arXiv Detail & Related papers (2020-12-16T21:43:38Z) - Quadratic speedup for simulating Gaussian boson sampling [0.9236074230806577]
We introduce an algorithm for the classical simulation of Gaussian boson sampling that is quadratically faster than previously known methods.
The complexity of the algorithm is exponential in the number of photon pairs detected, not the number of photons.
We show that an improved loop hafnian algorithm can be used to compute pure-state probabilities without the need of a supercomputer.
arXiv Detail & Related papers (2020-10-29T13:53:30Z) - Efficient classical simulation of noisy random quantum circuits in one
dimension [4.154652903729955]
We study noisy random circuit sampling in one dimension (or 1D noisy RCS) as a simple model for exploring the effects of noise on the computational power of a noisy quantum device.
We numerically demonstrate that for the two-qubit gate error rates we considered, there exists a characteristic system size above which adding more qubits does not bring about an exponential growth of the cost of classical MPO simulation.
arXiv Detail & Related papers (2020-03-29T23:55:16Z)
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.