Classical simulation of Gaussian quantum circuits with non-Gaussian input states

• URL: http://arxiv.org/abs/2010.14363v2
• Date: Wed, 14 Apr 2021 01:18:35 GMT
• Title: Classical simulation of Gaussian quantum circuits with non-Gaussian input states
• Authors: Ulysse Chabaud, Giulia Ferrini, Fr\'ed\'eric Grosshans and Damian Markham
• Abstract summary: We generalise the stellar representation of continuous-variable quantum states to the multimode setting and relate the stellar rank of the input non-Gaussian states to the cost of evaluating classically the output probability densities of these circuits. Our results have consequences for the strong simulability of a large class of near-term continuous-variable quantum circuits.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We consider Gaussian quantum circuits supplemented with non-Gaussian input states and derive sufficient conditions for efficient classical strong simulation of these circuits. In particular, we generalise the stellar representation of continuous-variable quantum states to the multimode setting and relate the stellar rank of the input non-Gaussian states, a recently introduced measure of non-Gaussianity, to the cost of evaluating classically the output probability densities of these circuits. Our results have consequences for the strong simulability of a large class of near-term continuous-variable quantum circuits.

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)
• Classically computing performance bounds on depolarized quantum circuits [0.0]
  We compute a certifiable lower bound on the minimum energy attainable by the output state of a quantum circuit in the presence of depolarizing noise. We provide theoretical and numerical evidence that this approach can provide circuit-architecture bounds dependent on the performance of noisy quantum circuits.
  arXiv  Detail & Related papers  (2023-06-28T16:41:56Z)
• Quantum emulation of the transient dynamics in the multistate Landau-Zener model [50.591267188664666]
  We study the transient dynamics in the multistate Landau-Zener model as a function of the Landau-Zener velocity. Our experiments pave the way for more complex simulations with qubits coupled to an engineered bosonic mode spectrum.
  arXiv  Detail & Related papers  (2022-11-26T15:04:11Z)
• Gaussian initializations help deep variational quantum circuits escape from the barren plateau [87.04438831673063]
  Variational quantum circuits have been widely employed in quantum simulation and quantum machine learning in recent years. However, quantum circuits with random structures have poor trainability due to the exponentially vanishing gradient with respect to the circuit depth and the qubit number. This result leads to a general belief that deep quantum circuits will not be feasible for practical tasks.
  arXiv  Detail & Related papers  (2022-03-17T15:06:40Z)
• Quantum non-Gaussianity of multi-phonon states of a single atom [0.7381551917607596]
  We derive the most challenging hierarchy of quantum non-Gaussian criteria for the individual mechanical Fock states. We analyze the depth of quantum non-Gaussian features under mechanical heating and predict their application in quantum sensing.
  arXiv  Detail & Related papers  (2021-11-19T09:58:22Z)
• Non-Gaussian photonic state engineering with the quantum frequency processor [0.7758302353877525]
  Non-Gaussian quantum states of light are critical resources for optical quantum information processing. We introduce a generic approach for non-Gaussian state production from input states populating discrete frequency bins.
  arXiv  Detail & Related papers  (2021-08-18T17:58:42Z)
• Efficient classical computation of expectation values in a class of quantum circuits with an epistemically restricted phase space representation [0.0]
  We devise a classical algorithm which efficiently computes the quantum expectation values arising in a class of continuous variable quantum circuits. The classical computational algorithm exploits a specific restriction in classical phase space which directly captures the quantum uncertainty relation.
  arXiv  Detail & Related papers  (2021-06-21T06:43:34Z)
• Non-Gaussian Quantum States and Where to Find Them [0.0]
  We show how non-Gaussian states can be created by performing measurements on a subset of modes in a Gaussian state. We demonstrate that Wigner negativity is a requirement to violate Bell inequalities and to achieve a quantum computational advantage.
  arXiv  Detail & Related papers  (2021-04-26T13:59:41Z)
• The principle of majorization: application to random quantum circuits [68.8204255655161]
  Three classes of circuits were considered: (i) universal, (ii) classically simulatable, and (iii) neither universal nor classically simulatable. We verified that all the families of circuits satisfy on average the principle of majorization. Clear differences appear in the fluctuations of the Lorenz curves associated to states.
  arXiv  Detail & Related papers  (2021-02-19T16:07:09Z)
• Efficient simulatability of continuous-variable circuits with large Wigner negativity [62.997667081978825]
  Wigner negativity is known to be a necessary resource for computational advantage in several quantum-computing architectures. We identify vast families of circuits that display large, possibly unbounded, Wigner negativity, and yet are classically efficiently simulatable. We derive our results by establishing a link between the simulatability of high-dimensional discrete-variable quantum circuits and bosonic codes.
  arXiv  Detail & Related papers  (2020-05-25T11:03:42Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

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.