Showing 2020Show all
2 papers · 1 filter
quant-ph2020
Recycling qubits in near-term quantum computers
Galit Anikeeva, Isaac H. Kim, Patrick Hayden
Quantum computers are capable of efficiently contracting unitary tensor networks, a task that is likely to remain difficult for classical computers. For instance, networks based on…
quant-ph2020
Number Partitioning with Grover's Algorithm in Central Spin Systems
Galit Anikeeva, Ognjen Marković, Victoria Borish +7
Numerous conceptually important quantum algorithms rely on a black-box device known as an oracle, which is typically difficult to construct without knowing the answer to the proble…