aqora

A New Scheduling Problem Motivated by Quantum Computation.

Cynthia A. Phillips, Robert D. Carr, Anand Ganti

May 1, 20080 citations

Modified shuffled schedule for nonbinary low-density parity-check codes

Jun Ting Lin, Zhiyuan Yan

In this paper, a shuffled schedule of the Min-Max decoding algorithm is proposed for nonbinary LDPC codes. To reduce the latency and memory requirement, a modified shuffled schedule with much simpler check node processing is also proposed, based on a new shuffle sort algorithm. Numerical simulations for three LDPC codes over GF(32) with different lengths and rates show: (1) both the shuffled and modified shuffled schedule converge faster and have slightly better error performance than the flooding schedule, and (2) the degradation of the modified shuffled schedule in error performance as well as convergence rate is negligible.In this paper, a shuffled schedule of the Min-Max decoding algorithm is proposed for nonbinary LDPC codes. To reduce the latency and memory requirement, a modified shuffled schedule with much simpler check node processing is also proposed, based on a new shuffle sort algorithm. Numerical simulations for three LDPC codes over GF(32) with different lengths and rates show: (1) both the shuffled and modified shuffled schedule converge faster and have slightly better error performance than the flooding schedule, and (2) the degradation of the modified shuffled schedule in error performance as well as convergence rate is negligible.

IEEE International Symposium on Circuits and Systems proceedingsMay 1, 20120 citations

Reflection-Based Adiabatic State Preparation

Jessica Lemieux, Artur Scherer, Pooya Ronagh

We propose a circuit-model quantum algorithm for eigenpath traversal that is based on a combination of concepts from Grover's search and adiabatic quantum computation. Our algorithm deploys a sequence of reflections determined from eigenspaces of instantaneous Hamiltonians defined along an adiabatic schedule in order to prepare a ground state of a target problem Hamiltonian. We provide numerical evidence suggesting that, for combinatorial search problems, our algorithm can find a solution faster, on average, than Grover's search. We demonstrate our findings by applying both algorithms to solving the NP-hard MAX-2SAT problem.We propose a circuit-model quantum algorithm for eigenpath traversal that is based on a combination of concepts from Grover's search and adiabatic quantum computation. Our algorithm deploys a sequence of reflections determined from eigenspaces of instantaneous Hamiltonians defined along an adiabatic schedule in order to prepare a ground state of a target problem Hamiltonian. We provide numerical evidence suggesting that, for combinatorial search problems, our algorithm can find a solution faster, on average, than Grover's search. We demonstrate our findings by applying both algorithms to solving the NP-hard MAX-2SAT problem.

arXiv:2111.05461Nov 10, 20210 citations

Scheduling Quantum Programs

Robert L. Smith, Michael J. Curtis, Anthony Polloreno +3 more

Bulletin of the American Physical SocietyMar 15, 20170 citations

Scheduling with Multiple Dispatch Rules: A Quantum Computing Approach

Poojith U Rao, Balwinder Sodhi

Lecture notes in computer scienceJan 1, 20224 citations

Serial Symbol-Reliability Based Algorithm for Decoding Non-Binary LDPC Codes

Francisco García-Herrero, María José Canet, Javier Valls +1 more

A symbol-reliability based decoding algorithm with serial schedule for non-binary low-density parity-check (LDPC) codes is presented. Performance results, together with implementation complexity analysis, are provided for different sample codes. The proposed algorithm achieves a similar gain to the min- max algorithm for codes with column weight dv≥ 6, with lower complexity than previous symbol-reliability based algorithms.

IEEE Communications LettersApr 18, 201210 citations

An R || C max Quantum Scheduling Algorithm

Related papers

An R || C max Quantum Scheduling Algorithm

Related papers