REVIEW 34 cited by
A new quantum ripple-carry addition circuit
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
Signed reviews
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.
Forward citations
Cited by 34 Pith papers
-
Quantum Uncomputation of Clean and Dirty Ancilla Qubits
Quantum compilers can now automatically uncompute dirty ancillas with a rewrite-based normalizer, and the existence problem is coNP-hard.
-
Quantum Algorithm for Elliptic Curve Discrete Logarithms with Space-Efficient Point Addition
A space-efficient reversible modular-inversion circuit lowers Shor's ECDLP resource estimate for secp256k1 to 835 logical qubits and about 2^30.63 Toffoli gates.
-
Efficient Quantum Circuits for Coherent Conversion Between General First- and Second-Quantized Many-Body Representations
Constructs an explicit unitary Q using the quantum Schur transform to coherently map fixed-N first-quantized states to occupation-number form with poly(N,d,log(1/ε)) gate complexity.
-
Lattice-quantile estimation of {\pi} and convex-region integrals from coined two-dimensional quantum walks
Uses 2D DTQW lattice quantiles and number-theoretic asymptotics to estimate convex integrals with deterministic residual error scaling in T instead of statistical M^{-1/2}.
-
Constraint-Aware Quantum Optimization of Defect Configurations in Doped ZrO2: XY-Mixer QAOA and Grover Adaptive Search
Presents an end-to-end constraint-aware quantum optimization pipeline using XY-mixer QAOA and Grover Adaptive Search for low-energy defect configurations in doped ZrO2, with QAOA validated against exact enumeration on...
-
Quantum walk-based optimisation for capacitated vehicle routing with homogeneous and heterogeneous fleets
Presents a continuous-time quantum walk over a product space for CVRP that cuts gate complexity to O(n² log n) and shows faster convergence in simulations up to 8 customers.
-
Explicit Quantum Circuit Simulation of Nonlinear 1-Dimensional Fluid with Carleman-linearized Boltzmann Method
Explicit quantum-circuit simulation of nonlinear 1D fluid via second-order Carleman-linearized Boltzmann equation and QSVD Taylor ODE solver, with logarithmic scaling analysis.
-
From Hilbert's Tenth Problem to Quantum Speedup: Explicit Oracles for Bounded Diophantine Systems
Explicit reversible quantum oracles for bounded Diophantine systems achieve quadratic speedup with qubit count O((n + d²) log₂ N) and Toffoli depth O(q²).
-
Borrowing Dirty Qubits in Quantum Programs
The paper gives QBorrow a formal borrow/release semantics, defines safe uncomputation of a dirty qubit as the program acting as identity on that qubit, and reduces verification for classical circuits to SAT.
-
Quantum Wave Atom Transforms
A family of O(L^2)-gate quantum circuits implements wave atom transforms with monotonic wavelet packet trees, including parabolic scaling cases.
-
Ancilla-free Quantum Adder with Sublinear Depth
A new construction shows exact in-place addition of two n-bit quantum registers can be done in O(log^2 n) depth with O(n log n) classical reversible gates and zero ancilla qubits.
-
QSCI-CMP: Quantum-Selected Configuration Interaction with Chemically Motivated Preselection
QSCI-CMP cuts the quantum sampling cost of SQD-AA by classically preselecting low-excitation, low-seniority determinants and using a compact oracle that checks those properties in superposition.
-
Hybrid quantum floating-point method for sharp arithmetic
A classically-enriched quantum floating-point variable stores offset and scaling classically, reducing approximation error by up to 89% after repeated additions compared to prior mono-quantum coding.
-
Quantum Kravchuk Transform using $\mathfrak{su}(2)$ fast-forwarding
Quantum algorithm implements Kravchuk transform via su(2) fast-forwarding with logarithmic scaling in dimension and error.
-
Optimized Point Addition Circuits for Elliptic Curve Discrete Logarithms
Explicit quantum circuits for elliptic-curve point addition achieve 6.5-10% fewer Toffoli gates and 1.5% more qubits than Babbush et al. for secp256k1, plus a generic prime-field version.
-
Towards Deploying Optimistic Quantum Fourier Transforms: An Architecture-Algorithm Co-Design Study
A hot-zone architecture for OQFT on reconfigurable neutral-atom hardware yields tunable latency via 2-4 zones, converging to roughly 500 extra logical ancillae and 128-qubit peak parallelism for half-time performance ...
-
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.
-
Quantum Elastic Network Models and their Application to Graphene
A quantum algorithm for coupled oscillators is adapted to elastic network models, with an efficient connectivity oracle for graphene and applications to heat transfer and rippling — at the cost of a coarse two-bucket ...
-
Benchmarking Quantum Simulation of Chemical Hamiltonians using the Sorted-List Encoding
Sorted-list encoding gives O(N log M) qubits and gate scalings for fermionic simulation, matching first-quantized in plane-wave trotterization and beating Jordan-Wigner only at low electron filling, while first-quanti...
-
Efficient Quantum Control via Automatic Control Skips
A generic algorithm automatically identifies conjugation-pair subcircuits that can skip control in quantum circuits, with an NP-hardness proof and a dynamic-programming approximation showing large practical reductions.
-
Fast correlated decoding of transversal logical algorithms
Decoding only back-propagated reliable logical Pauli products turns transversal-circuit decoding into a matchable graph, so fast minimum-weight perfect matching works with memory-like thresholds.
-
Decentralized Framework for Teleportation in Quantum Core Interconnects
A two-way teleportation strategy, where both source and destination qubits move toward an intermediate core, reduces end-to-end communication latency by 30-40% and circuit depth by up to 24% in simulations of multi-co...
-
BOSS: Blocking algorithm for optimizing shuttling scheduling in Ion Trap
BOSS uses union-find circuit blocking and a half-block tape schedule to cut shuttle operations in linear-tape trapped-ion compilation, achieving up to 96.1% fewer shuttles on tested benchmarks.
-
On the practicality of quantum sieving algorithms for the shortest vector problem
Quantum sieving for SVP in dimension 400 needs ~10^13 physical qubits and ~10^31 years under optimistic assumptions, offering no practical speedup over classical methods.
-
Quantum Monte Carlo algorithm for option pricing and its complexity analysis
A quantum Monte Carlo algorithm solves multidimensional Black-Scholes PDEs for option pricing with polynomial complexity in dimension d and accuracy 1/ε, with rigorous error bounds and a claimed speedup over classical...
-
Position: Quantum Program Generation Must Prioritize Validity Over Probabilistic Scaling
The paper argues that probabilistic scaling alone cannot fix the validity gap in quantum circuit generation, so quantum code assistants must build verification into generation rather than filter outputs after the fact.
-
Noisy Quantum Simulation Using Tracking, Uncomputation and Sampling
TUSQ reduces redundant work in noisy quantum simulations via error tallying, commutation, importance sampling, and depth-first tree traversal with compute/uncompute reuse, reporting large speedups over Qiskit, CUDA-Q,...
-
New Circuit for Quantum Adder by Constant
An in-place quantum adder-by-constant circuit is constructed with n-3 ancilla qubits and T-count 4n-5, improving on prior adder-based constructions.
-
Quantum Model for CVRPTW
A Grover-search-based quantum model for CVRPTW that encodes constraints with only linear additional decision qubits relative to TSP formulations.
-
Demonstration of a quantum comparator on an ion-trap quantum device
An ion-trap quantum computer correctly compared 9-bit integers with 95% output success and 69% ancilla-inclusive success.
-
No Scratch Quantum Computing by Reducing Qubit Overhead for Efficient Arithmetics
The paper constructs two-qubit unitaries that map a fixed |00> state to the binary sum of classical inputs encoded in the unitary parameters.
-
Optimising Iteration Scheduling for Full-State Vector Simulation of Quantum Circuits on FPGAs
A bit-insertion formula for controlled-gate iteration indices reduces scheduled kernel iterations, giving up to about 7x speedup for control-heavy circuits on FPGAs.
-
Performance Analysis of QAOA Across Distributed Quantum Network Topologies Using SwitchQNet
QAOA on SwitchQNet yields modest ~1.4–2.2× communication-latency reductions across QDC topologies and is useful mainly as a diagnostic benchmark for entanglement-aware scheduling.
-
A Grover-Based Quantum Algorithm for Solving Perfect Mazes via Fitness-Guided Search
A Grover-based maze solver whose fitness function ignores wall constraints, so the algorithm does not actually solve mazes.
Discussion (0). Continue with ORCID to comment.