Probabilistic Design of Parametrized Quantum Circuits through Local Gate Modifications
The Edward S. Rogers Sr. Department of Electrical \& Computer Engineering, University of Toronto 10 King's College Rd Toronto ON M5S 3G8 Canada；Department of Chemical；Physical Sciences, University of Toronto Mississauga 3359 Mississauga Road Mississauga ON L5L 1C6 Canada；Department of Computer Science, University of Toronto Toronto ON M5S 2E4 Canada；Vector Institute for Artificial Intelligence 108 College St W1140 Toronto ON M5G 0C6 Canada；The Edward S. Rogers Sr. Department of Electrical \& Computer Engineering, University of Toronto 10 King's College Rd Toronto ON M5G 0C6 Canada；Department of Chemistry, University of Calgary 2500 University Drive NW Calgary AB T2N 1N4 Canada；Department of Computer Science, University of Toronto 40 St. George Street Toronto ON M5S 2E4 Canada；The Edward S. Rogers Sr. Department of Electrical \& Computer Engineering, University of Toronto；Physical Sciences, University of Toronto Mississauga；Department of Computer Science, University of Toronto；Vector Institute for Artificial Intelligence；Department of Chemistry, University of Calgary
Grier M. Jones, Aviraj Newatia, Alexander Lao, Aditya K. Rao, Viki Kumar Prasad, Hans-Arno Jacobsen
Within quantum machine learning, parametrized quantum circuits provide flexible quantum models, but their performance is often highly task-dependent, making manual circuit design challenging. Alternatively, quantum architecture search algorithms have been proposed to automate the discovery of task-specific parametrized quantum circuits using systematic frameworks. In this work, we propose an evolution-inspired heuristic quantum architecture search algorithm, which we refer to as the local quantum architecture search. The goal of the local quantum architecture search algorithm is to optimize parametrized quantum circuit architectures through a local, probabilistic search over a fixed set of gate-level actions applied to existing circuits. We evaluate the local quantum architecture search algorithm on two synthetic function-fitting regression tasks and two quantum chemistry regression datasets, including the BSE49 dataset of bond separation energies for first- and second-row elements and a dataset of water conformers generated using the data-driven coupled-cluster approach. Using state-vector simulation, our results highlight the applicability of local quantum architecture search algorithm for identifying competitive circuit architectures with desirable performance metrics. Lastly, we analyze the properties of the discovered circuits and demonstrate the deployment of the best-performing model on state-of-the-art quantum hardware.
We present a formula for an infinite number of universal quantum logic gates, which are $4$ by $4$ unitary solutions to the Yang-Baxter (Y-B) equation. We obtain this family from a certain representation of the cyclic group of order $n$. We then show that this {\it discrete} family, parametrized by integers $n$, is in fact, a small sub-class of a larger {\it continuous} family, parametrized by real numbers $θ$, of universal quantum gates. We discuss the corresponding Yang-Baxterization and related symmetries in the concomitant Hamiltonian.
Nonlocal gate operation is based on sharing an ancillary pair of qubits in perfect entanglement. When the ancillary pair are partially entangled, the efficiency of the gate operation drops. Using general transformations, we devise probabilistic nonlocal gates, which perform the nonlocal operation conclusively when the ancillary pair are only partially entangled. We show that a controlled purification protocol can be implemented by the probabilistic nonlocal operation.
We propose a scheme to perform probabilistic quantum gates on remote trapped atom qubits through interference of optical frequency qubits. The method does not require localization of the atoms to the Lamb-Dicke limit, and is not sensitive to interferometer phase instabilities. Such probabilistic gates can be used for scalable quantum computation.
Parametrized quantum optical circuits are a class of quantum circuits in which the carriers of quantum information are photons and the gates are optical transformations. Classically optimizing these circuits is challenging due to the infinite dimensionality of the photon number vector space that is associated to each optical mode. Truncating the space dimension is unavoidable, and it can lead to incorrect results if the gates populate photon number states beyond the cutoff. To tackle this issue, we present an algorithm that is orders of magnitude faster than the current state of the art, to re…
We propose a scalable way to construct a 3D cluster state for fault-tolerant topological one-way computation (TOWC) even if the entangling two-qubit gates succeed with a small probability. It is shown that fault-tolerant TOWC can be performed with the success probability of the two-qubit gate such as 0.5 (0.1) provided that the conditional error probability of the two-qubit gate is less than 0.040% (0.016%). Furthermore, the resource usage is considerably suppressed compared to the conventional fault-tolerant schemes with probabilistic two-qubit gates.
We propose an efficient scheme for constructing arbitrary 2-D cluster states using probabilistic entangling quantum gates.In our scheme, the 2-D cluster state is constructed with star-like basic units generated from 1-D cluster chains.By applying parallel operations, the process of generating 2-D (or higher dimensional) cluster states is significantly accelerated, which provides an efficient way to implement realistic one way quantum computers.
We show that the Hadamard and Unitary gates could be implemented by a unitary evolution together with a measurement for any unknown state chosen from a set $A = {{| {Ψ_i} > ,| {\bar Ψ_i} >}}({i = 1,2})$ if and only if $| {Ψ_1} > ,| {Ψ_2} > ,| {\bar Ψ_1} > ,| {\bar Ψ_2} >$ are linearly independent. We also derive the best transformation efficiencies.
A new approach to efficient quantum computation with probabilistic gates is proposed and analyzed in both a local and non-local setting. It combines heralded gates previously studied for atom or atom-like qubits with logical encoding from linear optical quantum computation in order to perform high fidelity quantum gates across a quantum network. The error-detecting properties of the heralded operations ensure high fidelity while the encoding makes it possible to correct for failed attempts such that deterministic and high-quality gates can be achieved. Importantly, this is robust to photon los…
In the current noisy intermediate-scale quantum (NISQ) era, quantum machine learning is emerging as a dominant paradigm to program gate-based quantum computers. In quantum machine learning, the gates of a quantum circuit are parametrized, and the parameters are tuned via classical optimization based on data and on measurements of the outputs of the circuit. Parametrized quantum circuits (PQCs) can efficiently address combinatorial optimization problems, implement probabilistic generative models, and carry out inference (classification and regression). This monograph provides a self-contained i…
Probabilistic storage and retrieval (PSR) of unitary quantum dynamics is possible with exponentially small failure probability with respect to the number of systems used as a quantum memory [PRL 122, 170502 (2019)]. Here we study improvements due to a priori knowledge about the unitary transformation to be stored. In particular, we study $N \rightarrow 1$ PSR of qubit phase gates, i.e. qubit rotations a round $Z$ axis with an unknown angle, and show that if we access the gate only $N$-times, the optimal probability of perfect retrieving of its single use is $N/(N+1)$. We propose a quantum circ…
With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability $p$. The required computational overhead scales efficiently both with $1/p$ and $n$, where $n$ is the number of qubits in the computation. This approach provides an efficient way to combat noise in a class of quantum computation implementation schemes, where the dominant noise leads to probabilistic signaled errors with an error probability $1-p$ far beyond any thres…
Simulation of quantum matters is a significant application of quantum computers. In contrast to the unitary operation which can be realized naturally on a quantum computer, the implementation of nonunitary operation, widely used in classical approaches, needs special designing. Here, by application of Grover's algorithm, we extend the probabilistic method of implementing nonunitary operation and show that it can promote success probability without fidelity decreasing. This method can be applied to problems of imaginary time evolution and contraction of tensor networks on a quantum computer.
We establish bounds to the necessary resource consumption when building up cluster states for one-way computing using probabilistic gates. Emphasis is put on state preparation with linear optical gates, as the probabilistic character is unavoidable here. We identify rigorous general bounds to the necessary consumption of initially available maximally entangled pairs when building up one-dimensional cluster states with individually acting linear optical quantum gates, entangled pairs and vacuum modes. As the known linear optics gates have a limited maximum success probability, as we show, this …
We propose probabilistic controlled-NOT and controlled-phase gates for qubits stored in the polarization of photons. The gates are composed of linear optics and photon detectors, and consume polarization entangled photon pairs. The fraction of the successful operation is only limited by the efficiency of the Bell-state measurement. The gates work correctly under the use of imperfect detectors and lossy transmission of photons. Combined with single-qubit gates, they can be used for producing arbitrary polarization states and for designing various quantum measurements.
Probabilistic quantum cloning and identifying machines can be constructed via unitary-reduction processes [Duan and Guo, Phys. Rev. Lett. 80, 4999 (1998)]. Given the cloning (identifying) probabilities, we derive an explicit representation of the unitary evolution and corresponding Hamiltonian to realize probabilistic cloning (identification). The logic networks are obtained by decomposing the unitary representation into universal quantum logic operations. The robustness of the networks is also discussed. Our method is suitable for a $k$-partite system, such as quantum computer, and may be gen…
A simplification scheme of probabilistic teleportation of two-particle state of general form is given. By means of the primitive operations consisting of single-qubit gates, two-qubit controlled-not gates, Von Neumann measurement and classically controlled operations, we construct an efficient quantum logical network for implementing the new scheme of probabilistic teleportation of a two-particle state of general form.
The scheme for probabilistic teleportation of an N-particle state of general form is proposed. As the special cases we construct efficient quantum logic networks for implementing probabilistic teleportation of a two-particle state, a three-particle state and a four-particle state of general form, built from single qubit gates, two-qubit controlled-not gates, Von Neumann measurement and classically controlled operations.
We propose a gate optimization method, which we call variational quantum gate optimization (VQGO). VQGO is a method to construct a target multi-qubit gate by optimizing a parametrized quantum circuit which consists of tunable single-qubit gates with high fidelities and fixed multi-qubit gates with limited controlabilities. As an example, we apply the proposed scheme to the models relevant to superconducting qubit systems. We show in numerical simulations that the high-fidelity CNOT gate can be constructed with VQGO using cross-resonance gates with finite crosstalk. We also demonstrate that fas…
We propose a method for scaling trapped ions for large-scale quantum computation and communication based on a probabilistic ion-photon mapping. Deterministic quantum gates between remotely located trapped ions can be achieved through detection of spontaneously-emitted photons, accompanied by the local Coulomb interaction between neighboring ions. We discuss gate speeds and tolerance to experimental noise for different probabilistic entanglement schemes.
We propose a new measure of non-classicality of quantum gates which is particularly suitable for probabilistic devices. This measure enables to compare, e.g., deterministic devices which prepare entangled states with low amount of entanglement with probabilistic devices which generate highly entangled states but which fail sometimes. We provide examples demonstrating advantages of this new measure over the so far employed entangling power.
We present simplification schemes for probabilistic and controlled teleportation of the unknown quantum states of both one-particle and two-particle and construct efficient quantum logic networks for implementing the new schemes by means of the primitive operations consisting of single-qubit gates, two-qubit controlled-not gates, Von Neumann measurement and classically controlled operations. In these schemes the teleportation are not always successful but with certain probability.
Recently it has been shown that Repeat-Until-Success (RUS) circuits can approximate a given single-qubit unitary with an expected number of $T$ gates of about $1/3$ of what is required by optimal, deterministic, ancilla-free decompositions over the Clifford+$T$ gate set. In this work, we introduce a more general and conceptually simpler circuit decomposition method that allows for synthesis into protocols that probabilistically implement quantum circuits over several universal gate sets including, but not restricted to, the Clifford+$T$ gate set. The protocol, which we call Probabilistic Quant…
Pure quantum states are often approximately encoded as classical bit strings such as those representing probability amplitudes and those describing circuits that generate the quantum states. The crucial quantity is the minimum length of classical bit strings from which the original pure states are approximately reconstructible. We derive asymptotically tight bounds on the minimum bit length required for probabilistic encodings with which one can approximately reconstruct the original pure state as an ensemble of the quantum states encoded in classical strings. We also show that such a probabil…
A probabilistic imaginary-time evolution quantum algorithm for advection-diffusion equation: Explicit gate-level implementation and comparisons to quantum linear system algorithms
It is shown that the fault testing for quantum circuits does not follow conventional classical techniques. If probabilistic gate like Hadamard gate is included in a circuit then the classical notion of test vector is shown to fail. We have reported several new and distinguishing features of quantum fault and also presented a general methodology for detection of functional faults in a quantum circuit. The technique can generate test vectors for detection of different kinds of fault. Specific examples are given and time complexity of the proposed quantum fault detection algorithm is reported.
We clarify the connections between the erasure scheme of probabilistic CNOT gate implementation recently proposed by Pittman, Jacobs and Franson [Phys. Rev. A 64, 062311 (2001)] and quantum teleportation.
We assess the resources needed to identify a reversible quantum gate among a finite set of alternatives, including in our analysis both deterministic and probabilistic strategies. Among the probabilistic strategies we consider unambiguous gate discrimination, where errors are not tolerated but inconclusive outcomes are allowed, and we prove that parallel strategies are sufficient to unambiguously identify the unknown gate with minimum number of queries. This result is used to provide upper and lower bounds on the query complexity and on the minimum ancilla dimension. In addition, we introduce …
It has previously been shown that probabilistic quantum logic operations can be performed using linear optical elements, additional photons (ancilla), and post-selection based on the output of single-photon detectors. Here we describe the operation of several quantum logic operations of an elementary nature, including a quantum parity check and a quantum encoder, and we show how they can be combined to implement a controlled-NOT (CNOT) gate. All of these gates can be constructed using polarizing beam splitters that completely transmit one state of polarization and totally reflect the orthogona…
We propose a method to reliably and efficiently extract the fidelity of many-qubit quantum circuits composed of continuously parametrized two-qubit gates called matchgates. This method, which we call matchgate benchmarking, relies on advanced techniques from randomized benchmarking as well as insights from the representation theory of matchgate circuits. We argue the formal correctness and scalability of the protocol, and moreover deploy it to estimate the performance of matchgate circuits generated by two-qubit XY spin interactions on a quantum processor.
Imperial College London（伦敦帝国理工学院）；National University of Singapore（新加坡国立大学）；Centre for Quantum Technologies（量子科技中心）
To harness the potential of noisy intermediate-scale quantum devices, it is paramount to find the best type of circuits to run hybrid quantum-classical algorithms. Key candidates are parametrized quantum circuits that can be effectively implemented on current devices. Here, we evaluate the capacity and trainability of these circuits using the geometric structure of the parameter space via the effective quantum dimension, which reveals the expressive power of circuits in general as well as of particular initialization strategies. We assess the expressive power of various popular circuit types a…
Machine learning (ML) classification tasks can be carried out on a quantum computer (QC) using Probabilistic Quantum Memory (PQM) and its extension, Parameteric PQM (P-PQM) by calculating the Hamming distance between an input pattern and a database of $r$ patterns containing $z$ features with $a$ distinct attributes. For accurate computations, the feature must be encoded using one-hot encoding, which is memory-intensive for multi-attribute datasets with $a>2$. We can easily represent multi-attribute data more compactly on a classical computer by replacing one-hot encoding with label encoding. …
We show how to construct quantum gate arrays that can be programmed to perform different unitary operations on a data register, depending on the input to some program register. It is shown that a universal quantum gate array - a gate array which can be programmed to perform any unitary operation - exists only if one allows the gate array to operate in a probabilistic fashion. The universal quantum gate array we construct requires an exponentially smaller number of gates than a classical universal gate array.
Variational quantum algorithms, which utilize Parametrized Quantum Circuits (PQCs), are promising tools to achieve quantum advantage for optimization problems on near-term quantum devices. Their PQCs have been conventionally constructed from parametrized rotational angles of single-qubit gates around predetermined set of axes, and two-qubit entangling gates, such as CNOT gates. We propose a method to construct a PQC by continuous parametrization of both the angles and the axes of its single-qubit rotation gates. The method is based on the observation that when rotational angles are fixed, opti…
Motivated by recent progress in quantum technologies and in particular quantum software, research and industrial communities have been trying to discover new applications of quantum algorithms such as quantum optimization and machine learning. Regardless of which hardware platform these novel algorithms operate on, whether it is adiabatic or gate based, from theoretical point of view, they are performing drastically better than their classical counterparts. Two promising areas of quantum algorithms quantum machine learning and quantum optimization. These are based on performing matrix operatio…
We propose and analyze a probabilistic scheme to entangle two spatially separated topological qubits in a $p_{x}+ip_{y}$ superfluid using controlled collisions between atoms in movable dipole traps and unpaired atoms inside vortex cores in the superfluid. We discuss how to test the violation of Bell's inequality with the generated entanglement. A set of universal quantum gates is shown to be implementable \textit{deterministically} using the entanglement despite the fact that the entangled states can only be created probabilistically.
We demonstrate a probabilistic entangling quantum gate between two distant trapped ytterbium ions. The gate is implemented between the hyperfine "clock" state atomic qubits and mediated by the interference of two emitted photons carrying frequency encoded qubits. Heralded by the coincidence detection of these two photons, the gate has an average fidelity of 90+-2%. This entangling gate together with single qubit operations is sufficient to generate large entangled cluster states for scalable quantum computing.
We realize the probabilistic cloning and identifying linear independent quantum states of multi-particles system, given prior probability, with universal quantum logic gates using the method of unitary representation. Our result is universal for separate state and entanglement. We also provide the realization in the condition given $M$ initial copies for each state.
We propose a new way of implementing several elementary quantum gates for qubits in the coherent state basis. The operations are probabilistic and employ single photon subtractions as the driving force. Our schemes for single-qubit phase gate and two-qubit controlled phase gate are capable of achieving arbitrarily large phase shifts with currently available resources, which makes them suitable for the near-future tests of quantum information processing with superposed coherent states.
We present a computational circuit which realizes contextually the Tele-UNOT gate and the universal optimal quantum cloning machine (UOQCM). We report the experimental realization of the probabilistic UOQCM with polarization encoded qubits. This is achieved by combining on a symmetric beam-splitter the input qubit with an ancilla in a fully mixed state.
Quantum controlled-logic gates, including controlled NOT gate and Toffoli gate, play critical roles in lots of quantum information processing schemes. We design and experimentally demonstrate deterministic Toffoli gate by utilizing orbital-angular-momentum and polarization degrees of freedom of a single photon. In addition, we generate Bell states by using the controlled NOT gate. The effective conversion rate of the Toffoli gate in our experiment is $(95.1\pm3.2)\%$. Furthermore, our experimental setup does not require any auxiliary photons and probabilistic post selections.
We propose a general framework for quantum error mitigation that combines and generalizes two techniques: probabilistic error cancellation (PEC) and zero-noise extrapolation (ZNE). Similarly to PEC, the proposed method represents ideal operations as linear combinations of noisy operations that are implementable on hardware. However, instead of assuming a fixed level of hardware noise, we extend the set of implementable operations by noise scaling. By construction, this method encompasses both PEC and ZNE as particular cases and allows us to investigate a larger set of hybrid techniques. For ex…
In a large-scale quantum computer, the cost of communications will dominate the performance and resource requirements, place many severe demands on the technology, and constrain the architecture. Unfortunately, fault-tolerant computers based entirely on photons with probabilistic gates, though equipped with "built-in" communication, have very large resource overheads; likewise, computers with reliable probabilistic gates between photons or quantum memories may lack sufficient communication resources in the presence of realistic optical losses. Here, we consider a compromise architecture, in wh…
There is a recent surge of interest and insights regarding the interplay of quantum optimal control and variational quantum algorithms. We study the framework in the context of qudits which are, for instance, definable as controllable electromagnetic modes of a superconducting cavity system coupled to a transmon. By employing recent quantum optimal control approaches described in (Petersson and Garcia, 2021), we showcase control of single-qudit operations up to eight states, and two-qutrit operations, mapped respectively onto a single mode and two modes of the resonator. We discuss the results…
We introduce a Bayesian method for the estimation of single qubit errors in quantum devices, and use it to characterize these errors on three 27-qubit superconducting qubit devices. We self-consistently estimate up to seven parameters of each qubit's state preparation, readout, and gate errors, analyze the stability of these errors as a function of time, and demonstrate easily implemented approaches for mitigating different errors before a quantum computation experiment. On the investigated devices we find non-negligible qubit reset errors that cannot be parametrized as a diagonal mixed state,…
Quantum teleportation is a powerful protocol with applications in several schemes of quantum communication, quantum cryptography and quantum computing. The present work shows the required conditions for a two-qubit quantum gate to be deterministically and probabilistically teleported by a quantum gate teleportation scheme using different basis of measurement. Additionally, we present examples of teleportation of two-qubit gates that do not belong to Clifford group as well the limitations of the quantum gate teleportation scheme employing a four-qubit state with genuine four-way entanglement.
