activity
20082022
most citedQuantum Speed-up for Approximating Partition Functions

57 citations · 90 across the 12 of their papers we have counts for

collaborators
Showing quant-phShow all

11 papers · 1 filter

quant-ph2022

Space-efficient Quantization Method for Reversible Markov Chains

Chen-Fu Chiang, Anirban Chowdhury, Pawel Wocjan

In a seminal paper, Szegedy showed how to construct a quantum walk for any reversible Markov chain such that its eigenvector with eigenphase is a quantum sample of t…

quant-ph2022

Grover Search Inspired Alternating Operator Ansatz of Quantum Approximate Optimization Algorithm for Search Problems

Chen-Fu Chiang, Paul M. Alsing

We use the mapping between two computation frameworks , Adiabatic Grover Search (AGS) and Adiabatic Quantum Computing (AQC), to translate the Grover search algorithm into the AQC r…

quant-ph2022

Quantum Walk Inspired Dynamic Adiabatic Local Search

Chen-Fu Chiang, Paul M. Alsing

We investigate the irreconcilability issue that raises in translating the search algorithm from the Continuous-Time Quantum Walk (CTQW) framework to the Adiabatic Quantum Computing…

quant-ph2017★ 2 cited

Optimizing Quantum Walk Search on a Reduced Uniform Complete Multi-Partite Graph

Chen-Fu Chiang, Chang-Yu Hsieh

In a recent work by Novo et al. (Sci. Rep. 5, 13304, 2015), the invariant subspace method was applied to the study of continuous-time quantum walk (CTQW). The method helps to reduc…

quant-ph2013★ 2 cited

Selecting Efficient Phase Estimation With Constant-Precision Phase Shift Operators

Chen-Fu Chiang

We investigate the cost of three phase estimation procedures that require only constant-precision phase shift operators. The cost is in terms of the number of elementary gates, not…

quant-ph2013★ 4 cited

Quantum Phase Estimation with an Arbitrary Number of Qubits

Chen-Fu Chiang

Due to the great difficulty in scalability, quantum computers are limited in the number of qubits during the early stages of the quantum computing regime. In addition to the requir…

quant-ph2011★ 6 cited

Hitting Time of Quantum Walks with Perturbation

Chen-Fu Chiang, Guillermo Gomez

The hitting time is the required minimum time for a Markov chain-based walk (classical or quantum) to reach a target state in the state space. We investigate the effect of the pert…

quant-ph2010

Quantum Phase Estimation with Arbitrary Constant-precision Phase Shift Operators

Hamed Ahmadi, Chen-Fu Chiang

While Quantum phase estimation (QPE) is at the core of many quantum algorithms known to date, its physical implementation (algorithms based on quantum Fourier transform (QFT)) is h…

quant-ph2010★ 2 cited

Sensitivity of Quantum Walks with Perturbation

Chen-Fu Chiang

Quantum computers are susceptible to noises from the outside world. We investigate the effect of perturbation on the hitting time of a quantum walk and the stationary distribution…

quant-ph2009★ 4 cited

Efficient Circuits for Quantum Walks

Chen-Fu Chiang, Daniel Nagaj, Pawel Wocjan

We present an efficient general method for realizing a quantum walk operator corresponding to an arbitrary sparse classical random walk. Our approach is based on Grover and Rudolph…

quant-ph2008★ 57 cited

Quantum Speed-up for Approximating Partition Functions

Pawel Wocjan, Chen-Fu Chiang, Anura Abeyesinghe +1

We achieve a quantum speed-up of fully polynomial randomized approximation schemes (FPRAS) for estimating partition functions that combine simulated annealing with the Monte-Carlo…