A novel permeability DAG representation is proposed to automate parallelization and memory management in quantum programs by capturing permeability-based commutation properties.
hub
Addition on a Quantum Computer
14 Pith papers cite this work. Polarity classification is still indexing.
14
Pith papers citing it
abstract
A new method for computing sums on a quantum computer is introduced. This technique uses the quantum Fourier transform and reduces the number of qubits necessary for addition by removing the need for temporary carry bits. This approach also allows the addition of a classical number to a quantum superposition without encoding the classical number in the quantum register. This method also allows for massive parallelization in its execution.
hub tools
citation-role summary
background 3
method 1
citation-polarity summary
representative citing papers
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}.
Quantum circuits for coherent multilayer neural network inference achieve quadratic to polylogarithmic speedups over classical methods depending on quantum data access models for inputs and weights.
A quantum machine learning surrogate based on parameterized circuits with data re-uploading approximates the full BGK collision dynamics in LBM across all admissible relaxation parameters and is validated on Taylor-Green vortex and double shear layer benchmarks.
New boundary condition approach for QLBM using one coherent operation on the full boundary, claimed to use fewer resources asymptotically and practically for bounce-back and specular reflection.
Quantum spectral method solves non-periodic Dirichlet boundary value problems with polylogarithmic complexity by extending Fourier discretization with domain doubling, antisymmetric reflection, and quantum sine transform.
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.
GAS-SCF applies Grover adaptive search to the discrete Fock-state optimization step of SCF, giving a quadratic speed-up over brute-force enumeration and demonstrating improved solutions on small molecular systems.
Continuous-variable photonic platform with 20,000-mode cluster state simulates advection transport equation, achieving relative errors of 0.8% and 0.92% on first- and second-order moments via homodyne readout.
Proposes a QFT-based quantum matrix multiplication framework claiming O(n) adder and O(n²) multiplier gate complexity plus a quantum Strassen variant for potential ML acceleration.
Crosstalk patterns between quantum circuits on IBM processors are predictable by circuit type and hardware architecture, with high intra-revision consistency and topological decoupling between lattice types.
A quantum algorithm for evolving Schwarzschild spacetime in the WEBB NR formalism is implemented in Qiskit and tested on simulators and IBM quantum computers.
JUQCS-50 achieves the first 50-qubit universal quantum computer simulation on the JUPITER supercomputer via CPU-GPU memory extension, adaptive encoding, and network optimization, delivering a 16.6-fold speedup over the prior 48-qubit record.
Encoding strategies for quantum fluid simulations trade off compactness against practicality in state preparation, measurement, boundary conditions, and nonlinear operations, with no single approach being universally optimal.
citing papers explorer
-
Automatic quantum function parallelization and memory management in Qrisp
A novel permeability DAG representation is proposed to automate parallelization and memory management in quantum programs by capturing permeability-based commutation properties.
-
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}.
-
Accelerating Inference for Multilayer Neural Networks with Quantum Computers
Quantum circuits for coherent multilayer neural network inference achieve quadratic to polylogarithmic speedups over classical methods depending on quantum data access models for inputs and weights.
-
A Quantum-Classical Surrogate Model for the Collision Operator of the Lattice Boltzmann Method
A quantum machine learning surrogate based on parameterized circuits with data re-uploading approximates the full BGK collision dynamics in LBM across all admissible relaxation parameters and is validated on Taylor-Green vortex and double shear layer benchmarks.
-
Efficient and Expressive Boundary Conditions in Quantum Lattice Boltzmann Methods
New boundary condition approach for QLBM using one coherent operation on the full boundary, claimed to use fewer resources asymptotically and practically for bounce-back and specular reflection.
-
A Quantum Spectral Method for Non-Periodic Boundary Value Problems
Quantum spectral method solves non-periodic Dirichlet boundary value problems with polylogarithmic complexity by extending Fourier discretization with domain doubling, antisymmetric reflection, and quantum sine transform.
-
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-Accelerated Self-Consistent Field: A Hybrid Algorithm
GAS-SCF applies Grover adaptive search to the discrete Fock-state optimization step of SCF, giving a quadratic speed-up over brute-force enumeration and demonstrating improved solutions on small molecular systems.
-
Analog photonic simulator for large-scale transport
Continuous-variable photonic platform with 20,000-mode cluster state simulates advection transport equation, achieving relative errors of 0.8% and 0.92% on first- and second-order moments via homodyne readout.
-
Universal Matrix Multiplication on Quantum Computer
Proposes a QFT-based quantum matrix multiplication framework claiming O(n) adder and O(n²) multiplier gate complexity plus a quantum Strassen variant for potential ML acceleration.
-
Toward Secure Multitenant Quantum Computing: Circuit Affinity, Crosstalk Patterns, and Grouping Strategies
Crosstalk patterns between quantum circuits on IBM processors are predictable by circuit type and hardware architecture, with high intra-revision consistency and topological decoupling between lattice types.
-
Solving Einstein Field Equations on a Digital Quantum Computer
A quantum algorithm for evolving Schwarzschild spacetime in the WEBB NR formalism is implemented in Qiskit and tested on simulators and IBM quantum computers.
-
Universal Quantum Computer Simulation of 50 Qubits on Europe`s First Exascale Supercomputer Harnessing Its Heterogeneous CPU-GPU Architecture
JUQCS-50 achieves the first 50-qubit universal quantum computer simulation on the JUPITER supercomputer via CPU-GPU memory extension, adaptive encoding, and network optimization, delivering a 16.6-fold speedup over the prior 48-qubit record.
-
Encoding strategies for quantum enhanced fluid simulations: opportunities and challenges
Encoding strategies for quantum fluid simulations trade off compactness against practicality in state preparation, measurement, boundary conditions, and nonlinear operations, with no single approach being universally optimal.