78 citations · 217 across the 28 of their papers we have counts for
5 papers · 1 filter
Lower bounds on the number of rounds of the quantum approximate optimization algorithm required for guaranteed approximation ratios
Naphan Benchasattabuse, Andreas Bärtschi, Luis Pedro García-Pintos +3
The quantum approximate optimization algorithm, also known in its generalization as the quantum alternating operator ansatz, (QAOA) is a heuristic hybrid quantum-classical algorith…
A Substrate Scheduler for Compiling Arbitrary Fault-tolerant Graph States
Sitong Liu, Naphan Benchasattabuse, Darcy QC Morgan +3
Graph states are useful computational resources in quantum computing, particularly in measurement-based quantum computing models. However, compiling arbitrary graph states into exe…
Architecture and protocols for all-photonic quantum repeaters
Naphan Benchasattabuse, Michal Hajdušek, Rodney Van Meter
The all-photonic quantum repeater scheme, utilizing a type of graph state called the repeater graph state (RGS), promises resilience to photon losses and operational errors, offeri…
Digital quantum simulator for the time-dependent Dirac equation using discrete-time quantum walks
Shigetora Miyashita, Takahiko Satoh, Michihiko Sugawara +5
We introduce a quantum algorithm for simulating the time-dependent Dirac equation in 3+1 dimensions using discrete-time quantum walks. Thus far, promising quantum algorithms have b…
Hybrid Error-Management Strategies in Quantum Repeater Networks
Poramet Pathumsoot, Theerapat Tansuwannont, Naphan Benchasattabuse +5
A quantum network is expected to enhance distributed quantum computing and quantum communication over a long distance while providing unconditional security. As quantum entanglemen…