Optimal universal programming of unitary gates
- URL: http://arxiv.org/abs/2007.10363v3
- Date: Thu, 4 Feb 2021 10:08:43 GMT
- Title: Optimal universal programming of unitary gates
- Authors: Yuxiang Yang, Renato Renner, Giulio Chiribella
- Abstract summary: A universal quantum processor is a device that takes as input a (quantum) program, containing an encoded unitary gate, and a (quantum) data register.
A fundamental open question is how the size of the smallest quantum program scales with the approximation error.
- Score: 7.75406296593749
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: A universal quantum processor is a device that takes as input a (quantum)
program, containing an encoding of an arbitrary unitary gate, and a (quantum)
data register, on which the encoded gate is applied. While no perfect universal
quantum processor can exist, approximate processors have been proposed in the
past two decades. A fundamental open question is how the size of the smallest
quantum program scales with the approximation error. Here we answer the
question, by proving a bound on the size of the program and designing a
concrete protocol that attains the bound in the asymptotic limit. Our result is
based on a connection between optimal programming and the Heisenberg limit of
quantum metrology, and establishes an asymptotic equivalence between the tasks
of programming, learning, and estimating unitary gates.
Related papers
- Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
We develop a reinforcement learning-based quantum compiler for a superconducting processor.
We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths.
Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
arXiv Detail & Related papers (2024-06-18T01:49:48Z) - Quantum process tomography of continuous-variable gates using coherent
states [49.299443295581064]
We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit.
We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
arXiv Detail & Related papers (2023-03-02T18:08:08Z) - Universal qudit gate synthesis for transmons [44.22241766275732]
We design a superconducting qudit-based quantum processor.
We propose a universal gate set featuring a two-qudit cross-resonance entangling gate.
We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
arXiv Detail & Related papers (2022-12-08T18:59:53Z) - Approximate encoding of quantum states using shallow circuits [0.0]
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates.
Here, we aim at creating an approximate encoding of the target state using a limited number of gates.
Our work offers a universal method to prepare target states using local gates and represents a significant improvement over known strategies.
arXiv Detail & Related papers (2022-06-30T18:00:04Z) - Scalable algorithm simplification using quantum AND logic [18.750481652943005]
We implement a quantum version of AND logic that can reduce the cost, enabling the execution of key quantum circuits.
On a high-scalability superconducting quantum processor, we demonstrate low-depth synthesis of high-fidelity generalized Toffoli gates with up to 8 qubits and Grover's search algorithm in a search space of up to 64 entries.
arXiv Detail & Related papers (2021-12-30T04:25:39Z) - Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
"Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation.
We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
arXiv Detail & Related papers (2021-12-09T19:00:00Z) - Special-Purpose Quantum Processor Design [2.275405513780208]
Full connectivity of qubits is necessary for most quantum algorithms.
inserting swap gate to enable the two-qubit gates between uncoupled qubits significantly decreases the computation result fidelity.
We propose a Special-Purpose Quantum Processor Design method that can design suitable structures for different quantum algorithms.
arXiv Detail & Related papers (2021-02-01T23:26:15Z) - Infinite-Dimensional Programmable Quantum Processors [0.0]
A universal programmable quantum processor uses program quantum states to apply an arbitrary quantum channel to an input state.
We generalize the concept of a finite-dimensional programmable quantum processor to infinite dimension.
arXiv Detail & Related papers (2020-12-01T18:53:44Z) - Deterministic multi-mode gates on a scalable photonic quantum computing
platform [0.0]
We show a small quantum circuit consisting of 10 single-mode gates and 2 two-mode gates on a three-mode input state.
On this platform, fault-tolerant universal quantum computing is possible if the cluster state entanglement is improved.
arXiv Detail & Related papers (2020-10-27T16:37:59Z) - Fault-tolerant Coding for Quantum Communication [71.206200318454]
encode and decode circuits to reliably send messages over many uses of a noisy channel.
For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable.
Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
arXiv Detail & Related papers (2020-09-15T15:10:50Z) - Programming a quantum computer with quantum instructions [39.994876450026865]
We use a density matrixiation protocol to execute quantum instructions on quantum data.
A fixed sequence of classically-defined gates performs an operation that uniquely depends on an auxiliary quantum instruction state.
The utilization of quantum instructions obviates the need for costly tomographic state reconstruction and recompilation.
arXiv Detail & Related papers (2020-01-23T22:43:29Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.