12 papers · 1 filter
Sampling hard circuits with verifiably high fidelity
Simon Martiel, Jay-U Chung, Alireza Seif +6
Sampling-based proposals are prominent candidates for demonstrating quantum computations beyond the reach of classical supercomputers. However, it has been difficult to combine the…
Theory and Architecture of Syndrome-Resolved Logical Gates
Nobuyuki Yoshioka, Alireza Seif, Peter Groszkowski +2
We introduce a general framework for weak transversal gates, namely syndrome-resolved implementation of logical unitaries realized by local physical unitaries, and demonstrate its…
GeneCS: Synthesizing Resource-Efficient Code Surgery for Arbitrary Quantum Stabilizer Codes
Junyu Zhou, Ali Javadi-Abhari, Gushu Li
Efficiently realizing logical operations on general stabilizer codes remains a long-standing challenge in fault tolerant quantum computing. While code surgery provides a general fr…
Optimizing the non-Clifford-count in unitary synthesis using Reinforcement Learning
David Kremer, Ali Javadi-Abhari, Priyanka Mukhopadhyay
In this paper we study the potential of using reinforcement learning (RL) in order to synthesize quantum circuits, while optimizing the T-count and CS-count, of unitaries that are…
Basic entanglement distillation with realistic noise
Vikesh Siddhu, Erick Winston, David C. McKay +1
Entanglement distillation is a key component of modular quantum computing and long-range quantum communications. However, this powerful tool to reduce noise in entangled states is…
Big cats: entanglement in 120 qubits and beyond
Ali Javadi-Abhari, Simon Martiel, Alireza Seif +2
Entanglement is the quintessential quantum phenomenon and a key enabler of quantum algorithms. The ability to faithfully entangle many distinct particles is often used as a benchma…