Pith. sign in

REVIEW 4 major objections 4 minor 129 references

Leveraging Quantum Layers in Classical Neural Networks

T0 review · 4 major / 4 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read The paper claims that a small variational quantum circuit inside a classical CNN can improve generalization and stability, and that the feature map choice is decisive: of nine tested maps, only the Pauli XYZ map trains well.

desk verdict A transparent hyperparameter scan of quantum feature maps and ansatz depths, but the missing classical baseline and single-run design leave the central quantum-regularization claim unsupported. read the letter →

arxiv 2507.12505 v1 pith:UMZEOW6O submitted 2025-07-16 quant-ph

Silvie Illésová This is my paper · ORCID
classification quant-ph MSC 81P6868T07
keywords hybridquantum-classicalneuralnetworksvariationalquantumcircuitsfeaturemappingmachinelearningconvolutionalansatzdepthregularizationcausalityclassification
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper tries to establish that a small variational quantum layer can do real work inside an otherwise classical convolutional network: on a three-class causality task, a quantum circuit with only a few qubits placed between the feature extractor and the classifier changes not just final accuracy but the whole training dynamics. Repeating the quantum ansatz from one to three times raises validation accuracy from 87.2 to 91.1 percent, shrinks the generalization gap, and lowers the validation-to-training fluctuation ratio from 2.18 to 0.83, which the author interprets as the deeper circuit acting like an implicit regularizer. The second claim is that the quantum feature map is the dominant design choice: of nine maps tested, only the Pauli XYZ rotation map produced a well-trained model, while others collapsed the output or failed to separate classes. The reason to care is practical: if a few-qubit quantum layer can steady a CNN's training, hybrid models become a cheap add-on to existing pipelines rather than a wholesale replacement.

What carries the argument

The central object is the Hybrid Quantum-Convolutional Neural Network (HQCNN): a classical convolutional feature extractor (three blocks of convolution, ReLU, max-pooling, and dropout) whose flattened output is projected onto a small number of qubits, fed through a quantum neural network built from a data-encoding feature map followed by a hardware-efficient TwoLocal ansatz, a parameterized circuit of single-qubit rotations interleaved with entangling gates, and finally passed to a classical linear classifier. The two independent knobs that carry the argument are the number of ansatz repetitions, which deepens the parameterized circuit and smooths the learning curve, and the choice of feature map, which decides how classical inputs are embedded into Hilbert space (the tested variants use Z rotations, ZZ interactions, and multi-axis Pauli rotations with different entanglement patterns). The quantum layer is wired into the classical training loop through a differentiable connector, so gradients flow back through the circuit and the whole model trains end-to-end with ordinary gradient descent. The supporting diagnostics are PCA applied at three stages of the network, silhouette scores for cluster quality, the Fisher Discriminant Ratio for class separability, and the stability ratio, the mean absolute fluctuation of validation accuracy divided by that of training accuracy, which falls from 2.18 to 0.83 as ansatz repetitions grow from one to three.

What would settle it

Train the same CNN once with the quantum block and once with a classical linear layer of the same parameter count in its place, keeping data, optimizer, and epochs identical; if the classical swap reproduces the three-repetition results (validation accuracy near 91.1 percent and a stability ratio near 0.83) across several random seeds, the attribution of the regularization effect to the quantum circuit is not supported.

Watch

Extended reading notes

Core claim

On the paper's own terms, the central claim is that quantum components can introduce meaningful transformations even with a limited number of qubits, and that the depth of the variational ansatz shapes the model's generalization as much as its accuracy. With three ansatz repetitions the hybrid model reaches 90.1 percent training and 91.1 percent validation accuracy, the smallest final generalization gap (0.0107), an overfitting drop of only 0.68 percent, and a stability ratio of 0.83, meaning validation accuracy fluctuates less than training accuracy; the author concludes that repeating the ansatz acts as a form of regularization. The feature-map study carries equal weight: only the Pauli XYZ map with one repetition learns successfully (90.1 percent validation accuracy), and the paper shows through PCA and silhouette analysis that the quantum layer of this model compresses the data into a single well-separated component, while failed maps either collapse the class structure or leave it unrecoverable. The overall conclusion is that the design of the quantum part, the feature map and the ansatz together, determines learning dynamics, stability, and final performance in hybrid models, and that increased complexity must be introduced deliberately.

Load-bearing premise

Because the experiments never train a purely classical network without the quantum layer, the claim that the observed accuracy and stability gains come from the quantum circuit itself rests on comparing hybrid configurations against each other rather than against a classical baseline.

Editorial extensions

If this is right

  • Practitioners should treat ansatz depth as a tunable regularizer in hybrid classifiers: three repetitions improve generalization metrics even though raw accuracy gains are modest, and the stability ratio drops below one.
  • Feature-map choice can dominate circuit size: models with Z-only or heavily entangled maps fail to separate classes at all, so map selection deserves the same care as architecture selection.
  • Early plateaus in deeper quantum circuits are part of the learning process, not a defect: the three-repetition model had a negative early slope yet was the first to exceed 90 percent validation accuracy, at epoch 168.
  • Blindly adding feature-map complexity can cause dimensional collapse, so complexity should be introduced with intent and monitored.
  • Evaluating hybrid models by final accuracy alone understates the trade-offs: fluctuation, generalization gap, and stability ratio are needed to see what deeper quantum layers contribute.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A testable consequence the paper leaves implicit is that a classical layer of matched parameter count might reproduce the observed regularization, since no purely classical baseline was trained; until that control exists, the effect cannot be uniquely attributed to quantum processing.
  • The stability-ratio pattern resembles what stochastic regularizers such as dropout produce, which suggests a direct control experiment: replace the quantum block with a classical stochastic layer of comparable noise and compare the fluctuation curves.
  • The paper's own warning that the Fisher Discriminant Ratio can look good for ill-trained models implies that separability metrics should be checked against true labels rather than fitted values; a screening protocol that tests label-agreement of quantum-layer outputs before training would be a cheap extension.
  • All reported comparisons appear to come from single runs per configuration, so multi-seed replication with statistical testing is the natural next experiment before the 87-to-91 percent improvement is treated as firm.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 4 minor

Summary. This manuscript, formatted as a diploma thesis, investigates hybrid quantum-classical convolutional neural networks for a three-class causality-direction classification task on synthetic 8×8 heatmaps. It compares ansatz depths (one, two, and three repetitions of a TwoLocal circuit) and nine quantum feature maps, reporting validation accuracy, generalization gap, epoch-level fluctuation metrics, PCA silhouette scores, and Fisher discriminant ratios. The central claim is that increasing ansatz repetitions acts as a regularizer that improves generalization and that quantum components introduce meaningful transformations; only the Pauli XYZ feature map is reported to enable successful learning.

Significance. The question of whether small quantum layers can provide any benefit over classical feature extractors in hybrid models is timely and relevant to NISQ-era quantum machine learning. The manuscript's strengths include a fully specified architecture, a publicly available implementation on Zenodo/GitLab, and the use of several complementary diagnostics. However, the experimental design lacks a classical baseline, any repeated runs or seed variation, and capacity-matched ablations; as a result, the central enhancement and regularization claims are not supported by the current evidence. The PCA/Fisher analyses also contain internal inconsistencies that further weaken the conclusions.

major comments (4)
  1. [§2.2.6, Tables 3.1–3.5] No purely classical CNN baseline is trained, so the claimed benefit of the quantum layer is inferred only from comparisons among hybrid configurations. Because increasing ansatz repetitions from one to three also increases the number of trainable parameters, the observed validation accuracy improvement (0.8721 to 0.9111) and stability ratio reduction (2.1791 to 0.8335) could equally result from increased model capacity or from a favorable random initialization; an ablation holding capacity constant or a classical baseline is required to attribute these effects to the quantum circuit.
  2. [§2.2.6, Tables 3.4–3.5] Each configuration is trained exactly once, and the fluctuation metrics and stability ratio are computed from a single training trajectory. With no repeated seeds or variance estimates, the regularization interpretation rests on three uncorrelated single-run points and cannot be distinguished from random variation.
  3. [§3.3, Tables 3.7–3.10] The ranking of feature maps by silhouette score uses the 'Fitted values' (model predictions) rather than the true 'Training values' labels. High silhouette on the model's own predictions is tautological, and the true-label silhouette values in Table 3.9 are near zero for eight of nine maps; the table therefore does not measure actual class separability.
  4. [Table 3.11] The reported Fisher discriminant ratios are not symmetric under class permutation, contradicting the symmetric formula in Eq. (3.11). For example, for zz_feature_map_reps_1_linear, the '0 vs 1' entry is 16.9932 while the '1 vs 0' entry is 12.2353; this indicates a computational or definitional mismatch that invalidates the Fisher-based comparison.
minor comments (4)
  1. [§2.5] The word 'achqcnn' appears to be a typo for 'the HQCNN model'.
  2. [§1.16] The text contains several typos, including 'expandion' for 'expansion', and the equation after 'ESA(θ) =' is not displayed consistently.
  3. [§3.3] The phrase 'The first attempt is visible in??' contains a broken cross-reference and should point to the specific figure.
  4. [Chapter 1] Sections 1.5, 1.14–1.16 (fermionic mappings, VQE, VHA, SA-OO-VQE) are not used in the experiments and could be trimmed or explicitly connected to the central study.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the thesis is an empirical comparison of hybrid configurations, and its conclusions are post-hoc interpretations of the same runs, not predictions derived from their own inputs.

full rationale

The paper makes no derivation that reduces a predicted quantity to a fitted parameter. The central comparisons in Tables 3.1-3.5 are measured outcomes of training runs; the conclusion that ansatz repetition acts as regularization is an interpretation of metrics such as the stability ratio (Eq. 3.9), which is defined directly from observed fluctuation sequences and is not fitted elsewhere and then reported as a prediction. The choice of the TwoLocal ansatz and of the tested feature maps is presented as a standard experimental design choice, not as the consequence of a self-cited uniqueness theorem. The self-citations in Section 2.1, references [115] and [125], describe the authors' prior VQE work as background motivation only and do not support the accuracy, stability, or generalization claims. The absence of a purely classical baseline and of seeded repetitions is a genuine experimental-control weakness, but it is not circularity: it weakens causal attribution to the quantum layer without making any claim equivalent to its inputs by construction. No specific equation or citation chain can be exhibited that forces the stated conclusions, so the circularity score is 0.

Assumptions & free parameters 5 free parameters · 4 assumptions · 0 invented entities

The central empirical claims rest on hand-chosen hyperparameters and single-run experiments, though they do not introduce new theoretical entities. The most consequential free parameter is the unstated number of qubits, which affects every comparison. The assumptions are standard QML practice, but the unverified label quality and lack of baseline are domain assumptions that load the conclusions.

free parameters (5)
  • Number of qubits
    Determines the capacity of the quantum layer; varies by feature map but exact value not reported in the text, making replication harder.
  • Learning rate = 0.01
    Chosen by hand in Section 2.2.4; a fixed training hyperparameter.
  • Number of epochs = 500
    Chosen to ensure convergence, as described in Section 3.2.
  • Dropout rate = 0.5
    Used in each CNN block, Section 2.3.
  • Batch size = 64
    Chosen by hand in Section 2.2.4.
assumptions (4)
  • standard math Quantum mechanics postulates: unitary evolution, Born rule, entanglement
    The theoretical foundation in Chapter 1; assumed without proof.
  • domain assumption Variational quantum circuits are trainable via gradient descent through the TorchConnector
    Sections 2.2.3 and 2.5 rely on Qiskit's EstimatorQNN and TorchConnector for end-to-end backpropagation without questioning its numerical stability.
  • domain assumption The Kaggle cause-effect-pairs dataset labels are correct ground truth
    Used as labels in Section 3.1; no error analysis is performed on the labels.
  • domain assumption PCA and silhouette scores on the training set reveal class separability relevant to generalization
    Used in Section 3.3 to interpret model behavior; this assumption is not validated.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Leveraging Quantum Layers in Classical Neural Networks." pith.science (2026). https://pith.science/paper/UMZEOW6O

@misc{pith2026250712505,
  author       = {Pith},
  title        = {Pith review of: Leveraging Quantum Layers in Classical Neural Networks},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/UMZEOW6O}},
  note         = {Machine review of arXiv:2507.12505}
}
read the original abstract

Hybrid quantum-classical neural networks represent a promising frontier in the search for improved machine learning models. This thesis explores the integration of quantum layers within classical convolutional neural network architectures, aiming to leverage quantum entanglement and feature mapping to enhance learning capabilities. A detailed methodology for constructing and training such hybrid models is presented, using PyTorch and Qiskit Machine Learning frameworks. Experiments investigate the performance impact of inserting quantum layers at different stages of the neural network pipeline. The results suggest that quantum components can introduce meaningful transformations even with a limited number of qubits, motivating further research into scalable quantum machine learning. The full implementation is made publicly available, and future work will focus on expanding experimental evaluations and publishing additional findings.

Figures

Figures reproduced from arXiv: 2507.12505 by the authors.

Figure 1.1
Figure 1.1. Bloch Sphere This particular representation is useful, when we need to visualize how single qubit gates rotate our quantum state. It is also a good tool for demonstrating quantum decoherence and the effects of noise in our quantum system. 1.3 Quantum Operators When working with qubits, we use quantum operators as a mathematical framework for different computations. The quantum operators are represented as matrices, … view at source ↗
Figure 1.2
Figure 1.2. Examples of quantum circuits with increasing width. [PITH_FULL_IMAGE:figures/full_fig_p020_1_2.png] view at source ↗
Figure 1.3
Figure 1.3. Three different 3-qubit quantum circuits of increasing depth. [PITH_FULL_IMAGE:figures/full_fig_p021_1_3.png] view at source ↗
Figures from the paper (33 more)
Figure 1.4
Figure 1.4. Figure 1.4: Three circuits with the same depth and width, but increasing complexity. [PITH_FULL_IMAGE:figures/full_fig_p021_1_4.png]
Figure 1.5
Figure 1.5. Figure 1.5: Linearly separable data: two clusters separated by the hyperplane [PITH_FULL_IMAGE:figures/full_fig_p031_1_5.png]
Figure 1.6
Figure 1.6. Figure 1.6: XOR dataset: an example of non-linearly separable data. Points [PITH_FULL_IMAGE:figures/full_fig_p031_1_6.png]
Figure 1.7
Figure 1.7. Figure 1.7: Square layout of a Variational Quantum Circuit training loop. Parameters are optimized [PITH_FULL_IMAGE:figures/full_fig_p032_1_7.png]
Figure 1.8
Figure 1.8. Figure 1.8: The Variational Quantum Eigensolver loop. [PITH_FULL_IMAGE:figures/full_fig_p036_1_8.png]
Figure 1.9
Figure 1.9. Figure 1.9: Illustration of causality (direct link between [PITH_FULL_IMAGE:figures/full_fig_p040_1_9.png]
Figure 2.2
Figure 2.2. Figure 2.2: ZZ feature map with 1 repetition (linear entanglement). [PITH_FULL_IMAGE:figures/full_fig_p045_2_2.png]
Figure 2.3
Figure 2.3. Figure 2.3: ZZ feature map with 2 repetitions (linear entanglement). [PITH_FULL_IMAGE:figures/full_fig_p045_2_3.png]
Figure 2.4
Figure 2.4. Figure 2.4: ZZ feature map with 3 repetitions (full entanglement). [PITH_FULL_IMAGE:figures/full_fig_p045_2_4.png]
Figure 2.1
Figure 2.1. Figure 2.1: Architecture of the Hybrid Quantum CNN Model [PITH_FULL_IMAGE:figures/full_fig_p048_2_1.png]
Figure 2.5
Figure 2.5. Figure 2.5: Z feature map with 1 repetition [PITH_FULL_IMAGE:figures/full_fig_p049_2_5.png]
Figure 2.6
Figure 2.6. Figure 2.6: Z feature map with 2 repetitions. 49 [PITH_FULL_IMAGE:figures/full_fig_p049_2_6.png]
Figure 2.7
Figure 2.7. Figure 2.7: Z feature map with 3 repetitions [PITH_FULL_IMAGE:figures/full_fig_p050_2_7.png]
Figure 2.8
Figure 2.8. Figure 2.8: Pauli XYZ feature map with 1 repetition. [PITH_FULL_IMAGE:figures/full_fig_p050_2_8.png]
Figure 2.9
Figure 2.9. Figure 2.9: Pauli Z-YY-ZXZ feature map with linear entanglement. [PITH_FULL_IMAGE:figures/full_fig_p050_2_9.png]
Figure 2.10
Figure 2.10. Figure 2.10: Pauli Z-YY-ZXZ feature map with 2 repetitions. [PITH_FULL_IMAGE:figures/full_fig_p051_2_10.png]
Figure 3.1
Figure 3.1. Figure 3.1: Heatmaps showing positive causality direction [PITH_FULL_IMAGE:figures/full_fig_p052_3_1.png]
Figure 3.2
Figure 3.2. Figure 3.2: Heatmaps showing negative causality direction [PITH_FULL_IMAGE:figures/full_fig_p053_3_2.png]
Figure 3.3
Figure 3.3. Figure 3.3: Heatmaps showing data with no causality 3.2 Ansatz Depth In this part of the work, an investigation of the impact of the size of the ansatz and thus the number of parameters in the quantum part of our hybrid neural network was done. The ansatz size was gradually incr…
Figure 3.4
Figure 3.4. Figure 3.4: Training process for all combinations The first parameter we will have a look at is the overall accuracy of our trained method which is shown in Tab. 3.1. Here we can see that accuracy on both the training and validation data increases with the number of repetitions,…
Figure 3.5
Figure 3.5. Figure 3.5: Training process with 1 ansatz repetition [PITH_FULL_IMAGE:figures/full_fig_p055_3_5.png]
Figure 3.6
Figure 3.6. Figure 3.6: Training process with 2 ansatz repetitions [PITH_FULL_IMAGE:figures/full_fig_p055_3_6.png]
Figure 3.7
Figure 3.7. Figure 3.7: Training process with 3 ansatz repetitions [PITH_FULL_IMAGE:figures/full_fig_p056_3_7.png]
Figure 3.8
Figure 3.8. Figure 3.8: Generalization Gap for All Setups The second metric is the mean generalization gap, that computed as an average across the whole training process, all 500 epochs. And again, in this case, the value decreases with an increase of ansatz parameters. This all suggests th…
Figure 3.9
Figure 3.9. Figure 3.9: PCA Progression for pauli_xyz_1_rep — Training Data 62 [PITH_FULL_IMAGE:figures/full_fig_p062_3_9.png]
Figure 3.10
Figure 3.10. Figure 3.10: PCA Progression for z_feature_map_reps_1 — Training Data 64 [PITH_FULL_IMAGE:figures/full_fig_p064_3_10.png]
Figure 3.11
Figure 3.11. Figure 3.11: PCA Progression for z_feature_map_reps_2 — Training Data 66 [PITH_FULL_IMAGE:figures/full_fig_p066_3_11.png]
Figure 3.12
Figure 3.12. Figure 3.12: PCA Progression for z_feature_map_reps_3 — Training Data 69 [PITH_FULL_IMAGE:figures/full_fig_p069_3_12.png]
Figure 3.13
Figure 3.13. Figure 3.13: PCA Progression for zz_feature_map_reps_1_linear_entanglement — Training Data 70 [PITH_FULL_IMAGE:figures/full_fig_p070_3_13.png]
Figure 3.14
Figure 3.14. Figure 3.14: PCA Progression for pauli_z_yy_zxz_rep_2 — Training Data 72 [PITH_FULL_IMAGE:figures/full_fig_p072_3_14.png]
Figure 3.15
Figure 3.15. Figure 3.15: PCA Progression for zz_feature_map_reps_2_linear — Training Data 73 [PITH_FULL_IMAGE:figures/full_fig_p073_3_15.png]
Figure 3.16
Figure 3.16. Figure 3.16: PCA Progression for zz_feature_map_reps_3_full — Training Data 74 [PITH_FULL_IMAGE:figures/full_fig_p074_3_16.png]
Figure 3.17
Figure 3.17. Figure 3.17: PCA Progression for pauli_z_yy_zxz_linear — Training Data 75 [PITH_FULL_IMAGE:figures/full_fig_p075_3_17.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

129 extracted references · 79 canonical work pages

  1. [1]

    Realiza- tion of a scalable Shor algorithm.Science

    MONZ,Thomas;NIGG,Daniel;MARTINEZ,EstebanA;BRANDL,MatthiasF;SCHINDLER, Philipp; RINES, Richard; WANG, Shannon X; CHUANG, Isaac L; BLATT, Rainer. Realiza- tion of a scalable Shor algorithm.Science. 2016, vol. 351, no. 6277, pp. 1068–1070

    2016

  2. [2]

    Distributed quantum computing: A distributed Shor algorithm

    YIMSIRIWATTANA, Anocha; LOMONACO JR, Samuel J. Distributed quantum computing: A distributed Shor algorithm. In:Quantum Information and Computation II. SPIE, 2004, vol. 5436, pp. 360–372

    2004

  3. [3]

    Grover algorithm with zero theoretical failure rate.Physical Review A

    LONG, Gui-Lu. Grover algorithm with zero theoretical failure rate.Physical Review A. 2001, vol. 64, no. 2, p. 022307

    2001

  4. [4]

    Searching in Grover's Algorithm

    JOZSA, Richard. Searching in Grover’s algorithm.arXiv preprint quant-ph/9901021. 1999

    work page Pith review arXiv 1999

  5. [5]

    Implementing Grover’s algorithm on the IBM quantum computers

    MANDVIWALLA, Aamir; OHSHIRO, Keita; JI, Bo. Implementing Grover’s algorithm on the IBM quantum computers. In:2018 IEEE international conference on big data (big data). IEEE, 2018, pp. 2531–2537

    2018

  6. [6]

    IBM Quantum

    QUANTUM, IBM. IBM Quantum. 2025. Available also from: https : / / www . ibm . com / quantum. Accessed: 2025-04-30

    2025

  7. [7]

    Google Quantum AI

    AI, Google Quantum. Google Quantum AI. 2025. Available also from:https://quantumai. google/. Accessed: 2025-04-30

    2025

  8. [8]

    Rigetti Computing.2025.Availablealsofrom: https://www.rigetti

    COMPUTING,Rigetti. Rigetti Computing.2025.Availablealsofrom: https://www.rigetti. com/. Accessed: 2025-04-30

    2025

Show all 129 references
  1. [9]

    Challenges and opportunities of near-term quantum computing sys- tems

    CÓRCOLES, Antonio D; KANDALA, Abhinav; JAVADI-ABHARI, Ali; MCCLURE, Dou- glas T; CROSS, Andrew W; TEMME, Kristan; NATION, Paul D; STEFFEN, Matthias; GAMBETTA, Jay M. Challenges and opportunities of near-term quantum computing sys- tems. Proceedings of the IEEE. 2019, vol. 108,...

    2019

  2. [10]

    Perspectives of quantum annealing: Methods and implementations.Re- ports on Progress in Physics

    HAUKE,Philipp;KATZGRABER,HelmutG;LECHNER,Wolfgang;NISHIMORI,Hidetoshi; OLIVER, William D. Perspectives of quantum annealing: Methods and implementations.Re- ports on Progress in Physics. 2020, vol. 83, no. 5, p. 054401

    2020

  3. [11]

    Implementation of quantum annealing: A systematic review.Ieee Access

    YULIANTI, Lenny Putri; SURENDRO, Kridanto. Implementation of quantum annealing: A systematic review.Ieee Access. 2022, vol. 10, pp. 73156–73177. 80

    2022

  4. [12]

    Fundamental properties of Hamiltonian operators of Schrödinger type.Trans- actions of the American Mathematical Society

    KATO, Tosio. Fundamental properties of Hamiltonian operators of Schrödinger type.Trans- actions of the American Mathematical Society. 1951, vol. 70, no. 2, pp. 195–211

    1951

  5. [13]

    Adiabatic quantum computation.Reviews of Modern Physics

    ALBASH, Tameem; LIDAR, Daniel A. Adiabatic quantum computation.Reviews of Modern Physics. 2018, vol. 90, no. 1, p. 015002

    2018

  6. [14]

    Quantum annealing in the transverse Ising model

    KADOWAKI, Tadashi; NISHIMORI, Hidetoshi. Quantum annealing in the transverse Ising model. Physical Review E. 1998, vol. 58, no. 5, p. 5355

    1998

  7. [15]

    Quantum annealing of the traveling-salesman problem.Physical Review E—Statistical, Nonlinear, and Soft Matter Physics

    MARTOŇÁK, Roman; SANTORO, Giuseppe E; TOSATTI, Erio. Quantum annealing of the traveling-salesman problem.Physical Review E—Statistical, Nonlinear, and Soft Matter Physics. 2004, vol. 70, no. 5, p. 057701

    2004

  8. [16]

    A review of machine learning classification using quantum annealing for real-world applications

    NATH, Rajdeep Kumar; THAPLIYAL, Himanshu; HUMBLE, Travis S. A review of machine learning classification using quantum annealing for real-world applications. SN Computer science. 2021, vol. 2, no. 5, p. 365

    2021

  9. [17]

    Quantum computing and materials science: A practical guide to applying quantum annealing to the configurational analysis of materials.Journal of Applied Physics

    CAMINO, B; BUCKERIDGE, J; WARBURTON, PA; KENDON, V; WOODLEY, SM. Quantum computing and materials science: A practical guide to applying quantum annealing to the configurational analysis of materials.Journal of Applied Physics. 2023, vol. 133, no. 22

    2023

  10. [18]

    Quantum an- nealing for industry applications: Introduction and review.Reports on Progress in Physics

    YARKONI, Sheir; RAPONI, Elena; BÄCK, Thomas; SCHMITT, Sebastian. Quantum an- nealing for industry applications: Introduction and review.Reports on Progress in Physics. 2022, vol. 85, no. 10, p. 104001

    2022

  11. [19]

    D-Wave Quantum

    INC., D-Wave Quantum. D-Wave Quantum. 2025. Available also from: https : / / www . dwavequantum.com/. Accessed: 2025-04-30

    2025

  12. [20]

    An introduction to boson-sampling

    GARD, Bryan T; MOTES, Keith R; OLSON, Jonathan P; ROHDE, Peter P; DOWLING, Jonathan P. An introduction to boson-sampling. In:From atomic to mesoscale: The role of quantum coherence in systems of various complexities. World Scientific, 2015, pp. 167–192

    2015

  13. [21]

    Computational complexity

    PAPADIMITRIOU, Christos H. Computational complexity. In: Encyclopedia of computer science. 2003, pp. 260–265

    2003

  14. [22]

    Quantum computational advantage using photons.Science

    ZHONG, Han-Sen; WANG, Hui; DENG, Yu-Hao; CHEN, Ming-Cheng; PENG, Li-Chao; LUO, Yi-Han; QIN, Jian; WU, Dian; DING, Xing; HU, Yi, et al. Quantum computational advantage using photons.Science. 2020, vol. 370, no. 6523, pp. 1460–1463

    2020

  15. [23]

    Computational advantage from a quantum super- position of qubit gate orders.Physical Review Letters

    RENNER, Martin J; BRUKNER, Časlav. Computational advantage from a quantum super- position of qubit gate orders.Physical Review Letters. 2022, vol. 128, no. 23, p. 230503

    2022

  16. [24]

    Dirac’s bra-ket notation and the notion of a quantum state

    BORRELLI, Arianna. Dirac’s bra-ket notation and the notion of a quantum state. In:Styles of Thinking in Science and Technology. Proceedings of the 3rd International Conference of the European Society for the History of Science. 2010, pp. 361–371. 81

    2010

  17. [25]

    The advantages of superposition.Science

    GROVER, Lov K. The advantages of superposition.Science. 1998, vol. 280, no. 5361, pp. 228– 228

    1998

  18. [26]

    Quantum entanglement.Reviews of modern physics

    HORODECKI,Ryszard;HORODECKI,Paweł;HORODECKI,Michał;HORODECKI,Karol. Quantum entanglement.Reviews of modern physics. 2009, vol. 81, no. 2, pp. 865–942

    2009

  19. [27]

    The bloch sphere

    GLENDINNING, Ian. The bloch sphere. In:QIA meeting. Vienna. 2005

    2005

  20. [28]

    General principles of quantum mechanics

    PAULI, Wolfgang. General principles of quantum mechanics. Springer Science & Business Media, 2012

    2012

  21. [29]

    Unitary operator bases.Proceedings of the National Academy of Sci- ences

    SCHWINGER, Julian. Unitary operator bases.Proceedings of the National Academy of Sci- ences. 1960, vol. 46, no. 4, pp. 570–579

    1960

  22. [30]

    Universal quantum gates

    BRYLINSKI, Jean-Luc; BRYLINSKI, Ranee. Universal quantum gates. In:Mathematics of quantum computation. Chapman and Hall/CRC, 2002, pp. 117–134

    2002

  23. [31]

    Universality verification for a set of quantum gates.Physical Review A

    SAWICKI, Adam; MATTIOLI, Lorenzo; ZIMBORÁS, Zoltán. Universality verification for a set of quantum gates.Physical Review A. 2022, vol. 105, no. 5, p. 052602

    2022

  24. [32]

    Quantum circuit archi- tecture

    CHIRIBELLA, Giulio; D’ARIANO, G Mauro; PERINOTTI, Paolo. Quantum circuit archi- tecture. Physical review letters. 2008, vol. 101, no. 6, p. 060401

    2008

  25. [33]

    Error mitigation for short-depth quantum circuits.Physical review letters

    TEMME, Kristan; BRAVYI, Sergey; GAMBETTA, Jay M. Error mitigation for short-depth quantum circuits.Physical review letters. 2017, vol. 119, no. 18, p. 180509

    2017

  26. [34]

    Quantum compiling

    MARONESE, Marco; MORO, Lorenzo; ROCUTTO, Lorenzo; PRATI, Enrico. Quantum compiling. In:Quantum Computing Environments. Springer, 2022, pp. 39–74

    2022

  27. [35]

    On the complexity of quantum circuit compilation

    BOTEA, Adi; KISHIMOTO, Akihiro; MARINESCU, Radu. On the complexity of quantum circuit compilation. In:Proceedings of the International Symposium on Combinatorial Search. 2018, vol. 9, pp. 138–142. No. 1

    2018

  28. [36]

    Quantum circuit optimization and transpilation via parame- terized circuit instantiation

    YOUNIS, Ed; IANCU, Costin. Quantum circuit optimization and transpilation via parame- terized circuit instantiation. In:2022 IEEE International Conference on Quantum Computing and Engineering (QCE). IEEE, 2022, pp. 465–475

    2022

  29. [37]

    In: Design, Automation and Test in Europe

    MASLOV,Dmitri;YOUNG,Christina;MILLER,DMichael;DUECK,GerhardW.Quantum circuit simplification using templates. In: Design, Automation and Test in Europe. IEEE, 2005, pp. 1208–1213

    2005

  30. [38]

    Im- proving quantum computation by optimized qubit routing.Journal of Optimization Theory and Applications

    WAGNER, Friedrich; BÄRMANN, Andreas; LIERS, Frauke; WEISSENBÄCK, Markus. Im- proving quantum computation by optimized qubit routing.Journal of Optimization Theory and Applications. 2023, vol. 197, no. 3, pp. 1161–1194

    2023

  31. [39]

    Noise resilient compilation policies for quantum approximate optimization algo- rithm

    ALAM,Mahabubul;ASH-SAKI,Abdullah;LI,Junde;CHATTOPADHYAY,Anupam;GHOSH, Swaroop. Noise resilient compilation policies for quantum approximate optimization algo- rithm. In:Proceedings of the 39th International Conference on Computer-Aided Design. 2020, pp. 1–7. 82

    2020

  32. [40]

    In:Proceedings of the twenty-fourth international conference on architectural support for programming languages and operating systems

    MURALI, Prakash; BAKER, Jonathan M; JAVADI-ABHARI, Ali; CHONG, Frederic T; MARTONOSI,Margaret.Noise-adaptivecompilermappingsfornoisyintermediate-scalequan- tum computers. In:Proceedings of the twenty-fourth international conference on architectural support for programming lang...

    2019

  33. [41]

    Decompositions of general quantum gates

    MÖTTÖNEN 1, Mikko; VARTIAINEN, Juha J. Decompositions of general quantum gates. Trends in quantum computing research. 2006, p. 149

    2006

  34. [42]

    The solovay-kitaev theorem.Essay at University of Waterloo

    OZOLS, Maris. The solovay-kitaev theorem.Essay at University of Waterloo. 2009

    2009

  35. [43]

    Efficient decomposition of unitary matrices in quantum circuit compilers.Applied Sciences

    KROL, Anna M; SARKAR, Aritra; ASHRAF, Imran; AL-ARS, Zaid; BERTELS, Koen. Efficient decomposition of unitary matrices in quantum circuit compilers.Applied Sciences. 2022, vol. 12, no. 2, p. 759

    2022

  36. [44]

    Near-optimal quantum circuit construction via Cartan de- composition

    MANSKY,MaximilianBalthasar;CASTILLO,SantiagoLondoño;PUIGVERT,VictorRamos; LINNHOFF-POPIEN, Claudia. Near-optimal quantum circuit construction via Cartan de- composition. Physical Review A. 2023, vol. 108, no. 5, p. 052607

    2023

  37. [45]

    Optimizing Gate De- composition for High-Level Quantum Programming.Quantum

    ROSA, Evandro CR; DUZZIONI, Eduardo I; SANTIAGO, Rafael de. Optimizing Gate De- composition for High-Level Quantum Programming.Quantum. 2025, vol. 9, p. 1659

    2025

  38. [46]

    Qcontext: Context-aware decomposition for quan- tum gates

    LIU, Ji; BOWMAN, Max; GOKHALE, Pranav; DANGWAL, Siddharth; LARSON, Jeffrey; CHONG, Frederic T; HOVLAND, Paul D. Qcontext: Context-aware decomposition for quan- tum gates. In:2023 IEEE International Symposium on Circuits and Systems (ISCAS). IEEE, 2023, pp. 1–5

    2023

  39. [47]

    Circuit decomposition of multicontrolled special unitary single-qubit gates

    VALE, Rafaella; AZEVEDO, Thiago Melo D; ARAÚJO, Ismael CS; ARAUJO, Israel F; DA SILVA, Adenilton J. Circuit decomposition of multicontrolled special unitary single-qubit gates. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 2023, vol. 43, no. 3,...

    2023

  40. [48]

    Fermionic systems for quantum information people.Journal of Physics A: Mathematical and Theoretical

    SZALAY, Szilárd; ZIMBORÁS, Zoltán; MÁTÉ, Mihály; BARCZA, Gergely; SCHILLING, Christian; LEGEZA, Örs. Fermionic systems for quantum information people.Journal of Physics A: Mathematical and Theoretical. 2021, vol. 54, no. 39, p. 393001

    2021

  41. [49]

    Quantum.2023,vol.7,p.950

    ENDER, Kilian; HOEVEN, Roeland ter; NIEHOFF, Benjamin E; DRIEB-SCHÖN, Maike; LECHNER,Wolfgang.Parityquantumoptimization:Compiler. Quantum.2023,vol.7,p.950

    2023

  42. [50]

    Quantum operations in an information theory for fermions.Physical Re- view A

    VIDAL, Nicetu Tibau; BERA, Mohit Lal; RIERA, Arnau; LEWENSTEIN, Maciej; BERA, Manabendra Nath. Quantum operations in an information theory for fermions.Physical Re- view A. 2021, vol. 104, no. 3, p. 032411

    2021

  43. [51]

    Geometric Algebra Jordan–Wigner Transformation for Quantum Simulation.Entropy

    VEYRAC, Grégoire; TOFFANO, Zeno. Geometric Algebra Jordan–Wigner Transformation for Quantum Simulation.Entropy. 2024, vol. 26, no. 5, p. 410. 83

    2024

  44. [52]

    The Bravyi-Kitaev transformation for quantum computation of electronic structure

    SEELEY, Jacob T; RICHARD, Martin J; LOVE, Peter J. The Bravyi-Kitaev transformation for quantum computation of electronic structure. The Journal of chemical physics. 2012, vol. 137, no. 22

    2012

  45. [53]

    Superconducting qubits: Cur- rent state of play.Annual Review of Condensed Matter Physics

    KJAERGAARD,Morten;SCHWARTZ,MollieE;BRAUMÜLLER,Jochen;KRANTZ,Philip; WANG, Joel I-J; GUSTAVSSON, Simon; OLIVER, William D. Superconducting qubits: Cur- rent state of play.Annual Review of Condensed Matter Physics. 2020, vol. 11, no. 1, pp. 369– 395

    2020

  46. [54]

    Quantum-state engineering with Josephson-junction devices.Reviews of modern physics

    MAKHLIN, Yuriy; SCHÖN, Gerd; SHNIRMAN, Alexander. Quantum-state engineering with Josephson-junction devices.Reviews of modern physics. 2001, vol. 73, no. 2, p. 357

    2001

  47. [55]

    Architecture for a large-scale ion-trap quantum computer.Nature

    KIELPINSKI, David; MONROE, Chris; WINELAND, David J. Architecture for a large-scale ion-trap quantum computer.Nature. 2002, vol. 417, no. 6890, pp. 709–711

    2002

  48. [56]

    Ion trap in a semiconductor chip

    STICK, Dan; HENSINGER, WK; OLMSCHENK, Steven; MADSEN, MJ; SCHWAB, Keith; MONROE, Chris. Ion trap in a semiconductor chip. Nature Physics. 2006, vol. 2, no. 1, pp. 36–39

    2006

  49. [57]

    Toward large-scale fault-tolerant universal pho- tonic quantum computing.APL Photonics

    TAKEDA, Shuntaro; FURUSAWA, Akira. Toward large-scale fault-tolerant universal pho- tonic quantum computing.APL Photonics. 2019, vol. 4, no. 6

    2019

  50. [58]

    Neutral atom quantum register.Physical Review Letters

    SCHRADER, Dominik; DOTSENKO, I; KHUDAVERDYAN, M; MIROSHNYCHENKO, Y; RAUSCHENBEUTEL, A; MESCHEDE, D. Neutral atom quantum register.Physical Review Letters. 2004, vol. 93, no. 15, p. 150501

    2004

  51. [59]

    The problem of measurement in quantum mechanics

    JAUCH, Joseph-Maria. The problem of measurement in quantum mechanics. Helv. Phys. Acta. 1964, vol. 37, no. CERN-TH-389, pp. 293–316

    1964

  52. [60]

    Postulates for general quantum mechanics.Annals of Mathematics

    SEGAL, Irving E. Postulates for general quantum mechanics.Annals of Mathematics. 1947, vol. 48, no. 4, pp. 930–948

    1947

  53. [61]

    Basics of quantum computation.Progress in quantum electronics

    VEDRAL, Vlatko; PLENIO, Martin B. Basics of quantum computation.Progress in quantum electronics. 1998, vol. 22, no. 1, pp. 1–39

    1998

  54. [62]

    Quantum error mitigation.Reviews of Modern Physics

    CAI, Zhenyu; BABBUSH, Ryan; BENJAMIN, Simon C; ENDO, Suguru; HUGGINS, William J; LI, Ying; MCCLEAN, Jarrod R; O’BRIEN, Thomas E. Quantum error mitigation.Reviews of Modern Physics. 2023, vol. 95, no. 4, p. 045005

    2023

  55. [63]

    Measurement error mitigation in quantum computers through classical bit-flip correction.Physical Review A

    FUNCKE, Lena; HARTUNG, Tobias; JANSEN, Karl; KÜHN, Stefan; STORNATI, Paolo; WANG, Xiaoyang. Measurement error mitigation in quantum computers through classical bit-flip correction.Physical Review A. 2022, vol. 105, no. 6, p. 062404

    2022

  56. [64]

    Quantum advantage in learning from experiments.Science

    HUANG, Hsin-Yuan; BROUGHTON, Michael; COTLER, Jordan; CHEN, Sitan; LI, Jerry; MOHSENI, Masoud; NEVEN, Hartmut; BABBUSH, Ryan; KUENG, Richard; PRESKILL, John, et al. Quantum advantage in learning from experiments.Science. 2022, vol. 376, no. 6598, pp. 1182–1186. 84

    2022

  57. [65]

    Practical quantum advantage in quan- tum simulation.Nature

    DALEY, Andrew J; BLOCH, Immanuel; KOKAIL, Christian; FLANNIGAN, Stuart; PEAR- SON, Natalie; TROYER, Matthias; ZOLLER, Peter. Practical quantum advantage in quan- tum simulation.Nature. 2022, vol. 607, no. 7920, pp. 667–676

    2022

  58. [66]

    Reversible computing

    TOFFOLI, Tommaso. Reversible computing. In:International colloquium on automata, lan- guages, and programming. Springer, 1980, pp. 632–644

    1980

  59. [67]

    Notes on Landauer’s principle, reversible computation, and Maxwell’s Demon

    BENNETT, Charles H. Notes on Landauer’s principle, reversible computation, and Maxwell’s Demon. Studies In History and Philosophy of Science Part B: Studies In History and Philos- ophy of Modern Physics. 2003, vol. 34, no. 3, pp. 501–510

    2003

  60. [68]

    A literature survey of active machine learning in the context of natural language processing

    OLSSON, Fredrik. A literature survey of active machine learning in the context of natural language processing. 2009

    2009

  61. [69]

    Machine learning in finance

    DIXON, Matthew F; HALPERIN, Igor; BILOKON, Paul. Machine learning in finance. Vol. 1170. Springer, 2020

    2020

  62. [70]

    Machine learning in medicine.Circulation

    DEO, Rahul C. Machine learning in medicine.Circulation. 2015, vol. 132, no. 20, pp. 1920– 1930

    2015

  63. [71]

    Machine Learning in Chemistry

    JANET, Jon Paul; KULIK, Heather J. Machine Learning in Chemistry. Vol. 1. American Chemical Society, 2020

    2020

  64. [72]

    Supervised learning

    CUNNINGHAM, Pádraig; CORD, Matthieu; DELANY, Sarah Jane. Supervised learning. In: Machine learning techniques for multimedia: case studies on organization and retrieval. Springer, 2008, pp. 21–49

    2008

  65. [73]

    Support vector machines.IEEE Intelligent Systems and their applications

    HEARST, Marti A.; DUMAIS, Susan T; OSUNA, Edgar; PLATT, John; SCHOLKOPF, Bernhard. Support vector machines.IEEE Intelligent Systems and their applications. 1998, vol. 13, no. 4, pp. 18–28

    1998

  66. [74]

    Classification based on decision tree algo- rithm for machine learning.Journal of applied science and technology trends

    CHARBUTY, Bahzad; ABDULAZEEZ, Adnan. Classification based on decision tree algo- rithm for machine learning.Journal of applied science and technology trends. 2021, vol. 2, no. 01, pp. 20–28

    2021

  67. [75]

    An introduction to neural networks

    GURNEY, Kevin. An introduction to neural networks. CRC press, 2018

    2018

  68. [76]

    Unsupervised learning.Neural computation

    BARLOW, Horace B. Unsupervised learning.Neural computation. 1989, vol. 1, no. 3, pp. 295– 311

    1989

  69. [77]

    Clustering methods.Data mining and knowledge discovery handbook

    ROKACH, Lior; MAIMON, Oded. Clustering methods.Data mining and knowledge discovery handbook. 2005, pp. 321–352

    2005

  70. [78]

    Di- mensionality reduction: A comparative review.Journal of machine learning research

    VAN DER MAATEN, Laurens; POSTMA, Eric O; VAN DEN HERIK, H Jaap, et al. Di- mensionality reduction: A comparative review.Journal of machine learning research. 2009, vol. 10, no. 66-71, p. 13

    2009

  71. [79]

    Semi-supervised learning

    LEARNING, Semi-Supervised. Semi-supervised learning. CSZ2006. html. 2006, vol. 5, no. 2, p. 1. 85

    2006

  72. [80]

    Reinforcement learning: A survey.Journal of artificial intelligence research

    KAELBLING, Leslie Pack; LITTMAN, Michael L; MOORE, Andrew W. Reinforcement learning: A survey.Journal of artificial intelligence research. 1996, vol. 4, pp. 237–285

    1996

  73. [81]

    An overview of overfitting and its solutions

    YING, Xue. An overview of overfitting and its solutions. In:Journal of physics: Conference series. IOP Publishing, 2019, vol. 1168, p. 022022

    2019

  74. [82]

    A comprehensive survey on regularization strategies in ma- chine learning.Information Fusion

    TIAN, Yingjie; ZHANG, Yuqi. A comprehensive survey on regularization strategies in ma- chine learning.Information Fusion. 2022, vol. 80, pp. 146–166

    2022

  75. [83]

    A survey of L1 regression

    VIDAURRE, Diego; BIELZA, Concha; LARRANAGA, Pedro. A survey of L1 regression. International Statistical Review. 2013, vol. 81, no. 3, pp. 361–387

    2013

  76. [84]

    A Review of Techniques for Regular- ization

    OBI, Jude Chukwura; JECINTA, Ibebuike Chinenye. A Review of Techniques for Regular- ization. International Journal of Research in Engineering and Science. 2023, vol. 11, no. 1, pp. 360–367

    2023

  77. [85]

    Understanding dropout.Advances in neural informa- tion processing systems

    BALDI, Pierre; SADOWSKI, Peter J. Understanding dropout.Advances in neural informa- tion processing systems. 2013, vol. 26

    2013

  78. [86]

    A survey of convolu- tional neural networks: analysis, applications, and prospects.IEEE transactions on neural networks and learning systems

    LI, Zewen; LIU, Fan; YANG, Wenjie; PENG, Shouheng; ZHOU, Jun. A survey of convolu- tional neural networks: analysis, applications, and prospects.IEEE transactions on neural networks and learning systems. 2021, vol. 33, no. 12, pp. 6999–7019

    2021

  79. [87]

    A review of object detection based on convolutional neural network

    ZHIQIANG, Wang; JUN, Liu. A review of object detection based on convolutional neural network. In:2017 36th Chinese control conference (CCC). IEEE, 2017, pp. 11104–11109

    2017

  80. [88]

    A review of semantic segmentation using deep neural networks.International journal of multimedia information retrieval

    GUO, Yanming; LIU, Yu; GEORGIOU, Theodoros; LEW, Michael S. A review of semantic segmentation using deep neural networks.International journal of multimedia information retrieval. 2018, vol. 7, pp. 87–93

    2018

  81. [89]

    A survey of image classification methods and techniques for improving classification performance.International journal of Remote sensing

    LU, Dengsheng; WENG, Qihao. A survey of image classification methods and techniques for improving classification performance.International journal of Remote sensing. 2007, vol. 28, no. 5, pp. 823–870

    2007

  82. [90]

    Linear separability and classification complexity.Expert Systems with Ap- plications

    ELIZONDO, David A; BIRKENHEAD, Ralph; GAMEZ, Matias; GARCIA, Noelia; AL- FARO, Esteban. Linear separability and classification complexity.Expert Systems with Ap- plications. 2012, vol. 39, no. 9, pp. 7796–7807

    2012

  83. [91]

    What is a support vector machine?Nature biotechnology

    NOBLE, William S. What is a support vector machine?Nature biotechnology. 2006, vol. 24, no. 12, pp. 1565–1567

    2006

  84. [92]

    Logistic regression

    LAVALLEY, Michael P. Logistic regression. Circulation. 2008, vol. 117, no. 18, pp. 2395– 2399

    2008

  85. [93]

    MIT press, 1988

    MINSKY, Marvin L; PAPERT, Seymour A.Perceptrons: expanded edition. MIT press, 1988. 86

    1988

  86. [94]

    Quantum machine learning: a classical perspective.Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences

    CILIBERTO, Carlo; HERBSTER, Mark; IALONGO, Alessandro Davide; PONTIL, Massim- iliano; ROCCHETTO, Andrea; SEVERINI, Simone; WOSSNIG, Leonard. Quantum machine learning: a classical perspective.Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences. 2...

    2018

  87. [95]

    A survey of NISQ era hybrid quantum-classical machine learning re- search

    DE LUCA, Gennaro. A survey of NISQ era hybrid quantum-classical machine learning re- search. Journal of Artificial Intelligence and Technology. 2022, vol. 2, no. 1, pp. 9–15

    2022

  88. [96]

    Quantum angle encoding with learnable rotation applied to quantum–classical convolutional neural networks.Applied Soft Computing

    OVALLE-MAGALLANES,Emmanuel;ALVARADO-CARRILLO,DoraE;AVINA-CERVANTES, Juan Gabriel; CRUZ-ACEVES, Ivan; RUIZ-PINALES, Jose. Quantum angle encoding with learnable rotation applied to quantum–classical convolutional neural networks.Applied Soft Computing. 2023, vol. 141, p. 110307

    2023

  89. [97]

    Data encod- ing patterns for quantum computing

    WEIGOLD, Manuela; BARZEN, Johanna; LEYMANN, Frank; SALM, Marie. Data encod- ing patterns for quantum computing. In: Proceedings of the 27th Conference on Pattern Languages of Programs. 2020, pp. 1–11

    2020

  90. [98]

    Encoding techniques for quantum machine learning

    TUDISCO, Antonio. Encoding techniques for quantum machine learning. 2022. PhD thesis. Politecnico di Torino

    2022

  91. [99]

    Challenges and opportunities in quantum machine learning.Nature computational science

    CEREZO, Marco; VERDON, Guillaume; HUANG, Hsin-Yuan; CINCIO, Lukasz; COLES, Patrick J. Challenges and opportunities in quantum machine learning.Nature computational science. 2022, vol. 2, no. 9, pp. 567–576

    2022

  92. [100]

    What is quantum parallelism, anyhow? In:ISC High Performance 2024 Research Paper Proceedings (39th International Conference)

    MARKIDIS, Stefano. What is quantum parallelism, anyhow? In:ISC High Performance 2024 Research Paper Proceedings (39th International Conference). Prometeus GmbH, 2024, pp. 1– 12

    2024

  93. [101]

    The variational quantum eigensolver: a review of methods and best practices.Physics Reports

    TILLY,Jules;CHEN,Hongxiang;CAO,Shuxiang;PICOZZI,Dario;SETIA,Kanav;LI,Ying; GRANT, Edward; WOSSNIG, Leonard; RUNGGER, Ivan; BOOTH, George H, et al. The variational quantum eigensolver: a review of methods and best practices.Physics Reports. 2022, vol. 986, pp. 1–128

    2022

  94. [102]

    On the variational principle.Journal of Mathematical Analysis and Appli- cations

    EKELAND, Ivar. On the variational principle.Journal of Mathematical Analysis and Appli- cations. 1974, vol. 47, no. 2, pp. 324–353

    1974

  95. [103]

    On the practical usefulness of the hardware efficient ansatz.Quantum

    LEONE, Lorenzo; OLIVIERO, Salvatore FE; CINCIO, Lukasz; CEREZO, Marco. On the practical usefulness of the hardware efficient ansatz.Quantum. 2024, vol. 8, p. 1395

    2024

  96. [104]

    Strategies for quantum computing molecular energies using the unitary coupled cluster ansatz.Quantum Science and Technology

    ROMERO,Jonathan;BABBUSH,Ryan;MCCLEAN,JarrodR;HEMPEL,Cornelius;LOVE, Peter J; ASPURU-GUZIK, Alán. Strategies for quantum computing molecular energies using the unitary coupled cluster ansatz.Quantum Science and Technology. 2018, vol. 4, no. 1, p. 014008. 87

    2018

  97. [105]

    Enhanc- ing vqe convergence for optimization problems with problem-specific parameterized quan- tum circuits.IEICE TRANSACTIONS on Information and Systems

    MATSUO, Atsushi; SUZUKI, Yudai; HAMAMURA, Ikko; YAMASHITA, Shigeru. Enhanc- ing vqe convergence for optimization problems with problem-specific parameterized quan- tum circuits.IEICE TRANSACTIONS on Information and Systems. 2023, vol. 106, no. 11, pp. 1772–1782

    2023

  98. [106]

    VQE method: a short survey and recent developments.Materials Theory

    FEDOROV, Dmitry A; PENG, Bo; GOVIND, Niranjan; ALEXEEV, Yuri. VQE method: a short survey and recent developments.Materials Theory. 2022, vol. 6, no. 1, p. 2

    2022

  99. [107]

    MolecularsymmetryinVQE:adualapproachfortrapped-ionsimulationsofbenzene.In: 2023 IEEE International Conference on Quantum Computing and Engineering (QCE).IEEE,2023, vol

    GOINGS, Joshua; ZHAO, Luning; JAKOWSKI, Jacek; MORRIS, Titus; POOSER, Raphael. MolecularsymmetryinVQE:adualapproachfortrapped-ionsimulationsofbenzene.In: 2023 IEEE International Conference on Quantum Computing and Engineering (QCE).IEEE,2023, vol. 2, pp. 76–82

    2023

  100. [108]

    Quantum al- gorithms for quantum chemistry and quantum materials science.Chemical reviews

    BAUER, Bela; BRAVYI, Sergey; MOTTA, Mario; CHAN, Garnet Kin-Lic. Quantum al- gorithms for quantum chemistry and quantum materials science.Chemical reviews. 2020, vol. 120, no. 22, pp. 12685–12717

    2020

  101. [109]

    Classical Benchmarks for Variational Quantum Eigensolver Simulations of the Hub- bard Model.arXiv preprint arXiv:2408.00836

    ALVERTIS, Antonios M; KHAN, Abid; IADECOLA, Thomas; ORTH, Peter P; TUBMAN, Norm. Classical Benchmarks for Variational Quantum Eigensolver Simulations of the Hub- bard Model.arXiv preprint arXiv:2408.00836. 2024

    2024 arXiv

  102. [110]

    Accelerating VQE Algorithm via Parameters and Measurement Reuse

    LI, Xinpeng; LIU, Ji; HANSEN, Ethan H; XU, Shuai; HOVLAND, Paul; CHAUDHARY, Vipin. Accelerating VQE Algorithm via Parameters and Measurement Reuse. In:2023 IEEE International Conference on Rebooting Computing (ICRC). IEEE, 2023, pp. 1–5

    2023

  103. [111]

    Solving nuclear struc- ture problems with the adaptive variational quantum algorithm.Physical Review C

    ROMERO, AM; ENGEL, J; TANG, Ho Lun; ECONOMOU, Sophia E. Solving nuclear struc- ture problems with the adaptive variational quantum algorithm.Physical Review C. 2022, vol. 105, no. 6, p. 064317

    2022

  104. [112]

    Simulating 2d effects in lattice gauge theories on a quantum computer.PRX quantum

    PAULSON, Danny; DELLANTONIO, Luca; HAASE, Jan F; CELI, Alessio; KAN, Angus; JENA, Andrew; KOKAIL, Christian; VAN BIJNEN, Rick; JANSEN, Karl; ZOLLER, Peter, et al. Simulating 2d effects in lattice gauge theories on a quantum computer.PRX quantum. 2021, vol. 2, no. 3, p. 030334

    2021

  105. [113]

    Exploring entanglement and optimization within the hamiltonian variational ansatz.PRX quantum

    WIERSEMA, Roeland; ZHOU, Cunlu; SEREVILLE, Yvette de; CARRASQUILLA, Juan Felipe; KIM, Yong Baek; YUEN, Henry. Exploring entanglement and optimization within the hamiltonian variational ansatz.PRX quantum. 2020, vol. 1, no. 2, p. 020319

    2020

  106. [114]

    A state-averaged orbital-optimized hybrid quantum–classical algo- rithm for a democratic description of ground and excited states.Quantum Science and Tech- nology

    YALOUZ,Saad;SENJEAN,Bruno;GÜNTHER,Jakob;BUDA,Francesco;O’BRIEN,Thomas E; VISSCHER, Lucas. A state-averaged orbital-optimized hybrid quantum–classical algo- rithm for a democratic description of ground and excited states.Quantum Science and Tech- nology. 2021, vol. 6, no. 2, p. 024004

    2021

  107. [115]

    State-Averaged Orbital-Optimized VQE: A quantum algorithm for the democratic description of ground and excited electronic states.Journal of Open Source Software

    BESEDA, Martin; ILLÉSOVÁ, Silvie; YALOUZ, Saad; SENJEAN, Bruno. State-Averaged Orbital-Optimized VQE: A quantum algorithm for the democratic description of ground and excited electronic states.Journal of Open Source Software. 2024, vol. 9, no. 101, p. 6036. 88

    2024

  108. [116]

    Causality

    PEARL, Judea. Causality. Cambridge university press, 2009

    2009

  109. [117]

    On the theory of correlation.Journal of the Royal Statistical Society

    YULE, G Udny. On the theory of correlation.Journal of the Royal Statistical Society. 1897, vol. 60, no. 4, pp. 812–854

  110. [118]

    Randomized controlled trials

    STOLBERG, Harald O; NORMAN, Geoffrey; TROP, Isabelle. Randomized controlled trials. American Journal of Roentgenology. 2004, vol. 183, no. 6, pp. 1539–1544

    2004

  111. [119]

    Cambridge university press, 1990

    BOWDEN, Roger John; BOWDEN, Roger J; TURKINGTON, Darrell A.Instrumental vari- ables. Cambridge university press, 1990. No. 8

    1990

  112. [120]

    Foundations of structural causal models with cycles and latent variables.The Annals of Statistics

    BONGERS, Stephan; FORRÉ, Patrick; PETERS, Jonas; MOOIJ, Joris M. Foundations of structural causal models with cycles and latent variables.The Annals of Statistics. 2021, vol. 49, no. 5, pp. 2885–2915

    2021

  113. [121]

    Causal discovery algorithms: A practical guide.Phi- losophy Compass

    MALINSKY, Daniel; DANKS, David. Causal discovery algorithms: A practical guide.Phi- losophy Compass. 2018, vol. 13, no. 1, e12470

    2018

  114. [122]

    CAUSAL MODELING OF FACTORS IN STUNTING USING THE PETER-CLARK AND GREEDY EQUIVALENCE SEARCH ALGORITHMS

    NUR, Yohani Setiya Rafika; SA’ADAH, Aminatus; ALDO, Dasril; MASULAH, Bidayatul, et al. CAUSAL MODELING OF FACTORS IN STUNTING USING THE PETER-CLARK AND GREEDY EQUIVALENCE SEARCH ALGORITHMS. JITK (Jurnal Ilmu Penge- tahuan dan Teknologi Komputer). 2025, vol. 10, no. 3, pp. 523–533

    2025

  115. [123]

    Fast causal inference with non-random missingness by test-wise deletion.International journal of data science and an- alytics

    STROBL, Eric V; VISWESWARAN, Shyam; SPIRTES, Peter L. Fast causal inference with non-random missingness by test-wise deletion.International journal of data science and an- alytics. 2018, vol. 6, pp. 47–62

    2018

  116. [124]

    A linear non-Gaussian acyclic model for causal discovery.Journal of Machine Learn- ing Research

    SHIMIZU, Shohei; HOYER, Patrik O; HYVÄRINEN, Aapo; KERMINEN, Antti; JORDAN, Michael. A linear non-Gaussian acyclic model for causal discovery.Journal of Machine Learn- ing Research. 2006, vol. 7, no. 10

    2006

  117. [125]

    Transformation-free generation of a quasi-diabatic representation from the state- average orbital-optimized variational quantum eigensolver.arXiv preprint arXiv:2502.18194

    ILLÉSOVÁ, Silvie; BESEDA, Martin; YALOUZ, Saad; LASORNE, Benjamin; SENJEAN, Bruno. Transformation-free generation of a quasi-diabatic representation from the state- average orbital-optimized variational quantum eigensolver.arXiv preprint arXiv:2502.18194. 2025

    2025

  118. [126]

    Causal inference using deep neural net- works

    YUAN, Ye; DING, Xueying; BAR-JOSEPH, Ziv. Causal inference using deep neural net- works. arXiv preprint arXiv:2011.12508. 2020

    2011 arXiv

  119. [127]

    Principal component analysis.Wiley interdisciplinary reviews: computational statistics

    ABDI, Hervé; WILLIAMS, Lynne J. Principal component analysis.Wiley interdisciplinary reviews: computational statistics. 2010, vol. 2, no. 4, pp. 433–459

    2010

  120. [128]

    Cluster quality analysis using sil- houette score

    SHAHAPURE, Ketan Rajshekhar; NICHOLAS, Charles. Cluster quality analysis using sil- houette score. In: 2020 IEEE 7th international conference on data science and advanced analytics (DSAA). IEEE, 2020, pp. 747–748

    2020

  121. [129]

    Robust fisher discriminant anal- ysis

    KIM, Seung-Jean; MAGNANI, Alessandro; BOYD, Stephen. Robust fisher discriminant anal- ysis. Advances in neural information processing systems. 2005, vol. 18. 89

    2005

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.