Experimental violations of Leggett-Garg's inequalities on a quantum computer

• URL: http://arxiv.org/abs/2109.02507v2
• Date: Sat, 12 Mar 2022 11:09:12 GMT
• Title: Experimental violations of Leggett-Garg's inequalities on a quantum computer
• Authors: Alessandro Santini and Vittorio Vitale
• Abstract summary: 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.
• Score: 77.34726150561087
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Leggett-Garg's inequalities predict sharp bounds for some classical correlation functions that address the quantum or classical nature of real-time evolutions. We experimentally observe the violations of these bounds on single- and multi-qubit systems, in different settings, exploiting the IBM Quantum platform. In the multi-qubit case we introduce the Leggett-Garg-Bell's inequalities as an alternative to the previous ones. Measuring these correlation functions, we find quantum error mitigation to be essential to spot inequalities violations. Accessing only two qubit readouts, we assess Leggett-Garg-Bell's inequalities to emerge as the most efficient quantum coherence witnesses to be used for investigating quantum hardware, as the complexity of their calculation does not scale with the number of constituents of the system. 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.

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)
• Quantum Non-Demolition Measurements and Leggett-Garg inequality [0.0]
  Quantum non-demolition measurements define a non-invasive protocol to extract information from a quantum system. This protocol leads to a quasi-probability distribution for the measured observable outcomes, which can be negative. We show that there are situations in which Leggett-Garg inequalities are satisfied even if the macrorealism condition is violated.
  arXiv  Detail & Related papers  (2024-07-31T18:04:51Z)
• Classical Verification of Quantum Learning [42.362388367152256]
  We develop a framework for classical verification of quantum learning. We propose a new quantum data access model that we call "mixture-of-superpositions" quantum examples. Our results demonstrate that the potential power of quantum data for learning tasks, while not unlimited, can be utilized by classical agents.
  arXiv  Detail & Related papers  (2023-06-08T00:31:27Z)
• 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)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
  "Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
  arXiv  Detail & Related papers  (2021-12-09T19:00:00Z)
• Quantum Fair Machine Learning [1.8275108630751844]
  We undertake a comparative analysis of differences and similarities between classical and quantum fair machine learning algorithms. We present the first results in quantum fair machine learning by demonstrating the use of Grover's search algorithm. We extend canonical Lipschitz-conditioned individual fairness criteria to the quantum setting using quantum metrics.
  arXiv  Detail & Related papers  (2021-02-01T10:36:46Z)
• 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)
• Crosstalk Suppression for Fault-tolerant Quantum Error Correction with Trapped Ions [62.997667081978825]
  We present a study of crosstalk errors in a quantum-computing architecture based on a single string of ions confined by a radio-frequency trap, and manipulated by individually-addressed laser beams. This type of errors affects spectator qubits that, ideally, should remain unaltered during the application of single- and two-qubit quantum gates addressed at a different set of active qubits. We microscopically model crosstalk errors from first principles and present a detailed study showing the importance of using a coherent vs incoherent error modelling and, moreover, discuss strategies to actively suppress this crosstalk at the gate level.
  arXiv  Detail & Related papers  (2020-12-21T14:20:40Z)

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.