Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userImplementing a Fast Unbounded Quantum Fanout Gate Using Power-Law Interactions
109
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
The standard circuit model for quantum computation presumes the ability to directly perform gates between arbitrary pairs of qubits, which is unlikely to be practical for large-scale experiments. Power-law interactions with strength decaying as $1/r^alpha$ in the distance $r$ provide an experimentally realizable resource for information processing, whilst still retaining long-range connectivity. We leverage the power of these interactions to implement a fast quantum fanout gate with an arbitrary number of targets. Our implementation allows the quantum Fourier transform (QFT) and Shors algorithm to be performed on a $D$-dimensional lattice in time logarithmic in the number of qubits for interactions with $alpha le D$. As a corollary, we show that power-law systems with $alpha le D$ are difficult to simulate classically even for short times, under a standard assumption that factoring is classically intractable. Complementarily, we develop a new technique to give a general lower bound, linear in the size of the system, on the time required to implement the QFT and the fanout gate in systems that are constrained by a linear light cone. This allows us to prove an asymptotically tighter lower bound for long-range systems than is possible with previously available techniques.
rate research
Read More
The identification of phenomena able to pinpoint quantum interference is attracting large interest. Indeed, a generalization of the Hong-Ou-Mandel effect valid for any number of photons and optical modes would represent an important leap ahead both from a fundamental perspective and for practical applications, such as certification of photonic quantum devices, whose computational speedup is expected to depend critically on multiparticle interference. Quantum distinctive features have been predicted for many particles injected into multimode interferometers implementing the Fourier transformation in the Fock space. In this work we develop a scalable approach for the implementation of quantum fast Fourier transform using 3-D photonic integrated interferometers, fabricated via femtosecond laser writing technique. We observe the quantum suppression of a large number of output states with 4- and 8-mode optical circuits: the experimental results demonstrate genuine quantum interference between the injected photons, thus offering a powerful tool for diagnostic of photonic platforms.
We demonstrate that the unbounded fan-out gate is very powerful. Constant-depth polynomial-size quantum circuits with bounded fan-in and unbounded fan-out over a fixed basis (denoted by QNCf^0) can approximate with polynomially small error the following gates: parity, mod[q], And, Or, majority, threshold[t], exact[q], and Counting. Classically, we need logarithmic depth even if we can use unbounded fan-in gates. If we allow arbitrary one-qubit gates instead of a fixed basis, then these circuits can also be made exact in log-star depth. Sorting, arithmetical operations, phase estimation, and the quantum Fourier transform with arbitrary moduli can also be approximated in constant depth.
The Lieb-Robinson theorem states that information propagates with a finite velocity in quantum systems on a lattice with nearest-neighbor interactions. What are the speed limits on information propagation in quantum systems with power-law interactions, which decay as $1/r^alpha$ at distance $r$? Here, we present a definitive answer to this question for all exponents $alpha>2d$ and all spatial dimensions $d$. Schematically, information takes time at least $r^{min{1, alpha-2d}}$ to propagate a distance~$r$. As recent state transfer protocols saturate this bound, our work closes a decades-long hunt for optimal Lieb-Robinson bounds on quantum information dynamics with power-law interactions.
Recently, Bravyi, Gosset, and K{o}nig (Science, 2018) exhibited a search problem called the 2D Hidden Linear Function (2D HLF) problem that can be solved exactly by a constant-depth quantum circuit using bounded fan-in gates (or QNC^0 circuits), but cannot be solved by any constant-depth classical circuit using bounded fan-in AND, OR, and NOT gates (or NC^0 circuits). In other words, they exhibited a search problem in QNC^0 that is not in NC^0. We strengthen their result by proving that the 2D HLF problem is not contained in AC^0, the class of classical, polynomial-size, constant-depth circuits over the gate set of unbounded fan-in AND and OR gates, and NOT gates. We also supplement this worst-case lower bound with an average-case result: There exists a simple distribution under which any AC^0 circuit (even of nearly exponential size) has exponentially small correlation with the 2D HLF problem. Our results are shown by constructing a new problem in QNC^0, which we call the Relaxed Parity Halving Problem, which is easier to work with. We prove our AC^0 lower bounds for this problem, and then show that it reduces to the 2D HLF problem. As a step towards even stronger lower bounds, we present a search problem that we call the Parity Bending Problem, which is in QNC^0/qpoly (QNC^0 circuits that are allowed to start with a quantum state of their choice that is independent of the input), but is not even in AC^0[2] (the class AC^0 with unbounded fan-in XOR gates). All the quantum circuits in our paper are simple, and the main difficulty lies in proving the classical lower bounds. For this we employ a host of techniques, including a refinement of H{aa}stads switching lemmas for multi-output circuits that may be of independent interest, the Razborov-Smolensky AC^0[2] lower bound, Vaziranis XOR lemma, and lower bounds for non-local games.
Quantum computation is conventionally performed using quantum operations acting on two-level quantum bits, or qubits. Qubits in modern quantum computers suffer from inevitable detrimental interactions with the environment that cause errors during computation, with multi-qubit operations often being a primary limitation. Most quantum devices naturally have multiple accessible energy levels beyond the lowest two traditionally used to define a qubit. Qudits offer a larger state space to store and process quantum information, reducing complexity of quantum circuits and improving efficiency of quantum algorithms. Here, we experimentally demonstrate a ternary decomposition of a multi-qubit operation on cloud-enabled fixed-frequency superconducting transmons. Specifically, we realize an order-preserving Toffoli gate consisting of four two-transmon operations, whereas the optimal order-preserving binary decomposition uses eight texttt{CNOT}s on a linear transmon topology. Both decompositions are benchmarked via truth table fidelity where the ternary approach outperforms on most sets of transmons on texttt{ibmq_jakarta}, and is further benchmarked via quantum process tomography on one set of transmons to achieve an average gate fidelity of 78.00% $pm$ 1.93%.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
