arXiv:1601.06819quant-ph
Quantum algorithms require a universal set of gates that can be implemented in a physical system. For these, an optimal decomposition into a sequence of available operations is desired. Here, we present a method to find such sequences for a small-scale ion trap quantum information processor. We further adapt the method to state preparation and quantum algorithms with in-sequence measurements.
Linked by 2 identifiable commenters in 3 comments across 3 threads, from Mar 2016 to Jul 2023.
related to the 5 qubit quantum machine mentioned. https://news.ycombinator.com/item?id=11241194 http://science.sciencemag.org/content/351/6277/1068 http://arxiv.org/abs/1507.08852 http://arxiv.org/abs/1601.06819 https://news.ycombinator.com/item?id=11235186
Somehow the submitted link got mangled: http://spectrum.ieee.org/tech-talk/computing/hardware/encryp... The article has a broken link to the paper abstract, which is "Realization of a scalable Shor algorithm" available here: http://science.sciencemag.org/content/351/6277/1068…
Connected through shared HN threads, not inferred similarity or a recommendation.
See e.g. equations (5) and (6) from [1], where any qubit subset of a system might undergo the action of the M–S gate. But definitely the usual presentation of the physics of M–S is on a two qubit system. [1] https://arxiv.org/abs/1601.06819
reikonomushaView on HNParent context