Pith. sign in

REVIEW 4 cited by

Classical and Quantum Algorithms for Orthogonal Neural Networks

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 2106.07198 v2 pith:K3ASB4T2 submitted 2021-06-14 quant-ph

classification quant-ph
keywords neuralnetworksorthogonalorthogonalityquantumclassicalbeencomputer
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Orthogonal neural networks have recently been introduced as a new type of neural networks imposing orthogonality on the weight matrices. They could achieve higher accuracy and avoid evanescent or explosive gradients for deep architectures. Several classical gradient descent methods have been proposed to preserve orthogonality while updating the weight matrices, but these techniques suffer from long running times or provide only approximate orthogonality. In this paper, we introduce a new type of neural network layer called Pyramidal Circuit, which implements an orthogonal matrix multiplication. It allows for gradient descent with perfect orthogonality with the same asymptotic running time as a standard layer. This algorithm is inspired by quantum computing and can therefore be applied on a classical computer as well as on a near term quantum computer. It could become the building block for quantum neural networks and faster orthogonal neural networks.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

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

  1. Scalable Quantum Machine Learning: Trainability, Expressivity and Efficiency

    quant-ph 2026-07 reject novelty 6.0 of 10

    A k-particle fermionic circuit with Rz-lifted RBS gates is claimed to be trainable (gradient variance Θ(k²/n⁵)), classically hard (2^{Ω(k)} under best-known algorithms), and trainable via a parallel parameter-shift ru...

  2. Pitfalls when tackling the exponential concentration of parameterized quantum models

    quant-ph 2025-07 conditional novelty 6.0 of 10

    Exponentially concentrated measurement outcomes are statistically indistinguishable from fixed noise after polynomial shots, so classical post-processing cannot fix them, and common proposed remedies do not escape this.

  3. Hybrid Quantum-Classical Inverse Design of Metasurfaces for Tailored Narrow Band Absorption

    physics.optics 2025-07 reject novelty 5.0 of 10

    A hybrid quantum-classical GAN (LaSt-QGAN) is applied to metasurface inverse design, claiming 10x faster training, 40x less data, and generation of Q-factors up to 10^4 from a training set with Q-factors up to 10^3.

  4. Hybrid Quantum Generative Adversarial Networks To Inverse Design Metasurfaces For Incident Angle-Independent Unidirectional Transmission

    physics.optics 2025-07 reject novelty 5.0 of 10

    A hybrid quantum GAN with a variational autoencoder is applied to inverse-design dielectric metasurfaces for directional far-field patterns and then to boost simulated perovskite solar-cell efficiency.

Pith tools