Skip to main content
Phattharaporn Singkanipa on Muck Rack

Phattharaporn Singkanipa

As seen in: Physical Review B
Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work. Claim your profile

Get in touch with Phattharaporn

Contact Phattharaporn, search articles and posts on X, monitor coverage, and track replies from one place.

Learn more about Muck Rack

Actions

Share this page

Is this you?

As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile

Articles

Demonstration of Algorithmic Quantum Speedup for an Abelian Hidden Subgroup Problem

|
By Phattharaporn Singkanipa, Victor Kasatkin, Zeyuan Zhou, Johns Hopkins
| Physical Review B
Simon’s problem is to find a hidden period (a bitstring) encoded into an unknown 2-to-1 function. It is one of the earliest problems for which an exponential quantum speedup was proven for ideal, noiseless quantum computers, albeit in the oracle model. Here, using two different 127-qubit IBM Quantum superconducting processors, we demonstrate an algorithmic quantum speedup for a variant of Simon’s problem where the hidden period has a restricted Hamming weight .
Open in Who Shared View Duplicates (27) Issue with article?
See all 1 articles