Masoud Mohseni

Hewlett Packard Enterprise (United States) — United States

Computer Science · Physical Sciences

39h-index12.8kcitations153works1.22yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Quantum Computing Algorithms and Architecture(70), Quantum Information and Cryptography(63), Spectroscopy and Quantum Chemical Studies(27), Quantum and electron transport phenomena(21), Quantum Mechanics and Applications(19)

Publications148 total

Accelerating hybrid XOR–CNF Boolean satisfiability problems natively with in-memory computing
Nature Communications·2026Open Access
Distributed Quantum Computing with Adaptive Circuit Knitting
Zenodo (CERN European Organization for Nuclear Research)·2026Open Access
Distributed Quantum Computing with Adaptive Circuit Knitting
Zenodo (CERN European Organization for Nuclear Research)·2026Open Access
Dataset for Accelerating Hybrid XOR–CNF SAT Problems Natively with In-Memory Computing
Zenodo (CERN European Organization for Nuclear Research)·2026Open Access
Dataset for Accelerating Hybrid XOR–CNF SAT Problems Natively with In-Memory Computing
Zenodo (CERN European Organization for Nuclear Research)·2026· 1 citedOpen Access
Impacts of Decoder Latency on Utility-Scale Quantum Computer Architectures
arXiv (Cornell University)·2025Open Access
A Full Stack Framework for High Performance Quantum-Classical Computing
arXiv (Cornell University)·2025Open Access
Pushing the boundary of quantum advantage in hard combinatorial optimization with probabilistic computers
Nature Communications·2025Open Access
Limitations of tensor-network approaches for optimization and sampling: A comparison to quantum and classical Ising machines
Physical Review Applied·2025· 2 citedOpen Access
Solving Boolean satisfiability problems with resistive content addressable memories
npj Unconventional Computing·2025· 4 citedOpen Access
A Statistical Analysis for Per-Instance Evaluation of Stochastic Optimizers: How Many Repeats Are Enough?
arXiv (Cornell University)·2025Open Access
Parallel tempering–inspired distributed binary optimization with in-memory computing
Physical Review Applied·2025· 2 cited
Solving Boolean satisfiability problems with resistive content addressable memories
arXiv (Cornell University)·2025Open Access
Limitations of tensor network approaches for optimization and sampling: A comparison to quantum and classical Ising machines
arXiv (Cornell University)·2024Open Access
How to Build a Quantum Supercomputer: Scaling from Hundreds to Millions of Qubits
arXiv (Cornell University)·2024· 4 citedOpen Access
Energy landscapes of combinatorial optimization in Ising machines
Physical review. E·2024· 7 cited
Next-generation Probabilistic Computing Hardware with 3D MOSAICs, Illusion Scale-up, and Co-design
arXiv (Cornell University)·2024Open Access
Combinatorial Reasoning: Selecting Reasons in Generative AI Pipelines via Combinatorial Optimization
arXiv (Cornell University)·2024· 2 citedOpen Access
Energy landscapes of combinatorial optimization in Ising machines
arXiv (Cornell University)·2024Open Access
Sampling diverse near-optimal solutions via algorithmic quantum annealing
Physical review. E·2023· 6 citedOpen Access
page 1 of 8Next →

Frequent Co-authors

Hartmut Neven(15), Seth Lloyd(14), Jarrod R. McClean(13), Sergei V. Isakov(12), Sergio Boixo(12), Ryan Babbush(11), Vadim Smelyanskiy(11), Michael Broughton(10), Austin G. Fowler(10), Matthew P. Harrigan(10), Jiang Zhang(10), Xiao Mi(9), Frank Arute(9), Kunal Arya(9), Joseph C. Bardin(9), David A. Buell(9), Brian Burkett(9), Roberto Collins(9), A. Dunsworth(9), Edward Farhi(9)