8 citations · 8 across the 4 of their papers we have counts for
4 papers · 1 filter
Measurement Geometry for Quantum Random Access Codes: Beyond Nayak Bound and Toward Optimality
Seiseki Akibue, Rudy Raymond, Suguru Tamaki +1
Quantum random access codes (QRACs) ask how well N classical bits can be encoded into M qubits while allowing any single bit to be recovered. Although the Nayak bound remains the s…
Noise Robustness of Quantum Relaxation for Combinatorial Optimization
Kentaro Tamura, Yohichi Suzuki, Rudy Raymond +5
QRAO (Quantum Random Access Optimization) is a relaxation algorithm that reduces the number of qubits required to solve a problem by encoding multiple variables per qubit using QRA…
Recursive Quantum Relaxation for Combinatorial Optimization Problems
Ruho Kondo, Yuki Sato, Rudy Raymond +1
Quantum optimization methods use a continuous degree-of-freedom of quantum states to heuristically solve combinatorial problems, such as the MAX-CUT problem, which can be attribute…
The Role of Entanglement in Quantum-Relaxation Based Optimization Algorithms
Kosei Teramoto, Rudy Raymond, Hiroshi Imai
Quantum Random Access Optimizer (QRAO) is a quantum-relaxation based optimization algorithm proposed by Fuller et al. that utilizes Quantum Random Access Code (QRAC) to encode mult…