The DOI matches its Crossref record; 71 of the 71 references it cites were found in a registry or an index; 1 of the 18 sources its claims cite were checked for support.
A generative modeling approach for benchmarking and training shallow quantum circuits
Open accessAbstract
Hybrid quantum-classical algorithms provide ways to use noisy intermediate-scale quantum computers for practical applications. Expanding the portfolio of such techniques, we propose a quantum circuit learning algorithm that can be used to assist the characterization of quantum devices and to train shallow circuits for generative tasks. The procedure leverages quantum hardware capabilities to its fullest extent by using native gates and their qubit connectivity. We demonstrate that our approach can learn an optimal preparation of the Greenberger-Horne-Zeilinger states, also known as “cat states”. We further demonstrate that our approach can efficiently prepare approximate representations of coherent thermal states, wave functions that encode Boltzmann probabilities in their amplitudes. Finally, complementing proposals to characterize the power or usefulness of near-term quantum devices, such as IBM’s quantum volume, we provide a new hardware-independent metric called the qBAS score. It is based on the performance yield in a specific sampling task on one of the canonical machine learning data sets known as Bars and Stripes. We show how entanglement is a key ingredient in encoding the patterns of this data set; an ideal benchmark for testing hardware starting at four qubits and up. We provide experimental results and evaluation of this metric to probe the trade off between several architectural circuit designs and circuit depths on an ion-trap quantum computer.
Overview
AI snapshot
Written from the paper’s full text.
TL;DR
The paper proposes data-driven quantum circuit learning (DDQCL), a hybrid quantum-classical generative modeling framework that uses Born-rule probabilities from shallow quantum circuits and introduces the qBAS score for benchmarking NISQ/hybrid systems. It demonstrates learning GHZ/cat-state preparations, coherent thermal states, and Bars-and-Stripes patterns in simulations and on an ion-trap quantum computer.
Key findings
- DDQCL learned GHZ-like state preparation recipes from classical samples: 3- and 5-qubit instances yielded one recipe, while 4- and 6-qubit instances yielded another; parameters converged close to π/2, and the recipes generalized to larger odd and even qubit numbers.
- For coherent thermal states with N = 5 qubits, deeper circuits (L = 3) consistently outperformed shallower circuits (L = 2 and L = 1) as the task became harder by lowering temperature from 2T_c to T_c to T_c/1.5; the inverse Bethe approximation performed extremely well in the easy task, matched L = 3 in the intermediate task, and underperformed in the difficult task.
- For BAS(2, 2), the minimum entanglement entropy of any state encoding the data set is S_BAS(2,2) = 1.25163 and the maximum is S_BAS(2,2) = 1.79248; DDQCL found a representation with S_BAS(2,2) = 1.69989. All-to-all topology outperformed sparse topologies, and qBAS(2, 2) was computed with N_reads = 15 samples.
- The qBAS score is an F1-based, hardware-independent metric on Bars and Stripes; example readout requirements include N_reads = 15 for (2, 2), 120 for (4, 4), and 16,780 for (10, 10).
Methods
- DDQCL maps binary data vectors to computational-basis states of an N-qubit circuit. The circuit uses alternating layers of arbitrary single-qubit rotations and Mølmer-Sørensen XX entangling gates; Born’s rule gives P_θ(x) = |⟨x|ψ(θ)⟩|². Training minimizes a clipped negative log-likelihood C_nll(θ) = −(1/D) Σ ln(max(ε, P_θ(x^(d)))) using gradient-free particle swarm optimization, with 1000 measurements per estimation.
- Data sets are synthetic: zero-temperature ferromagnet/GHZ, random thermal Boltzmann distributions with N = 5 qubits (and N = 6 in supplementary), and BAS(2, 2). Numerical experiments use 1000 data points sampled exactly from these distributions, 25 random initializations, and bootstrapping for error bars. Simulations used QuTiP2; experiments ran on an ion-trap quantum computer at the University of Maryland.
- The qBAS(n, m) score is the harmonic mean of precision and recall on BAS patterns, with N_reads = N_BAS(n,m) H_{N_BAS(n,m)}. The paper compares all-to-all, chain, and star entangling topologies and different layer counts.
Limitations
- The paper states that the negative log-likelihood cost becomes expensive to estimate as system size increases, that alternative cost functions are only preliminary, that optimizing N_reads is left for future work, and that KL divergence may become undefined for large n × m. It also notes simulations assumed noiseless hardware, deeper circuits did not always improve performance due to optimization/local optima, and the experimental L = 4 improvement was smaller than theoretical because the quantum computer accumulated errors in the deeper circuit.
- Evident from the text: experimental validation is limited to small instances—GHZ training up to 6 qubits, thermal states at N = 5, and BAS(2, 2) on 4 qubits—and qBAS experiments were performed on a single ion-trap device. The GHZ recipe extraction also relied on human expert inspection and rounding of learned parameters.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
41 Own interpretation · 23 Own result · 12 No basis given · 10 Not checked yet · 1 Supported so far
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The recipes obtained are summarized in Fig. 3 and were verified for larger number of qubits, both odd and even.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > GHZ state preparation
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Deeper circuits such as L = 3 (purple pentagons) consistently outperformed shallower circuits such as L = 2 (red circles) and L = 1 (yellow triangles).”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > GHZ state preparation
plaindirectn = 5- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“However, deeper circuits do not always provide significant improvements, as it is the case for all-to-all L = 4 (dark green circles) versus all-to-all L = 2 (orange circles).”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > GHZ state preparation
plainSingle case- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Finally, it is reassuring that DDQCL obtained circuits for cat state preparation starting from samples of a classical distribution.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > GHZ state preparation
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“This is an important observation, since we know, based on our empirical results, that (i) single layer circuits with no entangling gates severely underperform in producing the output state probability distribution that is close to the target data set”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > GHZ state preparation
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“As shown in Fig. 3, the learning process unveiled that these converge to the same value.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > GHZ state preparation
plainSingle case- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“DDQCL produced approximate recipes of this kind in some of the test cases for 3 and 4 qubits when using a single entangling layer with chain topology.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > GHZ state preparation
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“and (ii) when inspecting the parameters learned for circuits with all-to-all topology with L = 2 layers, we found that most of the XX gates reached their maximum entangling setting.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > GHZ state preparation
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“This became more evident as we went from easy learning tasks (Fig. 4a) to hard learning tasks (Fig. 4c).”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > GHZ state preparation
plaincorrelationaln = 5- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We demonstrate that our approach can learn an optimal preparation of the Greenberger-Horne-Zeilinger states, also known as “cat states”.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > Abstract
boosteddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Probably not a substantial claim. 32
- It may state two separate claims as one. 20
- The quote only partly states this claim. 2
The sources with a verdict support this claim; the rest weren’t checked yet, have no full text we could read, or their verdicts aren’t rated yet.
In the paper
“For example, learning probabilistic generative models is in many cases an intractable task, and quantum-assisted algorithms have been proposed for both gate-based 17,18 and quantum annealing devices.[19][20][21][22][23]”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > INTRODUCTION
What the sources say
- Not checked yetcites [17] Nathan Wiebe, K. M. S. & Kapoor, A. Quantum deep learning. Preprint at arXiv:1412.3489 (2015).
- Supportedcites [18] Kieferová, M. & Wiebe, N. Tomography and generative training with quantum boltzmann machines. Phys. Rev. A 96, 062327 (2017). source
In “Tomography and Generative Data Modeling via Quantum Boltzmann Training” (p. 3), the paper says the training objective is unlikely to be generically computable because calculating a required term is #P-hard. This supports the qualified claim that learning probabilistic generative models can be intractable, rather than claiming that every such model is hard to train. (LLM, conf=0.87)
- Not checked yetcites [19][20][21][22][23]
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim.
In the paper
“Furthermore, the maximum value that a quantum representation of BAS(2, 2) can reach is S BAS(2,2) = 1.79248, which happens to be the maximum entanglement entropy known for any four-qubit state 56 (see also Fig. S5 and the corresponding Section in the Supplementary Material).”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > GHZ state preparation
What the sources say
- Not checked yetcites [56] Higuchi, A. & Sudbery, A. W. How entangled can two couples get? Phys. Lett. A 273, 213–217 (2000). source
boosted- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Instances of 3 and 5 qubits yielded a recipe, while instances of 4 and 6 qubit yielded another recipe.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > GHZ state preparation
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The minimum value of entanglement entropy that any such state can have is S BAS(2,2) = 1.25163.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > GHZ state preparation
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“As shown in Fig. 4, the inverse Bethe approximation (green bar) performed extremely well in the easy task (a), matched the L = 3 quantum circuit in the intermediate task (b), and underperformed on the difficult task (c).”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > GHZ state preparation
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The score is sensitive to the depth of the circuit as shown by the performance improvement of L = 4 compared with L = 2 in the star topology.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > GHZ state preparation
plaindirectn = 15- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“All the topologies achieve a lower median KL divergence and the confidence intervals shrink.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > Bootstrapping analysis
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“Finally, tapping into the real power of near-term quantum devices and approximate algorithms implementable on them, we designed a task-specific performance estimator based on a canonical data set.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > DISCUSSION
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
The quote only partly states this claim.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The chain topology (purple squares) performs slightly better than the star topology (red stars) even though they have the same number of parameters.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > Bootstrapping analysis
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“To summarize, first, we learned a GHZ state preparation recipe for an ion trap quantum computer.Minimal intervention by a human expert allowed to generalize the recipe to any number of qubits.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > DISCUSSION
plaindirectSingle case- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“We note that a more general performance indicator than qBAS (n, m) score is indeed the KL divergence, D KL [P BAS(n,m) |P θ ].”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > The learning pipeline
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
None of the sources cited for this claim have been checked yet.
In the paper
“We start by noting that the four-qubit cat state, whose rich entangled nature makes it ideal for studying decoherence and decay of quantum information, 49,51 has entanglement entropy S GHZ = 1.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > GHZ state preparation
What the sources say
- Not checked yetcites [49] Monz, T. et al. 14-qubit entanglement: creation and coherence. Phys. Rev. Lett. 106, 130506 (2011). source
- Not checked yetcites [51] Ozaeta, A. & McMahon, P. L. Decoherence of up to 8-qubit entangled states in a 16-qubit superconducting quantum processor. Quantum Sci. Technol. 4, 025015 (2019). source
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“DDQCL prepares a quantum state without the assumption of an underlying Boltzmann distribution, while the inverse Bethe approximation infers the parameters with such assumption.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > GHZ state preparation
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In all these cases, the qBAS score can still be computed and the number of measurements N reads necessary for obtaining a robust estimate continues to remain relatively small to be practical for intermediate size n × m.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > The learning pipeline
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
- The authors state this as an assumption: For setting N_reads, the model distribution is equal to the target distribution P_BAS(n,m).
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“It would be much more difficult to analyze parameters found with noisy hardware, as DDQCL can learn to compensate certain types of noise, e.g., systematic parameter offsets, in non-trivial ways.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > GHZ state preparation
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
In the paper
“Other classical methods based on machine learning and Markov Chain Monte Carlo, such as the Boltzmann machine, 55 could achieve higher accuracy by requiring more computational resources than the inverse Bethe approximation used here.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > GHZ state preparation
What the sources say
- Not checked yetcites [55] Ackley, D. H., Hinton, G. E. & Sejnowski, T. J. A learning algorithm for boltzmann machines. Cogn. Sci. 9, 147–169 (1985). source
hedgedconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
None of the sources cited for this claim have been checked yet.
In the paper
“Hybrid quantum-classical algorithms, such as the variational quantum eigensolver 2,3 (VQE) and the quantum approximate optimization algorithm 4,5 (QAOA), provide ways to use NISQ computers for practical applications.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > INTRODUCTION
What the sources say
- Not checked yetcites [2] Peruzzo, A. et al. A variational eigenvalue solver on a photonic quantum processor. Nat. Commun. 5, 4213 EP (2014). source
- Not checked yetcites [3] McClean, J. R., Romero, J., Babbush, R. & Aspuru-Guzik, A. The theory of variational hybrid quantum-classical algorithms. New J. Phys. 18, 023023 (2016). source
- Not checked yetcites [4] Edward Farhi, S. G. & Goldstone, J. A. quantum approximate optimization algorithm. Preprint at arXiv:1411.4028 (2014).
- Not checked yetcites [5] Hadfield, S. et al. From the quantum approximate optimization algorithm to a quantum alternating operator ansatz. Algorithms 12, 34 (2019). source
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
In the paper
“Although optimization tasks offer a great niche of applications, probabilistic tasks involving sampling have most of the potential to prove quantum advantage in the near-term.[14][15][16]”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > INTRODUCTION
What the sources say
- Not checked yetcites [14][15][16]
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: fails — It may be too vague to check against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. It may be too vague to check against evidence.
In the paper
“Furthermore, the error in the inverse Bethe approximation is expected to go to zero with system size, and only above the reference temperature T c (see Section “Methods” for details).”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > GHZ state preparation
What the sources say
- Not checked yetcites Methods
hedgedcorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In other words, we can slightly reduce the number of parameter without changing the expressive power of the circuit.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > Simulation of quantum circuits in silico
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one. The quote only partly states this claim.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Moreover, the score depends on the classical resources, hyperparameters, and various design choices, making it a good choice for the assessment of the hybrid system as a whole.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > INTRODUCTION
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Hence, any miscalibration or environmental noise will affect this single performance number, enabling comparison between different devices or across different generations of the same device.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > INTRODUCTION
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Similarly, one may use the score to compare classical resources of the hybrid system (e.g., different optimizers).”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > GHZ state preparation
hedgedconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Once the number of layers and topology of entangling gates is fixed, the quantum circuits described above provide a template; by adjusting the parameters we can implement a small subset of the unitaries that are in principle allowed in the Hilbert space.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > Gradient-free optimization
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
In the paper
“Previous implementations of Born machines [25][26][27][28] often relied on the construction of tensor networks and their efficient manipulation through graphical-processing units.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > INTRODUCTION
What the sources say
- Not checked yetcites [25][26][27][28]
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The total number of parameters per entangling layer depends on the chosen topology: all is a fully-connected graph and has N(N -1)/2 parameters, chain is a one-dimensional nearest neighbor graph with N -1 parameters, and star is a star-shaped graph with N-1 parameters.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > Simulation of quantum circuits in silico
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In this work, we presented a data-driven quantum circuit learning algorithm (DDQCL) as a framework that can assist in the characterization of NISQ devices and to implement simple generative models.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > DISCUSSION
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Although we compared circuits implemented on the same ion trap hardware, the score may be used to compare different device generations or even completely different architectures (e.g., superconductor-based versus atomic-based).”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > GHZ state preparation
hedgedconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds. It may state two separate claims as one.
In the paper
“Bars and stripes BAS 47 is a canonical machine learning data set for testing generative models.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > GHZ state preparation
What the sources say
- Not checked yetcites [47] MacKay, D. J. C. Information Theory, Inference and Learning Algorithms. (Cambridge University Press, New York, 2002).
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The only way to reproduce the zero-temperature ferromagnet distribution in our setting is to implement a unitary transformation that prepares a GHZ-like state.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > GHZ state preparation
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Errors in the device will affect this single performance measure, the qBAS score, which can be used to compare different device generations, or completely different architectures.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > DISCUSSION
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Note that the number of measurements needed to obtain an unbiased estimate of the relevant probabilities may not scale favorably with the number of qubits N.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > The learning pipeline
hedgedconditional- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“This is not an example of compilation, but rather an illustration of how simple classical probability distributions can guide the synthesis of interesting non-trivial quantum states.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > DISCUSSION
plainSingle case- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The zero-temperature ferromagnet distribution is equivalent to assigning 1/2 probability to both |0…0〉 and |1…1〉 states of the computational basis.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > GHZ state preparation
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“In contrast, our work does not assume a Boltzmann distribution and therefore does not require a specific sampling beyond Born's rule.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > INTRODUCTION
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The qBAS score can also be used to benchmark the typical performance of optimizers used in hybrid quantum-classical systems.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > DISCUSSION
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Depending on the level or type of noise in the system, the same algorithm could lead to a different circuit fulfilling the same probability distribution as that of the data.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > DISCUSSION
hedgeddirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The bars and stripes data is easy to generate, visualize and verify classically, while modeling it still requires significant quantum resources in the form of entanglement.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > DISCUSSION
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Yet, implementing a shallow circuit that can uniformly sample such data is hard; we will show that some candidate solutions require large amount of entanglement.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > INTRODUCTION
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Our approach has the bidirectional capability of using NISQ devices for machine learning, and machine learning for the characterization of NISQ devices.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > DISCUSSION
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds. It may state two separate claims as one.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In this paper, we propose the qBAS score, a complementary metric designed for benchmarking hybrid quantum-classical systems.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > INTRODUCTION
plaincorrelational- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“In this paper, we used the negative log-likelihood which quickly becomes expensive to estimate as the size of the system increases.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > DISCUSSION
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Finally, complementing proposals to characterize the power or usefulness of near-term quantum devices, such as IBM's quantum volume, we provide a new hardware-independent metric called the qBAS score.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > Abstract
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The total number of parameters per entangling layer depends on the chosen topology: all is a fully-connected graph and has N(N -1)/2 parameters, chain is a one-dimensional nearest neighbor graph with N -1 parameters, and star is a star-shaped graph with N-1 parameters.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > Simulation of quantum circuits in silico
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“The score can be computed in any of the NISQ architectures available to date.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > DISCUSSION
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: fails — The paper may give no reason why it holds.
Probably not a substantial claim. The paper may give no reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“DDQCL is a modular framework and its performance will ultimately depend on the choices made for such modules.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > DISCUSSION
plaindirect- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The paper states this without a source or data behind it here, so there is nothing to check it against. The quote shows it is in the paper.
In the paper
“The total number of parameters per entangling layer depends on the chosen topology: all is a fully-connected graph and has N(N -1)/2 parameters, chain is a one-dimensional nearest neighbor graph with N -1 parameters, and star is a star-shaped graph with N-1 parameters.”
§ A generative modeling approach for benchmarking and training shallow quantum circuits > Simulation of quantum circuits in silico
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: fails — The paper’s conclusions may not depend on it.
- Based: passes — The paper gives a reason why it holds.
Probably not a substantial claim. The paper’s conclusions may not depend on it.
The authors state this as an assumption.
The data vectors in the data set D are independent and identically distributed random vectors.
“The data set D ¼ ðx ð1Þ ; ; x ðDÞ Þ is a collection of D independent and identically distributed random vectors.”
The authors state this as an assumption.
For setting N_reads, the model distribution is equal to the target distribution P_BAS(n,m).
“Assuming a perfect model distribution P BAS(n,m) = 1/ N BAS(n,m) , the expected number of measurements to obtain a value of r = 1.0 can be estimated using the famous coupon collector's problem.”
The authors state this as an assumption.
For simulations in silico, perfect gate fidelities and error-free measurements are assumed.
“For the simulations in silico, we also assume perfect gate fidelities and error-free measurements.”
The paper relies on this without support.
In the current ion trap experimental setup, arbitrary single-qubit rotations and Mølmer-Sørensen XX entangling gates involving any two qubits can be performed.
“In the current experimental setup, we can perform arbitrary single qubit rotations and Mølmer-Sørensen XX entangling gates involving any two qubits.”
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The cited source says what the claim attributes to it.
In the citing paper
“Benedetti et al. [10] proposed the qBAS score metric for benchmarking the shallow quantum-classical hybrid systems using synthetic data set.”
From QASMBench: A Low-Level Quantum Benchmark Suite for NISQ Evaluation and Simulation (2023) · cites this paper as [10]
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“Quantum autoencoders have seen experimental implementation on quantum hardware [168], and will likely be an important primitive in QML.”
From Variational quantum algorithms (2021) · cites this paper as [168]
Experimental — accuracy not yet measured
Citations
Cites
Kennedy, J., & Eberhart, R. (2002) · Proceedings of ICNN'95 - International Conference on Neural Networks · doi:10.1109/icnn.1995.488968 · Cited by 58,192
On Information and Sufficiency
Kullback, S., & Leibler, R. A. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729694 · Cited by 20,193
(2016) · Cited by 11,679
A modified particle swarm optimizer
Shi, Y., & Eberhart, R. C. (2002) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/icec.1998.699146 · Cited by 11,082
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
Information theory, inference, and learning algorithms
(2004) · Choice Reviews Online · doi:10.5860/choice.41-5949 · Cited by 6,536
The Earth Mover's Distance as a Metric for Image Retrieval
Rubner, Y., Tomasi, C., & Guibas, L. (2000) · International Journal of Computer Vision · doi:10.1023/a:1026543900054 · Cited by 5,547
Information Theory, Inference, and Learning Algorithms
(2004) · Kybernetes · doi:10.1108/03684920410534506 · Cited by 4,937
A variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552 · cited 5×
“Figure 2 on the top left panel shows patterns belonging to BAS(2, 2), while the top central panel shows the remaining patterns.”
BackgroundMethodInfluentialA learning algorithm for Boltzmann machines
Ackley, D. H., Hinton, G. E., & Sejnowski, T. J. (1985) · Cognitive Science · doi:10.1207/s15516709cog0901_7 · Cited by 3,402
Research works printed but not linked: 1
- Monz, T. et al. 14-qubit entanglement: creation and coherence. Phys. Rev. Lett. 106, 130506 (2011). · DOI · Paper page
Cited by
Sorted by citations
Items 101–200 of 386
A Grover-search based quantum learning scheme for classification
Du, Y., Hsieh, M.-H., Liu, T., & Tao, D. (2021) · New Journal of Physics · doi:10.1088/1367-2630/abdefa · Cited by 46
Quantum self-supervised learning
Jaderberg, B., Anderson, L. W., Xie, W., Albanie, S., Kiffner, M., & Jaksch, D. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac6825 · Cited by 48
Quantum utility – definition and assessment of a practical quantum advantage
Herrmann, N., Arya, D., Doherty, M. W., Mingare, A., Pillay, J. C., Preis, F., & Prestel, S. (2023) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw59989.2023.00028 · Cited by 53
Toward convergence of effective-field-theory simulations on digital quantum computers
Shehab, O., Landsman, K. A., Nam, Y., Zhu, D., Linke, N. M., Keesan, M., Pooser, R. C., & Monroe, C. R. (2019) · Physical Review A · doi:10.1103/physreva.100.062319 · Cited by 40
Self-citationVariational quantum algorithms: fundamental concepts, applications and challenges
Qi, H., Xiao, S., Liu, Z., Gong, C., & Gani, A. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04438-2 · Cited by 51
Cherrat, E. A., Raj, S., Kerenidis, I., Shekhar, A., Wood, B., Dee, J., Chakrabarti, S., Chen, R., Herman, D., Hu, S., et al. (2023) · Quantum · doi:10.22331/q-2023-11-29-1191 · Cited by 37
Scrambling ability of quantum neural network architectures
Wu, Y., Zhang, P., & Zhai, H. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.l032057 · Cited by 35
A Comprehensive Survey on Quantum Machine Learning and Possible Applications
Umer, M. J., & Sharif, M. I. (2022) · International Journal of E-Health and Medical Communications · doi:10.4018/ijehmc.315730 · Cited by 41
One T Gate Makes Distribution Learning Hard
Hinsche, M., Ioannou, M., Nietner, A., Haferkamp, J., Quek, Y., Hangleiter, D., Seifert, J., Eisert, J., & Sweke, R. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.240602 · Cited by 61
Mitarai, K., Suzuki, Y., Mizukami, W., Nakagawa, Y. O., & Fujii, K. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.033012 · Cited by 33
Preserving Symmetries for Variational Quantum Eigensolvers in the Presence of Noise
Barron, G. S., Gard, B., Altman, O. J., Mayhall, N. J., Barnes, E., & Economou, S. E. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.16.034003 · Cited by 38
A Characterization of Quantum Generative Models
Riofrío, C. A., Mitevski, O., Jones, C. R., Krellner, F., Vuckovic, A., Doetsch, J. A., Klepsch, J., Ehmer, T., & Luckow, A. (2024) · ACM Transactions on Quantum Computing · doi:10.1145/3655027 · Cited by 41
Classical simulations of noisy variational quantum circuits
Fontana, E., Rudolph, M. S., Duncan, R., Rungger, I., & Cîrstoiu, C. (2025) · npj Quantum Information · doi:10.1038/s41534-024-00955-1 · Cited by 81
Ding, Y., & Chong, F. T. (2020) · Synthesis lectures on computer architecture · doi:10.2200/s01014ed1v01y202005cac051 · Cited by 63
Do quantum circuit Born machines generalize?
Gili, K., Hibat-Allah, M., Mauri, M., Ballance, C. J., & Perdomo‐Ortiz, A. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/acd578 · Cited by 40
Self-citationAn invitation to distributed quantum neural networks
Pira, L., & Ferrie, C. (2023) · Quantum Machine Intelligence · doi:10.1007/s42484-023-00114-3 · Cited by 32
Quantum Natural Language Processing
Widdows, D., Aboumrad, W., Kim, D., Ray, S., & Mei, J. (2024) · Künstliche Intell. · doi:10.1007/s13218-024-00861-w · Cited by 38
Engineered dissipation to mitigate barren plateaus
Sannia, A., Tacchino, F., Tavernelli, I., Giorgi, G. L., & Zambrini, R. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00875-0 · Cited by 43
Probabilistic Modeling with Matrix Product States
STOKES, J. M., & Terilla, J. (2019) · Entropy · doi:10.3390/e21121236 · Cited by 34
Tamiya, S., & Yamasaki, H. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00592-6 · Cited by 37
Entangled Datasets for Quantum Machine LearningPreprint
Schatzki, L., Arrasmith, A., Coles, P. J., & Cerezo, M. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.03400 · Cited by 72
Quantum mixed-state self-attention network
Fu, C., Zhao, Q., Feng, L., Chen, C., Lin, Y., & Lin, J. (2025) · Neural Networks · doi:10.1016/j.neunet.2025.107123 · Cited by 39
Tight and Efficient Gradient Bounds for Parameterized Quantum Circuits
Letcher, A., Woerner, S., & Zoufal, C. (2024) · Quantum · doi:10.22331/q-2024-09-25-1484 · Cited by 30
Quantum Computer-Aided Design: Digital Quantum Simulation of Quantum Processors
Kyaw, T. H., Menke, T., Sim, S., Anand, A., Sawaya, N. P. D., Oliver, W. D., Guerreschi, G. G., & Aspuru‐Guzik, A. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.16.044042 · Cited by 27
Cost-function embedding and dataset encoding for machine learning with parametrized quantum circuits
Cao, S., Wossnig, L., Vlastakis, B., Leek, P., & Grant, E. (2020) · Physical Review A · doi:10.1103/physreva.101.052309 · Cited by 30
An application benchmark for fermionic quantum simulations
Dallaire-Demers, P.-L., Stęchły, M., Gonthier, J. F., Bashige, N. T., Romero, J., & Cao, Y. (2020) · arXiv · doi:10.48550/arxiv.2003.01862 · Cited by 25
The barren plateaus of quantum neural networks: review, taxonomy and trends
Qi, H., Wang, L., Zhu, H., Gani, A., & Gong, C. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04188-7 · Cited by 31
Neural-network-encoded variational quantum algorithms
Miao, J., Hsieh, C., & Zhang, S. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.21.014053 · Cited by 28
Learning Shallow Quantum Circuits
Huang, H.-Y., Liu, Y., Broughton, M., Kim, I. H., Anshu, A., Landau, Z. A., & McClean, J. R. (2024) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/3618260.3649722 · Cited by 60
Error-mitigated data-driven circuit learning on noisy quantum hardware
Hamilton, K. E., & Pooser, R. C. (2020) · Quantum Machine Intelligence · doi:10.1007/s42484-020-00021-x · Cited by 23
Born machine model based on matrix product state quantum circuit
Gong, L., Xiang, L.-Z., Liu, S., & Zhou, N. (2022) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2022.126907 · Cited by 26
Tensor networks in machine learning
Sengupta, R., Adhikary, S., Oseledets, I. V., & Biamonte, J. (2022) · European Mathematical Society Magazine · doi:10.4171/mag/101 · Cited by 37
SoK: Benchmarking the Performance of a Quantum Computer
Wang, J., Guo, G., & Shan, Z. (2022) · Entropy · doi:10.3390/e24101467 · Cited by 27
The impact of cost function globality and locality in hybrid quantum neural networks on NISQ devices
Kashif, M., & Al-Kuwari, S. M. (2023) · Machine Learning Science and Technology · doi:10.1088/2632-2153/acb12f · Cited by 33
Optimal training of variational quantum algorithms without barren plateausPreprint
Haug, T., & Kim, M. S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2104.14543 · Cited by 55
Liu, W., Zhang, Y., Deng, Z., Zhao, J., & Tong, L. (2021) · EURASIP Journal on Wireless Communications and Networking · doi:10.1186/s13638-021-01898-3 · Cited by 24
Evolving objective function for improved variational quantum optimization
Kolotouros, I., & Wallden, P. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023225 · Cited by 24
Squeezing and quantum approximate optimization
Santra, G. C., Jendrzejewski, F., Hauke, P., & Egger, D. J. (2024) · Physical Review A · doi:10.1103/physreva.109.012413 · Cited by 27
Boltzmann machine learning with a variational quantum algorithm
Shingu, Y., Seki, Y., Watabe, S., Endo, S., Matsuzaki, Y., Kawabata, S., Nikuni, T., & Hakoshima, H. (2021) · Physical Review A · doi:10.1103/physreva.104.032413 · Cited by 27
Quantum Computing for High-Energy Physics: State of the Art and ChallengesPreprint
Meglio, A. D., Jansen, K., Tavernelli, I., Alexandrou, C., Arunachalam, S., Bauer, C., Borras, K., Carrazza, S., Crippa, A., Croft, V. A., et al. (2023) · arXiv (Cornell University) · doi:10.3204/pubdb-2023-04595 · Cited by 24
Quantum optimization for training quantum neural networks
Liao, Y., Hsieh, M.-H., & Ferrie, C. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00169-w · Cited by 36
Robust quantum control in closed and open systems: Theory and practice
Weidner, C. A., Reed, E. A., Monroe, J., Sheller, B., O’Neil, S. P., Maas, E., JONCKHEERE, E. A., Langbein, F. C., & Schirmer, S. G. (2024) · Automatica · doi:10.1016/j.automatica.2024.111987 · Cited by 23
Reducing the Amount of Single‐Qubit Rotations in VQE and Related Algorithms
Rasmussen, S. E., Loft, N. J. S., Bækkegaard, T., Kues, M., & Zinner, N. T. (2020) · Advanced Quantum Technologies · doi:10.1002/qute.202000063 · Cited by 22
Certified Robustness of Quantum Classifiers Against Adversarial Examples Through Quantum Noise
Huang, J.-C., Tsai, Y.-L., Yang, C.-H. H., Su, C.-F., Yu, C.-M., Chen, P., & Kuo, S. (2023) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp49357.2023.10095030 · Cited by 22
Addressing Temporal Variations in Qubit Quality Metrics for Parameterized Quantum Circuits
Alam, M., Saki, A. A., & Ghosh, S. (2019) · International Symposium on Low Power Electronics and Design (ISLPED) · doi:10.1109/islped.2019.8824907 · Cited by 23
Accelerating Scientific Computing in the Post-Moore’s Era
Hamilton, K. E., Schuman, C. D., Young, S. R., Bennink, R. S., Imam, N., & Humble, T. S. (2020) · ACM Transactions on Parallel Computing · doi:10.1145/3380940 · Cited by 24
Dynamical learning of a photonics quantum-state engineering process
Suprano, A., Zia, D., Polino, E., Giordani, T., Innocenti, L., Ferraro, A., Paternostro, M., Spagnolo, N., & Sciarrino, F. (2021) · Advanced Photonics · doi:10.1117/1.ap.3.6.066002 · Cited by 20
Practical overview of image classification with tensor-network quantum circuits
Guala, D., Zhang, S., Cruz, E., Riofrío, C. A., Klepsch, J., & Arrazola, J. M. (2023) · Scientific Reports · doi:10.1038/s41598-023-30258-y · Cited by 22
A Herculean task: classical simulation of quantum computers
Xu, X., Benjamin, S. C., Chen, J., Sun, J., Yuan, X., & Zhang, P. (2025) · 中国科学通报：英文版 · doi:10.1016/j.scib.2025.10.016 · Cited by 57
Natural parametrized quantum circuit
Haug, T., & Kim, M. S. (2022) · Physical Review A · doi:10.1103/physreva.106.052611 · Cited by 23
Conditional quantum circuit Born machine based on a hybrid quantum–classical framework
Zeng, Q.-W., Ge, H.-Y., Gong, C., & Zhou, N. (2023) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2023.128693 · Cited by 21
Automated Quantum Hardware Selection for Quantum Workflows
Weder, B., Barzen, J., Leymann, F., & Salm, M. (2021) · Electronics · doi:10.3390/electronics10080984 · Cited by 19
Quantum Quantile Mechanics: Solving Stochastic Differential Equations for Generating Time‐Series
Paine, A. E., Elfving, V. E., & Kyriienko, O. (2023) · Advanced Quantum Technologies · doi:10.1002/qute.202300065 · Cited by 28
Unsupervised quantum circuit learning in high energy physics
Delgado, A., & Hamilton, K. E. (2022) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.106.096006 · Cited by 22
On the expressivity of embedding quantum kernels
Gil-Fuster, E., Eisert, J., & Dunjko, V. (2024) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ad2f51 · Cited by 19
Gyöngyösi, L., & Imre, S. (2025) · Quantum Information and Computation · doi:10.2478/qic-2025-0006 · Cited by 20
Quantum algorithm for credit valuation adjustments
Alcazar, J. A., Cadarso, A., Katabarwa, A., Mauri, M., Peropadre, B., Wang, G., & Cao, Y. (2022) · New Journal of Physics · doi:10.1088/1367-2630/ac5003 · Cited by 19
Protocols for trainable and differentiable quantum generative modeling
Kyriienko, O., Paine, A. E., & Elfving, V. E. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033291 · Cited by 39
Priyanka, G., Venkatesan, M., & Prabhavathy, P. (2023) · International Conference on Quantum Technologies, Communications, Computing, Hardware and Embedded Systems Security (iQ-CCHESS) · doi:10.1109/iq-cchess56596.2023.10391745 · Cited by 18
Statistical Complexity of Quantum Learning
Banchi, L., Pereira, J. L., Jose, S. T., & Simeone, O. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202300311 · Cited by 16
Generalization metrics for practical quantum advantage in generative models
Gili, K., Mauri, M., & Perdomo‐Ortiz, A. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.21.044032 · Cited by 17
Self-citationQuantum algorithm for MUSIC-based DOA estimation in hybrid MIMO systems
Meng, F., Li, Z., Yu, X., & Zhang, Z. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/ac44dd · Cited by 15
Quantum image compression with autoencoders based on parameterized quantum circuits
Wang, H., Tan, J., Huang, Y., & Zheng, W. (2024) · Quantum Information Processing · doi:10.1007/s11128-023-04243-3 · Cited by 15
Quantum Computing Through the Lens of Control: A Tutorial Introduction
Berberich, J., & Fink, D. (2024) · IEEE Control Systems · doi:10.1109/mcs.2024.3466448 · Cited by 22
Computationally Efficient Quantum Expectation with Extended Bell Measurements
Kondo, R., Sato, Y., Koide, S., Kajita, S., & Takamatsu, H. (2022) · Quantum · doi:10.22331/q-2022-04-13-688 · Cited by 15
Mintz, T. M., McCaskey, A., Dumitrescu, E., Moore, S., Powers, S., & Lougovski, P. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.02457 · Cited by 15
FLIP: A flexible initializer for arbitrarily-sized parametrized quantum circuitsPreprint
Sauvage, F., Sim, S., Kunitsa, A. A., Simon, W., Mauri, M., & Perdomo‐Ortiz, A. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.08572 · Cited by 32
Self-citationEVOVAQ: EVOlutionary algorithms-based toolbox for VAriational Quantum circuits
Acampora, G., Cano, C., Chiatto, A., Soto-Hidalgo, J. M., & Vitiello, A. (2024) · SoftwareX · doi:10.1016/j.softx.2024.101756 · Cited by 15
Towards a scalable discrete quantum generative adversarial neural network
Chaudhary, S., Huembeli, P., MacCormack, I., Patti, T. L., Kossaifi, J., & Galda, A. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/acc4e4 · Cited by 16
Quantum Computing and Quantum Machine Learning Classification – A Survey
Kuppusamy, P., Kumar, N. Y., Dontireddy, J., & Iwendi, C. (2022) · IEEE International Conference on Cybernetics, Cognition and Machine Learning Applications (ICCCMLA) · doi:10.1109/icccmla56841.2022.9989137 · Cited by 14
Symmetric tensor networks for generative modeling and constrained combinatorial optimization
Lopez-Piqueres, J., Chen, J., & Perdomo‐Ortiz, A. (2023) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ace0f5 · Cited by 18
Self-citationEnhancing adversarial robustness of quantum neural networks by adding noise layers
Huang, C., & Zhang, S. (2023) · New Journal of Physics · doi:10.1088/1367-2630/ace8b4 · Cited by 13
Studying the Impact of Quantum-Specific Hyperparameters on Hybrid Quantum-Classical Neural Networks
Zaman, K., Ahmed, T., Kashif, M., Hanif, M. A., Marchisio, A., & Shafique, M. (2025) · Communications in computer and information science · doi:10.1007/978-3-031-85884-0_11 · Cited by 13
Network attack traffic detection with hybrid quantum-enhanced convolution neural network
Wang, Z., Fok, K. W., & Thing, V. L. L. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00278-0 · Cited by 13
Introducing nonlinear activations into quantum generative models
Gili, K., Sveistrys, M., & Ballance, C. J. (2023) · Physical Review A · doi:10.1103/physreva.107.012406 · Cited by 18
A continuous variable Born machine
Čepaitė, I., Coyle, B., & Kashefi, E. (2022) · Quantum Machine Intelligence · doi:10.1007/s42484-022-00063-3 · Cited by 18
A multi-classification classifier based on variational quantum computation
Zhou, J., Li, D., Tan, Y., Yang, X., Zheng, Y., & Liu, X. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-04151-6 · Cited by 14
Variational Quantum-Classical Algorithms: A Review of Theory, Applications, and Opportunities
Adebayo, P., Basaky, F., & Osaghae, E. (2023) · UMYU Scientifica · doi:10.56919/usci.2324.008 · Cited by 13
A Conditional Generative Model Based on Quantum Circuit and Classical Optimization
He, Z., Li, L., Zheng, S., Huang, Z., & Situ, H. (2019) · International Journal of Theoretical Physics · doi:10.1007/s10773-019-04005-x · Cited by 12
Protocols for classically training quantum generative models on probability distributions
Kasture, S., Kyriienko, O., & Elfving, V. E. (2023) · Physical Review A · doi:10.1103/physreva.108.042406 · Cited by 17
Denoising diffusion models with optimized quantum implicit neural networks for image generation
Zhang, J., Che, X., Fan, Y., Peng, S., Chen, G., Ma, Q., & Hu, J. (2025) · Future Generation Computer Systems · doi:10.1016/j.future.2025.107875 · Cited by 14
F-Divergences and Cost Function Locality in Generative Modelling with Quantum Circuits
Leadbeater, C., Sharrock, L., Coyle, B., & Benedetti, M. (2021) · Entropy · doi:10.3390/e23101281 · Cited by 14
Self-citationBenchmarking quantum state transfer on quantum devices
Huang, Y.-T., Lin, J.-D., Ku, H.-Y., & Chen, Y.-N. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.023038 · Cited by 13
VQE-generated quantum circuit dataset for machine learning
Nakayama, A., Mitarai, K., Placidi, L., Sugimoto, T., & Fujii, K. (2025) · Physical Review Research · doi:10.1103/c43x-9866 · Cited by 24
ORQVIZ: Visualizing High-Dimensional Landscapes in Variational Quantum AlgorithmsPreprint
Rudolph, M. S., Sim, S., Raza, A., Stęchły, M., McClean, J. R., Anschuetz, E. R., Serrano, L., & Perdomo‐Ortiz, A. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.04695 · Cited by 19
Self-citationQuantum variational learning for entanglement witnessing
Scala, F., Mangini, S., Macchiavello, C., Bajoni, D., & Gerace, D. (2022) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn55064.2022.9892080 · Cited by 11
Emerging Applications and Challenges in Quantum Computing: A Literature Survey
Garewal, I. K., Mahamuni, C. V., & Jha, S. (2024) · International Conference on Artificial Intelligence, Big Data, Computing and Data Communication Systems (icABCD) · doi:10.1109/icabcd62167.2024.10645271 · Cited by 12
Multi-scale feature fusion quantum depthwise Convolutional Neural Networks for text classification
Chen, Y., & Fang, W. (2025) · Engineering Analysis with Boundary Elements · doi:10.1016/j.enganabound.2025.106158 · Cited by 15
Quantum Generative Model with Variable-depth Circuit
Huang, Y., Lei, H., Li, X., Qing-sheng, Z., Ren, W., & Liu, X. (2020) · Computers, materials & continua/Computers, materials & continua (Print) · doi:10.32604/cmc.2020.010390 · Cited by 10
Entanglement assisted training algorithm for supervised quantum classifiers
Adhikary, S. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03179-w · Cited by 11
Copula-based risk aggregation with trapped ion quantum computers
Zhu, D., Shen, W., Giani, A., Ray-Majumder, S., Neculaes, V. B., & Johri, S. (2023) · Scientific Reports · doi:10.1038/s41598-023-44151-1 · Cited by 10
Certificates of quantum many-body properties assisted by machine learning
Requena, B., Muñoz-Gil, G., Lewenstein, M., Dunjko, V., & Tura, J. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.013097 · Cited by 15
Training Hybrid Classical-Quantum Classifiers via Stochastic Variational Optimization
Nikoloska, I., & Simeone, O. (2022) · IEEE Signal Processing Letters · doi:10.1109/lsp.2022.3164852 · Cited by 9
Binary Classification Quantum Neural Network Model Based on Optimized Grover Algorithm
Zhao, W., Wang, Y., Qu, Y., Ma, H., & Wang, S. (2022) · Entropy · doi:10.3390/e24121783 · Cited by 9
Generative model for learning quantum ensemble with optimal transport loss
Tezuka, H., Uno, S., & Yamamoto, N. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00142-7 · Cited by 9
Variational Quantum Circuit Design for Quantum Reinforcement Learning on Continuous Environments
Kruse, G., Drăgan, T.-A., Wille, R., & Lorenz, J. M. (2024) · International Conference on Agents and Artificial Intelligence (ICAART) · doi:10.5220/0012353100003636 · Cited by 8
Parameter-efficient Quantum Denoising Diffusion Probabilistic Models with temporal encoding
Zhang, X., & Chen, C. (2025) · Future Generation Computer Systems · doi:10.1016/j.future.2025.107981 · Cited by 9
Quantum continual learning of quantum data realizing knowledge backward transfer
Situ, H., Lu, T., Pan, M., & Li, L. (2023) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2023.128779 · Cited by 10
程, T. 涛. C., Zhao, R.-S., 王, S. 爽. W., 王, R. 睿. W., & 马, H.-Y. 鸿. M. (2023) · Chinese Physics B · doi:10.1088/1674-1056/ad1926 · Cited by 10
Reducing runtime and error in VQE using deeper and noisier quantum circuitsPreprint
Katabarwa, A., Kunitsa, A. A., Peropadre, B., & Johnson, P. D. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.10664 · Cited by 8
Metadata
- Authors
- Benedetti, M., Garcia-Pintos, D., Perdomo, O., Leyton-Ortega, V., Nam, Y., & Perdomo-Ortiz, A.
- Affiliations
- Cambridge Quantum Computing (United Kingdom) (GB)
- Central Connecticut State University (US)
- IonQ (United States) (US)
- Venue
- npj Quantum Information
- Published
- 2019-05-27
- Volume
- 5
- Issue
- 1
- ISSN
- 2056-6387 (ISSN-L)
- OpenAlex
- W2784994528
- Cited by
- 379
- References
- 71
- Citations by year
- 2026: 42 · 2025: 75 · 2024: 55 · 2023: 49 · 2022: 42 · 2021: 65 · 2020: 29 · 2019: 12
- FWCI
- 16.88
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- npj Quantum Information (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
- UCL Discovery (University College London) (submittedVersion)
- arXiv (Cornell University)
- Funders
- RCUK | Engineering and Physical Sciences Research Council
- Cambridge Quantum Computing Limited
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Keywords
- quantum circuit learning, shallow quantum circuits, generative models, hybrid quantum-classical algorithms, quantum device characterization, GHZ states, Schrödinger cat states, thermal states, quantum volume, entanglement, ion trap quantum computer, qubit connectivity, benchmarking
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (gpt-6-sol).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
