Complexity phase transitions in instantaneous quantum polynomial-time circuits

• URL: http://arxiv.org/abs/2204.08898v2
• Date: Sat, 24 Jun 2023 09:47:42 GMT
• Title: Complexity phase transitions in instantaneous quantum polynomial-time circuits
• Abstract summary: We study a quantum circuit model with multiple fine-grained complexity phases. Our study reveals that a quantum circuit model can have multiple fine-grained complexity phases.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We study a subclass of the Instantaneous Quantum Polynomial-time (IQP) circuit with a varying density of two-qubit gates. In addition to a known anticoncentration regime, we identify novel parameter conditions where the model is classically simulable or the output distribution follows the Porter-Thomas distribution. By showing that those parameter regimes do not coincide, we argue the presence of more than two phases in the model. The learnability of the output distribution of this model is further studied, which indicates that an energy-based model fails to learn the output distribution even when it is not anticoncentrated. Our study reveals that a quantum circuit model can have multiple fine-grained complexity phases, suggesting the potential for quantum advantage even when the output distribution is far from the Porter-Thomas distribution.

Related papers

• Characterizing Trainability of Instantaneous Quantum Polynomial Circuit Born Machines [7.716642023459826]
  Instantaneous quantum quantum circuit Born machines (IQP-QCBMs) have been proposed as quantum generative models.<n>We show that barren plateaus depend on the generator set and the spectrum of the chosen kernel.<n>We identify regimes in which low-weight-biased kernels avoid exponential suppression in structured topologies.
  arXiv  Detail & Related papers  (2026-02-11T17:12:56Z)
• Limits of quantum generative models with classical sampling hardness [2.321580694317368]
  We study quantum generative models from the perspective of output distributions.<n>We find that models that anticoncentrate are not trainable on average, including those exhibiting quantum advantage.<n>We conclude that quantum advantage can still be found in generative models, although its source must be distinct from anticoncentration.
  arXiv  Detail & Related papers  (2025-12-31T11:40:50Z)
• Quantum Flow Matching [7.246258513838036]
  Quantum Flow Matching offers efficient between two density matrices.<n>QFM can be realized on quantum computers without the need for costly circuit redesigns.<n>These results position QFM as a unifying and promising framework for generative modeling across quantum systems.
  arXiv  Detail & Related papers  (2025-08-17T16:00:20Z)
• Overcoming Dimensional Factorization Limits in Discrete Diffusion Models through Quantum Joint Distribution Learning [79.65014491424151]
  We propose a quantum Discrete Denoising Diffusion Probabilistic Model (QD3PM)<n>It enables joint probability learning through diffusion and denoising in exponentially large Hilbert spaces.<n>This paper establishes a new theoretical paradigm in generative models by leveraging the quantum advantage in joint distribution learning.
  arXiv  Detail & Related papers  (2025-05-08T11:48:21Z)
• Quantum Latent Diffusion Models [65.16624577812436]
  We propose a potential version of a quantum diffusion model that leverages the established idea of classical latent diffusion models. This involves using a traditional autoencoder to reduce images, followed by operations with variational circuits in the latent space. The results demonstrate an advantage in using a quantum version, as evidenced by obtaining better metrics for the images generated by the quantum version.
  arXiv  Detail & Related papers  (2025-01-19T21:24:02Z)
• Amplification of quantum transfer and quantum ratchet [56.47577824219207]
  We study a model of amplification of quantum transfer and making it directed which we call the quantum ratchet model. The ratchet effect is achieved in the quantum control model with dissipation and sink, where the Hamiltonian depends on vibrations in the energy difference synchronized with transitions between energy levels. Amplitude and frequency of the oscillating vibron together with the dephasing rate are the parameters of the quantum ratchet which determine its efficiency.
  arXiv  Detail & Related papers  (2023-12-31T14:04:43Z)
• Normal quantum channels and Markovian correlated two-qubit quantum errors [77.34726150561087]
  We study general normally'' distributed random unitary transformations. On the one hand, a normal distribution induces a unital quantum channel. On the other hand, the diffusive random walk defines a unital quantum process.
  arXiv  Detail & Related papers  (2023-07-25T15:33:28Z)
• Quantum Effects on the Synchronization Dynamics of the Kuramoto Model [62.997667081978825]
  We show that quantum fluctuations hinder the emergence of synchronization, albeit not entirely suppressing it. We derive an analytical expression for the critical coupling, highlighting its dependence on the model parameters.
  arXiv  Detail & Related papers  (2023-06-16T16:41:16Z)
• Quantum Generative Modeling using Parameterized Quantum Circuits [0.0]
  Quantum generative models use the intrinsic probabilistic nature of quantum mechanics to learn and reproduce complex probability distributions.<n>We present an implementation of a 3-qubit quantum circuit Born machine trained to model a 3-bit Gaussian distribution using a Kullback-Leibler (KL) divergence loss and parameter-shift gradient optimization.
  arXiv  Detail & Related papers  (2023-03-25T18:01:50Z)
• Protocols for Trainable and Differentiable Quantum Generative Modelling [21.24186888129542]
  We propose an approach for learning probability distributions as differentiable quantum circuits (DQC) We perform training of a DQC-based model, where data is encoded in a latent space with a phase feature map, followed by a variational quantum circuit. This allows fast sampling from parametrized distributions using a single-shot readout.
  arXiv  Detail & Related papers  (2022-02-16T18:55:48Z)
• Dissipative quantum dynamics, phase transitions and non-Hermitian random matrices [0.0]
  We work in the framework of the dissipative Dicke model which is archetypal of symmetry-breaking phase transitions in open quantum systems. We establish that the Liouvillian describing the quantum dynamics exhibits distinct spectral features of integrable and chaotic character. Our approach can be readily adapted for classifying the nature of quantum dynamics across dissipative critical points in other open quantum systems.
  arXiv  Detail & Related papers  (2021-12-10T19:00:01Z)
• 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)
• Assessment of weak-coupling approximations on a driven two-level system under dissipation [58.720142291102135]
  We study a driven qubit through the numerically exact and non-perturbative method known as the Liouville-von equation with dissipation. We propose a metric that may be used in experiments to map the regime of validity of the Lindblad equation in predicting the steady state of the driven qubit.
  arXiv  Detail & Related papers  (2020-11-11T22:45:57Z)
• Learnability and Complexity of Quantum Samples [26.425493366198207]
  Given a quantum circuit, a quantum computer can sample the output distribution exponentially faster in the number of bits than classical computers. Can we learn the underlying quantum distribution using models with training parameters that scale in n under a fixed training time? We study four kinds of generative models: Deep Boltzmann machine (DBM), Generative Adrial Networks (GANs), Long Short-Term Memory (LSTM) and Autoregressive GAN, on learning quantum data set generated by deep random circuits.
  arXiv  Detail & Related papers  (2020-10-22T18:45:25Z)
• Quantum Statistical Complexity Measure as a Signalling of Correlation Transitions [55.41644538483948]
  We introduce a quantum version for the statistical complexity measure, in the context of quantum information theory, and use it as a signalling function of quantum order-disorder transitions. We apply our measure to two exactly solvable Hamiltonian models, namely: the $1D$-Quantum Ising Model and the Heisenberg XXZ spin-$1/2$ chain. We also compute this measure for one-qubit and two-qubit reduced states for the considered models, and analyse its behaviour across its quantum phase transitions for finite system sizes as well as in the thermodynamic limit by using Bethe ansatz.
  arXiv  Detail & Related papers  (2020-02-05T00:45:21Z)

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.