Pith. sign in

REVIEW 2 cited by

Quantum computing overview: discrete vs. continuous variable models

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2206.07246 v1 pith:4GNQCOOZ submitted 2022-06-15 quant-ph cs.AI

classification quant-phcs.AI
keywords quantummodelvariablediscreteavailablecontinuousdimensionalqpus
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

In this Near Intermediate-Scale Quantum era, there are two types of near-term quantum devices available on cloud: superconducting quantum processing units (QPUs) based on the discrete variable model and linear optics (photonics) QPUs based on the continuous variable (CV) model. Quantum computation in the discrete variable model is performed in a finite dimensional quantum state space and the CV model in an infinite dimensional space. In implementing quantum algorithms, the CV model offers more quantum gates that are not available in the discrete variable model. CV-based photonic quantum computers provide additional flexibility of controlling the length of the output vectors of quantum circuits, using different methods of measurement and the notion of cutoff dimension.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Formal Verification of Continuous-Variable Quantum Programs

    quant-ph 2026-07 conditional novelty 8.0 of 10

    A sound and relatively complete Hoare logic for continuous-variable quantum programs, with polynomial assertions and an automated weakest-precondition calculator.

  2. Quantum Inspired Encoding Strategies for Machine Learning Models: Proposing and Evaluating Instance Level, Global Discrete, and Class Conditional Representations

    cs.LG 2025-06 reject novelty 2.0 of 10

    The reported 40 to 60 percent encoding-time reduction from three quantum-inspired relabeling strategies is contradicted by the paper's own measurements for several embedding types.

Pith tools