Geometrical Aspects Of Resources Distribution In Quantum Random Circuits

• URL: http://arxiv.org/abs/2405.01650v1
• Date: Thu, 2 May 2024 18:13:04 GMT
• Title: Geometrical Aspects Of Resources Distribution In Quantum Random Circuits
• Authors: Andrés Camilo Granda Arango, Federico Hernan Holik, Giuseppe Sergioli, Roberto Giuntini,
• Abstract summary: We focus on multipartite non-locality, but we also analyze quantum correlations by appealing to different entanglement and non-classicality measures. We compare universal vs non-universal sets of gates to gain insight into the problem of explaining quantum advantage.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this work, we explore how resources are distributed among the states generated by quantum random circuits (QRC). We focus on multipartite non-locality, but we also analyze quantum correlations by appealing to different entanglement and non-classicality measures. We compare universal vs non-universal sets of gates to gain insight into the problem of explaining quantum advantage. By comparing the results obtained with ideal (noiseless) vs noisy intermediate-scale quantum (NISQ) devices, we lay the basis of a certification protocol, which aims to quantify how robust is the resources distribution among the states that a given device can generate.

Related papers

• Guarantees on the structure of experimental quantum networks [109.08741987555818]
  Quantum networks connect and supply a large number of nodes with multi-party quantum resources for secure communication, networked quantum computing and distributed sensing. As these networks grow in size, certification tools will be required to answer questions regarding their properties. We demonstrate a general method to guarantee that certain correlations cannot be generated in a given quantum network.
  arXiv  Detail & Related papers  (2024-03-04T19:00:00Z)
• Enhancing Quantum Computation via Superposition of Quantum Gates [1.732837834702512]
  We present different protocols, which we denote as "superposed quantum error mitigation" We show that significant noise suppression can be achieved for most kinds of decoherence and standard experimental parameter regimes. We analyze our approach for gate-based, measurement-based and interferometric-based models.
  arXiv  Detail & Related papers  (2023-04-17T18:01:05Z)
• Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
  We numerically simulate and characterize the operation of various quantum processors. We identify and assess quantum complexity by comparing the performance of each device against benchmark lines. We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
  arXiv  Detail & Related papers  (2023-04-10T23:01:10Z)
• Complete characterization of quantum correlations by randomized measurements [0.832184180529969]
  We provide a method to measure any locally invariant property of quantum states using locally randomized measurements. We implement these methods experimentally using pairs of entangled photons, characterizing their usefulness for quantum teleportation. Our results can be applied to various quantum computing platforms, allowing simple analysis of correlations between arbitrary distant qubits.
  arXiv  Detail & Related papers  (2022-12-15T15:22:28Z)
• Characterizing arbitrary quantum networks in the noisy intermediate-scale quantum era [0.0]
  We provide a systematic approach to tackle with arbitrary quantum networks in the NISQ era. One application of our method is to witness the progress of essential elements in quantum networks.
  arXiv  Detail & Related papers  (2022-10-25T03:36:02Z)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• 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)
• Entangling Quantum Generative Adversarial Networks [53.25397072813582]
  We propose a new type of architecture for quantum generative adversarial networks (entangling quantum GAN, EQ-GAN) We show that EQ-GAN has additional robustness against coherent errors and demonstrate the effectiveness of EQ-GAN experimentally in a Google Sycamore superconducting quantum processor.
  arXiv  Detail & Related papers  (2021-04-30T20:38:41Z)
• Estimation of correlations and non-separability in quantum channels via unitarity benchmarking [0.0]
  Correlation structures in quantum channels are less studied than those in quantum states. We develop a range of results for efficient estimation of correlations within a bipartite quantum channel. We show that correlated unitarity can be estimated in a SPAM-robust manner for any separable quantum channel.
  arXiv  Detail & Related papers  (2021-04-09T13:29:37Z)
• Semidefinite tests for quantum network topologies [0.9176056742068814]
  Quantum networks play a major role in long-distance communication, quantum cryptography, clock synchronization, and distributed quantum computing. The question of which correlations a given quantum network can give rise to, remains almost uncharted. We show that constraints on the observable covariances, previously derived for the classical case, also hold for quantum networks.
  arXiv  Detail & Related papers  (2020-02-13T22:36:46Z)
• Entanglement Classification via Neural Network Quantum States [58.720142291102135]
  In this paper we combine machine-learning tools and the theory of quantum entanglement to perform entanglement classification for multipartite qubit systems in pure states. We use a parameterisation of quantum systems using artificial neural networks in a restricted Boltzmann machine (RBM) architecture, known as Neural Network Quantum States (NNS)
  arXiv  Detail & Related papers  (2019-12-31T07:40:23Z)

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.