My scholargoogler.com word cloud. Incredible service. #ChemSky #QuantumSky #SelfDrivingLabs #UniversityofToronto #UofT #VectorInsititute #AI #Materials #QuantumAlgorithms
November 24, 2024 at 1:11 PM
My scholargoogler.com word cloud. Incredible service. #ChemSky #QuantumSky #SelfDrivingLabs #UniversityofToronto #UofT #VectorInsititute #AI #Materials #QuantumAlgorithms
Check out our work on corrected product formulas (CPF) to lower the cost of #hamiltonian #simulation #quantumalgorithms @uoftcompsci.bsky.social @cqiqc-uoft.bsky.social @vectorinstitute.ai @chemuoft.bsky.social
⚛️🖥️Excited to share our work on simulating Hamiltonian evolution on quantum computers. Led by our group member Mohsen Bagherimehrab, we introduce Corrected Product Formulas (CPFs), which significantly improve the performance of standard product formulas. [1/4]
March 25, 2025 at 2:52 AM
Check out our work on corrected product formulas (CPF) to lower the cost of #hamiltonian #simulation #quantumalgorithms @uoftcompsci.bsky.social @cqiqc-uoft.bsky.social @vectorinstitute.ai @chemuoft.bsky.social
Variational #quantumalgorithms and classical variational methods, such as #tensornetworks, provide upper bounds on ground-state energies. This work provides guarantees for lower bounds.
journals.aps.org/pra/abstract...
journals.aps.org/pra/abstract...
February 17, 2026 at 5:47 PM
Variational #quantumalgorithms and classical variational methods, such as #tensornetworks, provide upper bounds on ground-state energies. This work provides guarantees for lower bounds.
journals.aps.org/pra/abstract...
journals.aps.org/pra/abstract...
New variational method simulates stochastic quantum dynamics efficiently, capturing non-Gaussian correlations beyond semiclassical limits. Key finding: symmetry-breaking phase transitions survive in 2D but vanish in 1D lattices.
#QuantumSimulation #QuantumAlgorithms #Research
#QuantumSimulation #QuantumAlgorithms #Research
Variational Multi-Gaussian Quantum Trajectories
arxiv.org
September 25, 2026 at 3:25 AM
New variational method simulates stochastic quantum dynamics efficiently, capturing non-Gaussian correlations beyond semiclassical limits. Key finding: symmetry-breaking phase transitions survive in 2D but vanish in 1D lattices.
#QuantumSimulation #QuantumAlgorithms #Research
#QuantumSimulation #QuantumAlgorithms #Research
In the shadow of the Hadamard test: Using the garbage state for good and further modifications
journals.aps.org/prl/abstract...
I am excited to see this improvement of the primitive of the Hadamard test in #quantumalgorithms in press in the PRL. We combine the unused output with shadow estimation.
journals.aps.org/prl/abstract...
I am excited to see this improvement of the primitive of the Hadamard test in #quantumalgorithms in press in the PRL. We combine the unused output with shadow estimation.
October 13, 2025 at 10:18 AM
In the shadow of the Hadamard test: Using the garbage state for good and further modifications
journals.aps.org/prl/abstract...
I am excited to see this improvement of the primitive of the Hadamard test in #quantumalgorithms in press in the PRL. We combine the unused output with shadow estimation.
journals.aps.org/prl/abstract...
I am excited to see this improvement of the primitive of the Hadamard test in #quantumalgorithms in press in the PRL. We combine the unused output with shadow estimation.
GAMPS achieve near-maximal volume-law entanglement with modest bond dimensions, requiring exponentially smaller resource overhead than unaugmented matrix product states for quantum simulation.
#QuantumTensorNetworks #QuantumSimulation #QuantumAlgorithms
#QuantumTensorNetworks #QuantumSimulation #QuantumAlgorithms
Random Gaussian Augmented Matrix Product States
arxiv.org
September 23, 2026 at 4:24 AM
GAMPS achieve near-maximal volume-law entanglement with modest bond dimensions, requiring exponentially smaller resource overhead than unaugmented matrix product states for quantum simulation.
#QuantumTensorNetworks #QuantumSimulation #QuantumAlgorithms
#QuantumTensorNetworks #QuantumSimulation #QuantumAlgorithms
An afternoon session at #QCTiP2025 covers #quantumalgorithms for #quantumchemistry, with exciting talks by Javier Moreno, Oriel Kiss and @dobrautz.bsky.social.
April 23, 2025 at 2:38 PM
An afternoon session at #QCTiP2025 covers #quantumalgorithms for #quantumchemistry, with exciting talks by Javier Moreno, Oriel Kiss and @dobrautz.bsky.social.
Researchers derive how encoding choices shape frequency redundancy in quantum fourier models, proving they converge to Gaussian distributions—critical for designing unbiased quantum machine learning models.
#QuantumML #QuantumAlgorithms #Research
#QuantumML #QuantumAlgorithms #Research
Frequency Redundancy Asymptotics in Quantum Fourier Models
arxiv.org
September 23, 2026 at 12:03 PM
Researchers derive how encoding choices shape frequency redundancy in quantum fourier models, proving they converge to Gaussian distributions—critical for designing unbiased quantum machine learning models.
#QuantumML #QuantumAlgorithms #Research
#QuantumML #QuantumAlgorithms #Research
Novel Schrödingerization algorithm achieves optimal O(κ_A log(1/ε)) query complexity for quantum linear systems, with linear condition-number scaling without VTAA via block preconditioning and interval recovery.
#QuantumAlgorithms #QuantumComputing #Research
#QuantumAlgorithms #QuantumComputing #Research
Schrödingerization for Quantum Linear Systems Problems
arxiv.org
September 23, 2026 at 4:00 AM
Novel Schrödingerization algorithm achieves optimal O(κ_A log(1/ε)) query complexity for quantum linear systems, with linear condition-number scaling without VTAA via block preconditioning and interval recovery.
#QuantumAlgorithms #QuantumComputing #Research
#QuantumAlgorithms #QuantumComputing #Research
One of the first afternoon sessions at #QCTiP2025 is dedicated to #quantumalgorithms, with exciting talks held by @Noajshu, Xin Wang and Jeffery Yu.
April 23, 2025 at 12:41 PM
One of the first afternoon sessions at #QCTiP2025 is dedicated to #quantumalgorithms, with exciting talks held by @Noajshu, Xin Wang and Jeffery Yu.
Researchers at Huazhong University developed a quantum lattice Boltzmann method achieving sixfold accuracy improvement by replacing non-unitary collision operators with unitary rotations, enabling precise fluid dynamics simulations on quantum hardware.
#QuantumAlgorithms #QuantumSimulation #News
#QuantumAlgorithms #QuantumSimulation #News
Unitary Rotation Operator Improves Quantum Lattice Boltzmann Method for Fluid Dynamics
quantumzeitgeist.com
September 24, 2026 at 5:02 PM
Researchers at Huazhong University developed a quantum lattice Boltzmann method achieving sixfold accuracy improvement by replacing non-unitary collision operators with unitary rotations, enabling precise fluid dynamics simulations on quantum hardware.
#QuantumAlgorithms #QuantumSimulation #News
#QuantumAlgorithms #QuantumSimulation #News
New algorithm efficiently simulates large open quantum systems through low-rank ensemble propagation, eliminating quadratic memory scaling and achieving near-linear complexity with 100x speedup over existing methods.
#QuantumSimulation #QuantumAlgorithms #Research
#QuantumSimulation #QuantumAlgorithms #Research
Low-Rank Propagation for Tridiagonalizable Open Quantum Systems: Near-Linear Scaling
arxiv.org
September 23, 2026 at 4:38 AM
New algorithm efficiently simulates large open quantum systems through low-rank ensemble propagation, eliminating quadratic memory scaling and achieving near-linear complexity with 100x speedup over existing methods.
#QuantumSimulation #QuantumAlgorithms #Research
#QuantumSimulation #QuantumAlgorithms #Research
Q-CTRL executed a 100-qubit Quantum Fourier Transform on IBM Heron, resolving a key scaling bottleneck through a novel Convolutional compilation strategy that eliminates routing overhead on linear nearest-neighbor topologies.
#QuantumComputing #QuantumAlgorithms #News
#QuantumComputing #QuantumAlgorithms #News
Q-CTRL Demonstrates 100-Qubit Quantum Fourier Transform with Convolutional Compilation Strategy
quantumcomputingreport.com
September 24, 2026 at 9:23 AM
Q-CTRL executed a 100-qubit Quantum Fourier Transform on IBM Heron, resolving a key scaling bottleneck through a novel Convolutional compilation strategy that eliminates routing overhead on linear nearest-neighbor topologies.
#QuantumComputing #QuantumAlgorithms #News
#QuantumComputing #QuantumAlgorithms #News
Good morning, California.
For a great Simons Institute workshop on near-term #quantumcomputers, #faulttolerance, #benchmarking, #quantumadvantage and #quantumalgorithms.
simons.berkeley.edu/workshops/ne...
For a great Simons Institute workshop on near-term #quantumcomputers, #faulttolerance, #benchmarking, #quantumadvantage and #quantumalgorithms.
simons.berkeley.edu/workshops/ne...
April 22, 2024 at 3:42 PM
Good morning, California.
For a great Simons Institute workshop on near-term #quantumcomputers, #faulttolerance, #benchmarking, #quantumadvantage and #quantumalgorithms.
simons.berkeley.edu/workshops/ne...
For a great Simons Institute workshop on near-term #quantumcomputers, #faulttolerance, #benchmarking, #quantumadvantage and #quantumalgorithms.
simons.berkeley.edu/workshops/ne...
Kvantify's Koffee and Qrunch tools leverage the variational quantum eigensolver for quantum chemistry applications, enabling simulations of 60-80 qubits using Nvidia's DGX-Spark infrastructure for practical quantum advantage.
#QuantumChemistry #QuantumAlgorithms #News
#QuantumChemistry #QuantumAlgorithms #News
Quantum Chemistry Algorithms and Practical Quantum Advantage with Kvantify
www.insidequantumtechnology.com
September 22, 2026 at 2:48 PM
Kvantify's Koffee and Qrunch tools leverage the variational quantum eigensolver for quantum chemistry applications, enabling simulations of 60-80 qubits using Nvidia's DGX-Spark infrastructure for practical quantum advantage.
#QuantumChemistry #QuantumAlgorithms #News
#QuantumChemistry #QuantumAlgorithms #News
UK-based quantum algorithms company Phasecraft is establishing U.S. headquarters in Arlington County with $113K investment and 19 new jobs, advancing quantum computing development in the U.S.
#QuantumComputing #QuantumAlgorithms #News
#QuantumComputing #QuantumAlgorithms #News
Phasecraft Establishes U.S. Headquarters in Arlington, Virginia
iq.fp2.dev
September 21, 2026 at 3:36 PM
UK-based quantum algorithms company Phasecraft is establishing U.S. headquarters in Arlington County with $113K investment and 19 new jobs, advancing quantum computing development in the U.S.
#QuantumComputing #QuantumAlgorithms #News
#QuantumComputing #QuantumAlgorithms #News
Researchers achieved a 10x improvement in Macaulay system conditioning for Learning Parities with Structured Noise, reducing quantum circuit requirements for secure communication and machine learning applications.
#QuantumAlgorithms #QuantumML #News
#QuantumAlgorithms #QuantumML #News
Quantum Algorithm Breakthrough: Tenfold Reduction in Learning Parity Problem Complexity
quantumzeitgeist.com
September 21, 2026 at 1:21 PM
Researchers achieved a 10x improvement in Macaulay system conditioning for Learning Parities with Structured Noise, reducing quantum circuit requirements for secure communication and machine learning applications.
#QuantumAlgorithms #QuantumML #News
#QuantumAlgorithms #QuantumML #News
First gate-based VQE solution of the homogeneous Bethe-Salpeter equation for relativistic scalar bound states demonstrates low entanglement and classical tractability—identifying extensions where genuine quantum advantage becomes plausible.
#QuantumAlgorithms #QuantumSimulation #Research
#QuantumAlgorithms #QuantumSimulation #Research
Gate-based Quantum Solution of the Bethe-Salpeter Equation using Tensor-Network VQE
arxiv.org
September 22, 2026 at 7:37 AM
First gate-based VQE solution of the homogeneous Bethe-Salpeter equation for relativistic scalar bound states demonstrates low entanglement and classical tractability—identifying extensions where genuine quantum advantage becomes plausible.
#QuantumAlgorithms #QuantumSimulation #Research
#QuantumAlgorithms #QuantumSimulation #Research
Novel quantum implementation of the Jacobi iterative method using QSVT that achieves constant ancilla overhead and linear circuit depth, demonstrated on Poisson problems including the pressure equation in computational fluid dynamics.
#QuantumAlgorithms #QuantumComputing #Research
#QuantumAlgorithms #QuantumComputing #Research
Quantum Jacobi Algorithm Using QSVT for Solving Linear Systems with Applications to Poisson Equations
arxiv.org
September 22, 2026 at 7:46 AM
Novel quantum implementation of the Jacobi iterative method using QSVT that achieves constant ancilla overhead and linear circuit depth, demonstrated on Poisson problems including the pressure equation in computational fluid dynamics.
#QuantumAlgorithms #QuantumComputing #Research
#QuantumAlgorithms #QuantumComputing #Research
Looking forward to today's CCP-QC Quantum Algorithms Day at @warwickuni.bsky.social #algorithms #Quantum #QuantumAlgorithms @cosec-ukri.bsky.social
June 5, 2026 at 8:39 AM
Looking forward to today's CCP-QC Quantum Algorithms Day at @warwickuni.bsky.social #algorithms #Quantum #QuantumAlgorithms @cosec-ukri.bsky.social
Achieving optimal copy complexity for quantum spectrum estimation through Chebyshev moment matching. Algorithm matches recent lower bounds, advancing efficient quantum measurement and state learning strategies.
#QuantumAlgorithms #QuantumInfo #Research
#QuantumAlgorithms #QuantumInfo #Research
Optimal Quantum Spectrum Estimation via Chebyshev Moments
arxiv.org
September 25, 2026 at 3:39 AM
Achieving optimal copy complexity for quantum spectrum estimation through Chebyshev moment matching. Algorithm matches recent lower bounds, advancing efficient quantum measurement and state learning strategies.
#QuantumAlgorithms #QuantumInfo #Research
#QuantumAlgorithms #QuantumInfo #Research
WQSP extends QSP with weighted signal operators, achieving exponential reductions in circuit depth and trainable parameters for polynomial approximation while maintaining accuracy—enabling compact activation functions for quantum neural networks.
#QuantumAlgorithms #QuantumML #Research
#QuantumAlgorithms #QuantumML #Research
Weighted Quantum Signal Processing: Parameter-Efficient Polynomial Approximation for NISQ Devices
iq.fp2.dev
September 21, 2026 at 2:55 AM
WQSP extends QSP with weighted signal operators, achieving exponential reductions in circuit depth and trainable parameters for polynomial approximation while maintaining accuracy—enabling compact activation functions for quantum neural networks.
#QuantumAlgorithms #QuantumML #Research
#QuantumAlgorithms #QuantumML #Research
New quantum circuit design enables garbage-free Gaussian elimination over any finite field, generalizing beyond GF(2). Achieves optimal Toffoli depth while maintaining minimal qubit overhead—advancing quantum algorithm implementation.
#QuantumCircuits #QuantumAlgorithms #Research
#QuantumCircuits #QuantumAlgorithms #Research
Quantum Circuit for Gaussian Elimination Over Finite Fields
arxiv.org
September 25, 2026 at 7:14 AM
New quantum circuit design enables garbage-free Gaussian elimination over any finite field, generalizing beyond GF(2). Achieves optimal Toffoli depth while maintaining minimal qubit overhead—advancing quantum algorithm implementation.
#QuantumCircuits #QuantumAlgorithms #Research
#QuantumCircuits #QuantumAlgorithms #Research
Researchers develop exact, certified algorithms to compute quantum speedup exponents in key guessing attacks, revealing super-quadratic quantum advantages up to 3.97× in realistic cryptanalytic scenarios with product-distributed advice.
#QuantumCryptanalysis #QuantumAlgorithms #Research
#QuantumCryptanalysis #QuantumAlgorithms #Research
Computing Quantum Speedup Exponents in Cryptanalytic Key Guessing
iq.fp2.dev
September 24, 2026 at 8:24 AM
Researchers develop exact, certified algorithms to compute quantum speedup exponents in key guessing attacks, revealing super-quadratic quantum advantages up to 3.97× in realistic cryptanalytic scenarios with product-distributed advice.
#QuantumCryptanalysis #QuantumAlgorithms #Research
#QuantumCryptanalysis #QuantumAlgorithms #Research
New quantum score matching framework extends classical learning technique to quantum states, achieving optimal sample complexity for high-temperature Gibbs states. NISQ-friendly implementation on IBM hardware reduces parameter error from 64% to 10%.
#QuantumLearning #QuantumAlgorithms #Research
#QuantumLearning #QuantumAlgorithms #Research
Quantum Score Matching Framework for Learning Thermal Gibbs States
arxiv.org
September 24, 2026 at 7:06 AM
New quantum score matching framework extends classical learning technique to quantum states, achieving optimal sample complexity for high-temperature Gibbs states. NISQ-friendly implementation on IBM hardware reduces parameter error from 64% to 10%.
#QuantumLearning #QuantumAlgorithms #Research
#QuantumLearning #QuantumAlgorithms #Research