Expressibility, entangling power and quantum average causal effect for causally indefinite circuits

• URL: http://arxiv.org/abs/2411.08609v1
• Date: Wed, 13 Nov 2024 13:53:02 GMT
• Title: Expressibility, entangling power and quantum average causal effect for causally indefinite circuits
• Authors: Pedro C. Azado, Guilherme I. Correr, Alexandre Drinko, Ivan Medina, Askery Canabarro, Diogo O. Soares-Pinto,
• Abstract summary: We implement parameterized quantum circuits with definite and indefinite causal order. One of these is the expressibility, which measures how uniformly a given quantum circuit can reach the whole Hilbert space. We find a correlation between the quantum average causal effect and the entangling power.
• Score: 37.69303106863453
• License:
• Abstract: Parameterized quantum circuits are the core of new technologies such as variational quantum algorithms and quantum machine learning, which makes studying its properties a valuable task. We implement parameterized circuits with definite and indefinite causal order and compare their performance under particular descriptors. One of these is the expressibility, which measures how uniformly a given quantum circuit can reach the whole Hilbert space. Another property that we focus on this work is the entanglement capability, more specifically the concurrence and the entangling power. We also find the causal relation between the qubits of our system with the quantum average causal effect measure. We have found that indefinite circuits offer expressibility advantages over definite ones while maintaining the level of entanglement generation. Our results also point to the existence of a correlation between the quantum average causal effect and the entangling power.

Related papers

• An unconditional distribution learning advantage with shallow quantum circuits [0.0]
  We prove an unconditional quantum advantage in the probably approximately correct (PAC) distribution learning framework with shallow quantum circuit hypotheses. We identify a meaningful generative distribution learning problem where constant-depth quantum circuits using one and two qubit gates (QNC0) are superior compared to constant-depth bounded fan-in classical circuits (NC0) as a choice for hypothesis classes.
  arXiv  Detail & Related papers  (2024-11-23T13:03:22Z)
• 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)
• Role of Quantum Coherence in Kinetic Uncertainty Relations [0.0]
  Kinetic Uncertainty Relation (KUR) bounds the signal-to-noise ratio of currents in terms of the number of transitions per unit time. The precise connection between KUR violations and quantum coherence has so far remained elusive.
  arXiv  Detail & Related papers  (2024-07-19T09:26:16Z)
• The sudden death of quantum advantage in correlation generations [1.3999481573773074]
  We show that when the strength of quantum noise continuously goes up from 0, the quantum advantage gradually declines, and eventually fades away completely. Surprisingly, in some cases we observe the sudden death of the quantum advantage, i.e., when the strength of quantum noise exceeds a certain point, the quantum advantage disappears suddenly from a non-negligible level.
  arXiv  Detail & Related papers  (2024-07-03T13:22:53Z)
• Characterizing randomness in parameterized quantum circuits through expressibility and average entanglement [39.58317527488534]
  Quantum Circuits (PQCs) are still not fully understood outside the scope of their principal application. We analyse the generation of random states in PQCs under restrictions on the qubits connectivities. We place a connection between how steep is the increase on the uniformity of the distribution of the generated states and the generation of entanglement.
  arXiv  Detail & Related papers  (2024-05-03T17:32:55Z)
• Playing nonlocal games across a topological phase transition on a quantum computer [0.21990652930491852]
  We introduce a family of multiplayer quantum games for which topologically ordered phases of matter are a resource yielding quantum advantage. We demonstrate this robustness experimentally on Quantinuum's H1-1 quantum computer. We also discuss a topological interpretation of the game, which leads to a natural generalization involving an arbitrary number of players.
  arXiv  Detail & Related papers  (2024-03-07T19:00:01Z)
• Power Characterization of Noisy Quantum Kernels [52.47151453259434]
  We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small. We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
  arXiv  Detail & Related papers  (2024-01-31T01:02:16Z)
• Noisy Quantum Kernel Machines [58.09028887465797]
  An emerging class of quantum learning machines is that based on the paradigm of quantum kernels. We study how dissipation and decoherence affect their performance. We show that decoherence and dissipation can be seen as an implicit regularization for the quantum kernel machines.
  arXiv  Detail & Related papers  (2022-04-26T09:52:02Z)
• Experimental violations of Leggett-Garg's inequalities on a quantum computer [77.34726150561087]
  We experimentally observe the violations of Leggett-Garg-Bell's inequalities on single and multi-qubit systems. Our analysis highlights the limits of nowadays quantum platforms, showing that the above-mentioned correlation functions deviate from theoretical prediction as the number of qubits and the depth of the circuit grow.
  arXiv  Detail & Related papers  (2021-09-06T14:35:15Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)

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.