Quantum circuits for OR and AND of ORs Export

@article{Barnum2000, abstract = {We give the first quantum circuit for computing f(0) OR f(1) more reliably than is classically possible with a single evaluation of the function. OR therefore joins XOR (i.e. parity, f(0)[?]f(1)) to give the full set of logical connectives (up to relabelling of inputs and outputs) for which there is quantum speedup.}, author = {Barnum, Howard and Bernstein, Herbert J. and Spector, Lee}, citeulike-article-id = {3505788}, citeulike-linkout-0 = {http://dx.doi.org/10.1088/0305-4470/33/45/304}, doi = {10.1088/0305-4470/33/45/304}, journal = {Journal of Physics A: Mathematical and General}, keywords = {circuit, evolutionary, file-import-08-11-12, genetic, programming}, number = {45}, pages = {8047--8057}, posted-at = {2008-11-12 13:11:43}, priority = {2}, title = {Quantum circuits for OR and AND of ORs}, url = {http://dx.doi.org/10.1088/0305-4470/33/45/304}, volume = {33}, year = {2000} }

TY - JOUR ID - Barnum2000 L3 - citeulike-article-id:3505788 N2 - We give the first quantum circuit for computing f(0) OR f(1) more reliably than is classically possible with a single evaluation of the function. OR therefore joins XOR (i.e. parity, f(0)[?]f(1)) to give the full set of logical connectives (up to relabelling of inputs and outputs) for which there is quantum speedup. IS - 45 JF - Journal of Physics A: Mathematical and General EP - 8057 TI - Quantum circuits for OR and AND of ORs VL - 33 SP - 8047 KW - circuit KW - evolutionary KW - file-import-08-11-12 KW - genetic KW - programming AU - Barnum, Howard AU - Bernstein, Herbert AU - Spector, Lee PY - 2000/// UR - http://dx.doi.org/10.1088/0305-4470/33/45/304 ER -