QZNs: Quantum Z-numbers

• URL: http://arxiv.org/abs/2104.05190v1
• Date: Mon, 12 Apr 2021 04:04:05 GMT
• Title: QZNs: Quantum Z-numbers
• Authors: Jixiang Deng, Yong Deng
• Abstract summary: We propose quantum Z-numbers (QZNs), which are the quantum generalization of Z-numbers. Based on QZNs, a novel quantum multi-attributes decision making (MADM) algorithm is proposed and applied in medical diagnosis.
• Score: 3.997680012976965
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Because of the efficiency of modeling fuzziness and vagueness, Z-number plays an important role in real practice. However, Z-numbers, defined in the real number field, lack the ability to process the quantum information in quantum environment. It is reasonable to generalize Z-number into its quantum counterpart. In this paper, we propose quantum Z-numbers (QZNs), which are the quantum generalization of Z-numbers. In addition, seven basic quantum fuzzy operations of QZNs and their corresponding quantum circuits are presented and illustrated by numerical examples. Moreover, based on QZNs, a novel quantum multi-attributes decision making (MADM) algorithm is proposed and applied in medical diagnosis. The results show that, with the help of quantum computation, the proposed algorithm can make diagnoses correctly and efficiently.

Related papers

• Estimating quantum relative entropies on quantum computers [5.552464954935806]
  We propose the first quantum algorithm for estimating quantum relative entropy and Petz R'enyi divergence from two unknown quantum states on quantum computers. This is achieved by combining quadrature approximations of relative entropies, variational representation of quantum f-divergences, and a new technique for parameterizing Hermitian operators. We validate our algorithm through numerical simulations, laying the groundwork for its future deployment on quantum hardware devices.
  arXiv  Detail & Related papers  (2025-01-13T13:00:24Z)
• Efficient Quantum Pseudorandomness from Hamiltonian Phase States [41.94295877935867]
  We introduce a quantum hardness assumption called the Hamiltonian Phase State (HPS) problem. We show that our assumption is plausibly fully quantum; meaning, it cannot be used to construct one-way functions. We show that our assumption and its variants allow us to efficiently construct many pseudorandom quantum primitives.
  arXiv  Detail & Related papers  (2024-10-10T16:10:10Z)
• Determining the ability for universal quantum computing: Testing controllability via dimensional expressivity [39.58317527488534]
  Controllability tests can be used in the design of quantum devices to reduce the number of external controls. We devise a hybrid quantum-classical algorithm based on a parametrized quantum circuit.
  arXiv  Detail & Related papers  (2023-08-01T15:33:41Z)
• Preparation of quantum superposition using partial negation [1.911678487931003]
  The speed of the preparation process and the accuracy of the prepared superposition has a special importance to the success of any quantum algorithm. The proposed method can be used to prepare the required quantum superposition in $mathcalO(n)$ steps.
  arXiv  Detail & Related papers  (2021-09-29T11:57:44Z)
• Efficient criteria of quantumness for a large system of qubits [58.720142291102135]
  We discuss the dimensionless combinations of basic parameters of large, partially quantum coherent systems. Based on analytical and numerical calculations, we suggest one such number for a system of qubits undergoing adiabatic evolution.
  arXiv  Detail & Related papers  (2021-08-30T23:50:05Z)
• Quantum Multiple-Valued Decision Diagrams in Graphical Calculi [0.0]
  We show how to turn a QMDD into an equivalent ZH-diagram, and vice-versa. This allows tools from one formalism to be used into the other.
  arXiv  Detail & Related papers  (2021-07-02T16:50:11Z)
• On exploring the potential of quantum auto-encoder for learning quantum systems [60.909817434753315]
  We devise three effective QAE-based learning protocols to address three classically computational hard learning problems. Our work sheds new light on developing advanced quantum learning algorithms to accomplish hard quantum physics and quantum information processing tasks.
  arXiv  Detail & Related papers  (2021-06-29T14:01:40Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)
• Quantum walk processes in quantum devices [55.41644538483948]
  We study how to represent quantum walk on a graph as a quantum circuit. Our approach paves way for the efficient implementation of quantum walks algorithms on quantum computers.
  arXiv  Detail & Related papers  (2020-12-28T18:04:16Z)
• Maximal entropy approach for quantum state tomography [3.6344381605841187]
  Current quantum computing devices are noisy intermediate-scale quantum $($NISQ$)$ devices. Quantum tomography tries to reconstruct a quantum system's density matrix by a complete set of observables. We propose an alternative approach to quantum tomography, based on the maximal information entropy, that can predict the values of unknown observables.
  arXiv  Detail & Related papers  (2020-09-02T04:39:45Z)
• Quantum entanglement recognition [0.0]
  We formulate a framework for probing entanglement based on machine learning techniques. We show that the resulting quantum entanglement recognition task is accurate and can be assigned a well-controlled error.
  arXiv  Detail & Related papers  (2020-07-28T18:00:00Z)

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.