Toward a quantum computing algorithm to quantify classical and quantum correlation of system states

• URL: http://arxiv.org/abs/2111.09000v1
• Date: Wed, 17 Nov 2021 09:40:30 GMT
• Title: Toward a quantum computing algorithm to quantify classical and quantum correlation of system states
• Authors: M. Mahdian and H. Davoodi Yeganeh
• Abstract summary: We design a variational hybrid quantum-classical (VHQC) algorithm to achieve classical and quantum correlations for system states. We numerically test the performance of our algorithm at finding a correlation of some density matrices.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Optimal measurement is required to obtain the quantum and classical correlations of a quantum state, and the crucial difficulty is how to acquire the maximal information about one system by measuring the other part; in other words, getting the maximum information corresponds to preparing the best measurement operators. Within a general setup, we designed a variational hybrid quantum-classical (VHQC) algorithm to achieve classical and quantum correlations for system states under the Noisy-Intermediate Scale Quantum (NISQ) technology. To employ, first, we map the density matrix to the vector representation, which displays it in a doubled Hilbert space, and it's converted to a pure state. Then we apply the measurement operators to a part of the subsystem and use variational principle and a classical optimization for the determination of the amount of correlation. We numerically test the performance of our algorithm at finding a correlation of some density matrices, and the output of our algorithm is compatible with the exact calculation.

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)
• Bias-field digitized counterdiabatic quantum optimization [39.58317527488534]
  We call this protocol bias-field digitizeddiabatic quantum optimization (BF-DCQO) Our purely quantum approach eliminates the dependency on classical variational quantum algorithms. It achieves scaling improvements in ground state success probabilities, increasing by up to two orders of magnitude.
  arXiv  Detail & Related papers  (2024-05-22T18:11:42Z)
• Probing Quantum Efficiency: Exploring System Hardness in Electronic Ground State Energy Estimation [0.0]
  We consider the question of how correlated the system hardness is between classical algorithms of electronic structure theory and quantum algorithms. For quantum algorithms, we have selected the Variational Quantum Eigensolver (VQE) and Quantum Phase Estimation (QPE) methods.
  arXiv  Detail & Related papers  (2023-10-31T20:07:15Z)
• Hybrid quantum-classical and quantum-inspired classical algorithms for solving banded circulant linear systems [0.8192907805418583]
  We present an efficient algorithm based on convex optimization of combinations of quantum states to solve for banded circulant linear systems. By decomposing banded circulant matrices into cyclic permutations, our approach produces approximate solutions to such systems with a combination of quantum states linear to $K$. We validate our methods with classical simulations and actual IBM quantum computer implementation, showcasing their applicability for solving physical problems such as heat transfer.
  arXiv  Detail & Related papers  (2023-09-20T16:27:16Z)
• A quantum advantage over classical for local max cut [48.02822142773719]
  Quantum optimization approximation algorithm (QAOA) has a computational advantage over comparable local classical techniques on degree-3 graphs. Results hint that even small-scale quantum computation, which is relevant to the current state-of the art quantum hardware, could have significant advantages over comparably simple classical.
  arXiv  Detail & Related papers  (2023-04-17T16:42:05Z)
• Hybrid Quantum Classical Simulations [0.0]
  We report on two major hybrid applications of quantum computing, namely, the quantum approximate optimisation algorithm (QAOA) and the variational quantum eigensolver (VQE) Both are hybrid quantum classical algorithms as they require incremental communication between a classical central processing unit and a quantum processing unit to solve a problem.
  arXiv  Detail & Related papers  (2022-10-06T10:49:15Z)
• 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)
• Identification of topological phases using classically-optimized variational quantum eigensolver [0.6181093777643575]
  Variational quantum eigensolver (VQE) is regarded as a promising candidate of hybrid quantum-classical algorithm for quantum computers. We propose classically-optimized VQE (co-VQE), where the whole process of the optimization is efficiently conducted on a classical computer. In co-VQE, we only use quantum computers to measure nonlocal quantities after the parameters are optimized.
  arXiv  Detail & Related papers  (2022-02-07T02:26:58Z)
• Quantum Approximate Optimization Algorithm Based Maximum Likelihood Detection [80.28858481461418]
  Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices. Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices.
  arXiv  Detail & Related papers  (2021-07-11T10:56:24Z)
• Quantum-Classical Hybrid Algorithm for the Simulation of All-Electron Correlation [58.720142291102135]
  We present a novel hybrid-classical algorithm that computes a molecule's all-electron energy and properties on the classical computer. We demonstrate the ability of the quantum-classical hybrid algorithms to achieve chemically relevant results and accuracy on currently available quantum computers.
  arXiv  Detail & Related papers  (2021-06-22T18:00:00Z)
• Quantum Solver of Contracted Eigenvalue Equations for Scalable Molecular Simulations on Quantum Computing Devices [0.0]
  We introduce a quantum solver of contracted eigenvalue equations, the quantum analogue of classical methods for the energies. We demonstrate the algorithm though computations on both a quantum simulator and two IBM quantum processing units.
  arXiv  Detail & Related papers  (2020-04-23T18:35:26Z)

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.