ﻻ يوجد ملخص باللغة العربية
By considering an unreliable oracle in a query-based model of quantum learning, we present a tradeoff relation between the oracles reliability and the reusability of quantum state of the input data. The tradeoff relation manifests as the fundamental upper bound on the reusability. This limitation on the reusability would increase the quantum access to the input data, i.e., the usage of quantum random access memory (qRAM), repeating the preparation of a superposition of `big input data on the query failure. However, it is found that, a learner can obtain a correct answer even from an unreliable oracle without any additional usage of qRAM---i.e., the complexity of qRAM query does not increase even with an unreliable oracle. This is enabled by repeatedly cycling the quantum state of the input data to the upper bound on the reusability.
Random access memory is an indispensable device for classical information technology. Analog to this, for quantum information technology, it is desirable to have a random access quantum memory with many memory cells and programmable access to each ce
As in conventional computing, key attributes of quantum memories are high storage density and, crucially, random access, or the ability to read from or write to an arbitrarily chosen register. However, achieving such random access with quantum memori
In quantum computing architectures, one important factor is the trade-off between the need to couple qubits to each other and to an external drive and the need to isolate them well enough in order to protect the information for an extended period of
Qubit connectivity is an important property of a quantum processor, with an ideal processor having random access -- the ability of arbitrary qubit pairs to interact directly. Here, we implement a random access superconducting quantum information proc
Loading data in a quantum device is required in several quantum computing applications. Without an efficient loading procedure, the cost to initialize the algorithms can dominate the overall computational cost. A circuit-based quantum random access m