Recognition: unknown
A new quantum ripple-carry addition circuit
read the original abstract
We present a new linear-depth ripple-carry quantum addition circuit. Previous addition circuits required linearly many ancillary qubits; our new adder uses only a single ancillary qubit. Also, our circuit has lower depth and fewer gates than previous ripple-carry adders.
This paper has not been read by Pith yet.
Forward citations
Cited by 12 Pith papers
-
Coherent Rollout Oracles for Finite-Horizon Sequential Decision Problems
A coherent quantum rollout oracle is built from O(Nw)-gate rank-select circuits with proven optimality, delivering O(sqrt(k)/eps) query complexity for planning problems and formally verified in Lean.
-
Efficient Quantum Algorithms for Higher-Order Coupled Oscillators
Quantum algorithms achieve polynomial advantage for synchronization estimation and super-polynomial advantage for no-phase-locking certification in higher-order simplicial Kuramoto models under stated assumptions.
-
A Digital Spreading Framework for Quantum Expectation Computation Without Rotation Gates or Arithmetic Circuits
Digital Spreading computes quantum expectations via integer comparisons on superposed states with a pruned Cuccaro architecture, reaching 0.0001% relative error in option pricing simulations.
-
Magic state cultivation: growing T states as cheap as CNOT gates
Magic state cultivation prepares high-fidelity T states with an order of magnitude fewer qubit-rounds than prior distillation methods by gradually growing them within a surface code under depolarizing noise.
-
Partial oracles quantum algorithm framework -- Part I: Analysis of in-place operations
The paper gives a construction for the partial-oracles search iteration operator restricted to in-place operations via a new reciprocal transform applied to SHA-256 building blocks.
-
Quantum hardware noise learning via differentiable Kraus representation on tensor networks
A differentiable tensor-network framework learns CPTP noise channels from single-circuit measurement data on IBM hardware and generalizes the model to unrelated circuits.
-
Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture
A trapped-ion architecture based on LDPC codes and cat-state factories achieves 110 logical qubits and one million T gates per day using 2514 physical qubits, with estimates for Heisenberg model simulation on 100 site...
-
An Oracle-Free Quantum Algorithm for Nonadiabatic Quantum Molecular Dynamics
An oracle-free Trotter-based quantum algorithm for nonadiabatic molecular dynamics achieves circuit depth advantages over QROM architectures and retains T-gate scalability compared to quantum signal processing.
-
A Polylogarithmic-Depth Quantum Multiplier
Quantum integer multiplier with O(log^2 n) circuit depth and T-depth via parallel partial products and binary adder tree in the Clifford+T model.
-
Heterogeneous architectures enable a 138x reduction in physical qubit requirements for fault-tolerant quantum computing under detailed accounting
Heterogeneous quantum architectures with task-specific hardware and QEC encodings deliver up to 138x lower physical-qubit overhead than monolithic baselines for fault-tolerant algorithms, including RSA-2048 factoring ...
-
Space-Efficient Quantum Algorithm for Elliptic Curve Discrete Logarithms with Resource Estimation
A space-efficient quantum ECDLP algorithm uses 5n + 4⌊log₂n⌋ + O(1) logical qubits and O(n³) Toffoli gates, lowering the 256-bit estimate from 2124 to 1333 qubits.
-
A Fully Quantum Algorithm for Image Edge Detection
A fully quantum gradient-based edge detection algorithm using NEQR encoding, cyclic shifts for neighbor superpositions, direction-aware alignment, and a Quantum Partitioning Algorithm for in-place thresholding, with c...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.