ﻻ يوجد ملخص باللغة العربية
We present an algorithm for the generalized search problem (searching $k$ marked items among $N$ items) based on a continuous Hamiltonian and exploiting resonance. This resonant algorithm has the same time complexity $O(sqrt{N/k})$ as the Grover algorithm. A natural extension of the algorithm, incorporating auxiliary monitor qubits, can determine $k$ precisely, if it is unknown. The time complexity of our counting algorithm is $O(sqrt{N})$, similar to the best quantum approximate counting algorithm, or better, given appropriate physical resources.
The ability to engineer and manipulate different types of quantum mechanical objects allows us to take advantage of their unique properties and create useful hybrid technologies. Thus far, complex quantum states and exquisite quantum control have bee
There are well-known protocols for performing CNOT quantum logic with qubits coupled by particular high-symmetry (Ising or Heisenberg) interactions. However, many architectures being considered for quantum computation involve qubits or qubits and res
A universal quantum computing scheme, with a universal set of logical gates, is proposed based on networks of 1D quantum systems. The encoding of information is in terms of universal features of gapped phases, for which effective field theories such
We propose a quantum simulator based on driven superconducting qubits where the interactions are generated parametrically by a polychromatic magnetic flux modulation of a tunable bus element. Using a time-dependent Schrieffer-Wolff transformation, we
Reliable qubits are difficult to engineer, but standard fault-tolerance schemes use seven or more physical qubits to encode each logical qubit, with still more qubits required for error correction. The large overhead makes it hard to experiment with