Pith. sign in

REVIEW 3 cited by

Circuit Design for a Star-shaped Spin-Qubit Processor via Algebraic Decomposition and Optimal Control

Not yet reviewed by Pith; the record is open.

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

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 2506.16900 v1 pith:45WFM3OZ submitted 2025-06-20 quant-ph

Circuit Design for a Star-shaped Spin-Qubit Processor via Algebraic Decomposition and Optimal Control

Yaqing X. Wang , Tommaso Calarco , Felix Motzoi , Matthias M. M\"uller This is my paper
classification quant-ph
keywords quantumcircuitalgebraicdecompositiondevicegatesgivenprocessing
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

As quantum processing units grow in size and precision we enter the stage where quantum algorithms can be tested on actual quantum devices. To implement a given quantum circuit on a given quantum device, one has to express the circuit in terms of the gates that can be efficiently realized on the device. We propose an algorithm based on algebraic circuit decomposition for tailored application of optimal-control gates for quantum computing platforms with star-shaped topologies. We then show numerically how the resulting circuits can be implemented on a quantum processing unit consisting of a nitrogen-vacancy center in diamond and surrounding nuclear spins.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

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

  1. Quantum circuit partition as a maze: emerging percolation transition via path finding

    quant-ph 2026-06 unverdicted novelty 6.0

    Quantum circuit partitioning is formalized as a maze path problem, revealing a percolation phase transition that separates partitionable from non-partitionable regimes when the CNOT-to-qubit ratio is near one.

  2. Control Protocols for Entangling Gates for Group-IV Color-Centers in Diamond

    quant-ph 2026-07 conditional novelty 5.0

    Three entangling gate types (ZZ, ZX, YY) for group-IV color centers are analyzed via dynamical decoupling, double-quantum transitions, optimal control, and algebraic decomposition, yielding quantum speed limits and pr...

  3. Optimal Two-Qubit Gates for Group-IV Color-Centers in Diamond

    quant-ph 2026-04 unverdicted novelty 4.0

    Numerical optimal control produces robust two-qubit gates exceeding 99.9% fidelity for a GeV-13C system under realistic noise.