Implementation of a quantum algorithm to solve Bernstein-Vazirani's parity problem without entanglement on an ensemble quantum computer
Jiangfeng Du, Mingjun Shi, Jihui Wu, Xianyi Zhou, Yangmei Fan, BangJiao Ye, Rongdian Han
Abstract
Bernstein and Varizani have given the first quantum algorithm to solve parity problem in which a strong violation of the classical imformation theoritic bound comes about. In this paper, we refine this algorithm with fewer resource and implement a two qubits algorithm in a single query on an ensemble quantum computer for the first time.
Create a lesson
Related papers
Using topology to reveal all mutually unbiased bases in dimension six
Mateo Cárdenes Wuttig, Joseph Tindall
Arithmetic Depth, Minimal Gate Alphabets, and Exact Program-State Resources for Single-Qubit Dyadic Programs
Tony Newton, Dan-Adrian German
Probing gravity at megahertz frequencies with levitated rotors
Matteo Fadel, Andrea Vinante
Optimal Holding Times for Entanglement Swapping
Van Sy Mai, Richard J. La, Abdella Battou
Quantum Algorithms for Molecular Response Functions: Resolvent Kernels, Time-Domain Sampling, Query Lower Bounds with Matched Single-Point Calibers, and a Six-Route Comparison
Yunlong Liu, Yujin Tang, Miao Xu et al.
GFlowQEC: Generative Flow Networks that Learn to Sample Quantum LDPC Codes
Nuno Batista, Gabriel Falcao, Penousal Machado