Quantum decision trees with information entropy

• URL: http://arxiv.org/abs/2502.11412v3
• Date: Tue, 25 Feb 2025 01:18:22 GMT
• Title: Quantum decision trees with information entropy
• Authors: Zhelun Li, Koji Terashi,
• Abstract summary: We present a classification algorithm for quantum states inspired by decision-tree methods.<n>For each measurement shot on an unknown quantum state, the algorithm selects the observable with the highest expected information gain, continuing until convergence.<n>Despite not relying on circuit-based quantum neural networks, the algorithm still encounters challenges akin to the barren plateau problem.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a classification algorithm for quantum states, inspired by decision-tree methods. To adapt the decision-tree framework to the probabilistic nature of quantum measurements, we utilize conditional probabilities to compute information gain, thereby optimizing the measurement scheme. For each measurement shot on an unknown quantum state, the algorithm selects the observable with the highest expected information gain, continuing until convergence. We demonstrate using the simulations that this algorithm effectively identifies quantum states sampled from the Haar random distribution. However, despite not relying on circuit-based quantum neural networks, the algorithm still encounters challenges akin to the barren plateau problem. In the leading order, we show that the information gain is proportional to the variance of the observable's expectation values over candidate states. As the system size increases, this variance, and consequently the information gain, are exponentially suppressed, which poses significant challenges for classifying general Haar-random quantum states. Finally, we apply the quantum decision tree to classify the ground states of various Hamiltonians using physically-motivated observables. On both simulators and quantum computers, the quantum decision tree yields better performances when compared to methods that are not information-optimized. This indicates that the measurement of physically-motivated observables can significantly improve the classification performance, guiding towards the future direction of this approach.

Related papers

• Relieving the post-selection problem by quantum singular value transformation [9.861807368585373]
  We propose a post-selection-free experimental strategy based on a fully quantum approach. We deterministically simulate the post-selected quantum states by applying quantum singular value transformation algorithms. We also introduce a pseudoinverse decoder for measurement-induced quantum teleportation.
  arXiv  Detail & Related papers  (2025-03-31T18:00:31Z)
• 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)
• Quantum HodgeRank: Topology-Based Rank Aggregation on Quantum Computers [0.5490714603843316]
  HodgeRank generalizes ranking algorithms to rank alternatives based on real-world (often incomplete) data using graphs and discrete exterior calculus. We develop a quantum algorithm that approximates the HodgeRank solution with complexity independent of dimension.
  arXiv  Detail & Related papers  (2024-07-29T23:16:23Z)
• Predicting properties of quantum systems by regression on a quantum computer [0.0]
  We propose a method for predicting continuous labels properties of quantum states.<n>We numerically test our approach in learning to predict (i) the parameter of a parametrized channel given its output state, (ii) entanglement of two-qubit states, and (iii) the parameter of a parametrized Hamiltonian given its ground state.
  arXiv  Detail & Related papers  (2024-07-11T20:06:08Z)
• Effect of the readout efficiency of quantum measurement on the system entanglement [44.99833362998488]
  We quantify the entanglement for a particle on a 1d quantum random walk under inefficient monitoring. We find that the system's maximal mean entanglement at the measurement-induced quantum-to-classical crossover is in different ways by the measurement strength and inefficiency.
  arXiv  Detail & Related papers  (2024-02-29T18:10:05Z)
• 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)
• Quantum Conformal Prediction for Reliable Uncertainty Quantification in Quantum Machine Learning [47.991114317813555]
  Quantum models implement implicit probabilistic predictors that produce multiple random decisions for each input through measurement shots. This paper proposes to leverage such randomness to define prediction sets for both classification and regression that provably capture the uncertainty of the model.
  arXiv  Detail & Related papers  (2023-04-06T22:05:21Z)
• 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)
• 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)
• Adaptive estimation of quantum observables [4.567122178196833]
  We introduce a measurement scheme that adaptively modifies the estimator based on previously obtained data. Our algorithm, which we call AEQuO, continuously monitors both the estimated average and the associated error of the considered observable. We test our protocol on chemistry Hamiltonians, for which AEQuO provides error estimates that improve on all state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-10-28T17:49:16Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Facial Expression Recognition on a Quantum Computer [68.8204255655161]
  We show a possible solution to facial expression recognition using a quantum machine learning approach. We define a quantum circuit that manipulates the graphs adjacency matrices encoded into the amplitudes of some appropriately defined quantum states.
  arXiv  Detail & Related papers  (2021-02-09T13:48:00Z)
• 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 State Discrimination on Reconfigurable Noise-Robust Quantum Networks [6.85316573653194]
  A fundamental problem in Quantum Information Processing is the discrimination amongst a set of quantum states of a system. In this paper, we address this problem on an open quantum system described by a graph, whose evolution is defined by a Quantum Walk. We optimize the parameters of the network to obtain the highest probability of correct discrimination.
  arXiv  Detail & Related papers  (2020-03-25T19:07:03Z)

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.