REVIEW 14 cited by
Transformation of quantum states using uniformly controlled rotations
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
abstract
We consider a unitary transformation which maps any given state of an $n$-qubit quantum register into another one. This transformation has applications in the initialization of a quantum computer, and also in some quantum algorithms. Employing uniformly controlled rotations, we present a quantum circuit of $2^{n+2}-4n-4$ CNOT gates and $2^{n+2}-5$ one-qubit elementary rotations that effects the state transformation. The complexity of the circuit is noticeably lower than the previously published results. Moreover, we present an analytic expression for the rotation angles needed for the transformation.
Forward citations
Cited by 14 Pith papers
-
A hardware-efficient variational ansatz with an exact diagonal metric for real- and imaginary-time evolution and Haar sampling
A hardware-efficient binary-tree ansatz has a closed-form diagonal Fubini–Study metric, enabling metric-aware VQE and time evolution without auxiliary circuits, with linear-in-k pruning for sparse sectors.
-
Spectral Gaps with Quantum Counting Queries and Oblivious State Preparation
Quantum algorithm approximates k-th spectral gap Δ_k and midpoint μ_k of Hermitian matrix to εΔ_k error with O(N²/(ε² Δ_k²) polylog) QRAM complexity, claiming speedup for large gaps, plus Ω(N²) black-box lower bound.
-
Formal Verification of Variational Quantum Circuits
The paper introduces an abstract-interpretation framework with interval domains for formally verifying robustness of variational quantum circuit classifiers, and reports certified perturbation bounds on Iris and MNIST.
-
A Compass on the Quantum State Sphere: The Hopf Ansatz for Arbitrary Pure-State Optimization
The Hopf binary-tree ansatz provides universal state preparation plus an explicit inverse map, diagonal metric, and exact tangent-state gradients, organizing gradient access into O(log N) circuit families.
-
Perturbatively Corrected Linear Response Selected Configuration Interaction
LR-SCI-PT with second-order Epstein-Nesbet corrections improves static polarizabilities toward FCI limits for small molecules but preserves the parent pole structure, limiting it to static properties.
-
A Pathway to Practical Quantum Advantage in Solving Navier-Stokes Equations
A spectral-sparsity-based quantum solver is claimed to solve 2^80-cell Navier-Stokes problems in 42.6 days with 8.71 million physical qubits, a 1,100x speedup over a classical supercomputer.
-
Block Encoding of Sparse Matrices via Coherent Permutation
A new framework for block encoding sparse matrices that uses coherent permutations to reorder amplitudes while preserving superposition and combinatorial optimization to meet hardware connectivity limits.
-
Quantum State Preparation Based on LimTDD
An algorithm based on LimTDD diagrams prepares an n-qubit state from a diagram with p reduced paths in O(np) time and with O(n^2p) three-qubit gates, beating ADD-based, Qiskit, and QuICT on structured states.
-
A Quantum Linear Systems Pathway for Solving Differential Equations
A quantum algorithm pathway using block encoding and QSVT to solve differential equations, with demonstrations on heat and Burgers' equations plus hardware resource estimates.
-
Advancing Quantum State Preparation Using Decision Diagram with Local Invertible Maps
LimTDD-based quantum state preparation algorithms with zero, one, many, or an optional number of ancilla qubits reduce gate counts and runtime compared with existing methods on structured quantum states.
-
Measurement-Efficient Variational Quantum Linear Solver for Carleman-Linearized Nonlinear Dynamics
Hybrid VQLS pipeline with Carleman linearization recovers high-fidelity solutions to the weakly nonlinear Duffing equation on IBM and Xanadu hardware using symmetry-grouped measurements and optimized ansatzes.
-
A Survey of Quantum Programming Languages
Survey presenting a classification framework for ten quantum programming languages with conceptual and experimental comparisons leading to a list of design challenges.
-
Project-Based Learning in Introductory Quantum Computing Courses: A Case Study on Quantum Algorithms for Medical Imaging
A first-person teaching case study reports that a project-based HHL-for-CT-imaging assignment helped the authors learn quantum computing, without measured learning outcomes, and confirms HHL is impractical for real CT today.
-
A Rigorous and Self--Contained Proof of the Grover--Rudolph State Preparation Algorithm
The Grover–Rudolph correctness proof is formally redone, but the claimed error bound and bit/shots rule are only in the abstract, and the Gray-code ladder proof has a false step.
Discussion (0). Sign in to comment.