activity
20242026
most citedDemonstration of Algorithmic Quantum Speedup for an Abelian Hidden Subgroup Problem

7 citations · 8 across the 6 of their papers we have counts for

collaborators

6 papers

quant-ph2026

Demonstration of Exponential Quantum Speedup with Constant-Depth Compiled Circuits for Simon's Problem

Phattharaporn Singkanipa, Victor Kasatkin, Daniel A. Lidar

We demonstrate exponential algorithmic quantum speedup for a restricted-Hamming-weight version of Simon's problem, in which the hidden string is promised to satisfy $\text{HW}(…

quant-ph2026

Quantum Error Correction and Dynamical Decoupling: Better Together or Apart?

Victor Kasatkin, Mario Morford-Oberst, Arian Vezvaee +1

Quantum error correction/detection (QEC/QED) and dynamical decoupling (DD) are tools for protecting quantum information. A natural goal is to combine them to outperform either appr…

quant-ph2025★ 1 cited

Demonstration of High-Fidelity Entangled Logical Qubits using Transmons

Arian Vezvaee, Vinay Tripathi, Mario Morford-Oberst +3

Quantum error correction (QEC) codes are necessary to fault-tolerantly operate quantum computers. However, every such code is inherently limited by its inability to detect logical…

quant-ph2024

Detecting Quantum and Classical Phase Transitions via Unsupervised Machine Learning of the Fisher Information Metric

Victor Kasatkin, Evgeny Mozgunov, Nicholas Ezzell +1

The detection of quantum and classical phase transitions in the absence of an order parameter is possible using the Fisher information metric (FIM), also known as fidelity suscepti…

cs.LG2024

ClassiFIM: An Unsupervised Method To Detect Phase Transitions

Victor Kasatkin, Evgeny Mozgunov, Nicholas Ezzell +3

Estimation of the Fisher Information Metric (FIM-estimation) is an important task that arises in unsupervised learning of phase transitions, a problem proposed by physicists. This…

quant-ph2024★ 7 cited

Demonstration of Algorithmic Quantum Speedup for an Abelian Hidden Subgroup Problem

P. Singkanipa, V. Kasatkin, Z. Zhou +2

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 pr…