Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userDemonstrating a Continuous Set of Two-qubit Gates for Near-term Quantum Algorithms
77
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Quantum algorithms offer a dramatic speedup for computational problems in machine learning, material science, and chemistry. However, any near-term realizations of these algorithms will need to be heavily optimized to fit within the finite resources offered by existing noisy quantum hardware. Here, taking advantage of the strong adjustable coupling of gmon qubits, we demonstrate a continuous two-qubit gate set that can provide a 3x reduction in circuit depth as compared to a standard decomposition. We implement two gate families: an iSWAP-like gate to attain an arbitrary swap angle, $theta$, and a CPHASE gate that generates an arbitrary conditional phase, $phi$. Using one of each of these gates, we can perform an arbitrary two-qubit gate within the excitation-preserving subspace allowing for a complete implementation of the so-called Fermionic Simulation, or fSim, gate set. We benchmark the fidelity of the iSWAP-like and CPHASE gate families as well as 525 other fSim gates spread evenly across the entire fSim($theta$, $phi$) parameter space achieving purity-limited average two-qubit Pauli error of $3.8 times 10^{-3}$ per fSim gate.
rate research
Read More
Quantum algorithms require a universal set of gates that can be implemented in a physical system. For these, an optimal decomposition into a sequence of available operations is desired. Here, we present a method to find such sequences for a small-scale ion trap quantum information processor. We further adapt the method to state preparation and quantum algorithms with in-sequence measurements.
We operate a superconducting quantum processor consisting of two tunable transmon qubits coupled by a swapping interaction, and equipped with non destructive single-shot readout of the two qubits. With this processor, we run the Grover search algorithm among four objects and find that the correct answer is retrieved after a single run with a success probability between 0.52 and 0.67, significantly larger than the 0.25 achieved with a classical algorithm. This constitutes a proof-of-concept for the quantum speed-up of electrical quantum processors.
Efficient sampling from a classical Gibbs distribution is an important computational problem with applications ranging from statistical physics over Monte Carlo and optimization algorithms to machine learning. We introduce a family of quantum algorithms that provide unbiased samples by preparing a state encoding the entire Gibbs distribution. We show that this approach leads to a speedup over a classical Markov chain algorithm for several examples including the Ising model and sampling from weighted independent sets of two different graphs. Our approach connects computational complexity with phase transitions, providing a physical interpretation of quantum speedup. Moreover, it opens the door to exploring potentially useful sampling algorithms on near-term quantum devices as the algorithm for sampling from independent sets on certain graphs can be naturally implemented using Rydberg atom arrays.
Solving linear systems of equations is essential for many problems in science and technology, including problems in machine learning. Existing quantum algorithms have demonstrated the potential for large speedups, but the required quantum resources are not immediately available on near-term quantum devices. In this work, we study near-term quantum algorithms for linear systems of equations of the form $Ax = b$. We investigate the use of variational algorithms and analyze their optimization landscapes. There exist types of linear systems for which variational algorithms designed to avoid barren plateaus, such as properly-initialized imaginary time evolution and adiabatic-inspired optimization, suffer from a different plateau problem. To circumvent this issue, we design near-term algorithms based on a core idea: the classical combination of variational quantum states (CQS). We exhibit several provable guarantees for these algorithms, supported by the representation of the linear system on a so-called Ansatz tree. The CQS approach and the Ansatz tree also admit the systematic application of heuristic approaches, including a gradient-based search. We have conducted numerical experiments solving linear systems as large as $2^{300} times 2^{300}$ by considering cases where we can simulate the quantum algorithm efficiently on a classical computer. These experiments demonstrate the algorithms ability to scale to system sizes within reach in near-term quantum devices of about $100$-$300$ qubits.
The capacity of a quantum gate to produce entangled states on a bipartite system is quantified in terms of the entangling power. This quantity is defined as the average of the linear entropy of entanglement of the states produced after applying a quantum gate over the whole set of separable states. Here we focus on symmetric two-qubit quantum gates, acting on the symmetric two-qubit space, and calculate the entangling power in terms of the appropriate local-invariant. A geometric description of the local equivalence classes of gates is given in terms of the $mathfrak{su}(3)$ Lie algebra root vectors. These vectors define a primitive cell with hexagonal symmetry on a plane, and through the Weyl group the minimum area on the plane containing the whole set of locally equivalent quantum gates is identified. We give conditions to determine when a given quantum gate produces maximally entangled states from separable ones (perfect entanglers). We found that these gates correspond to one fourth of the whole set of locally-distinct quantum gates. The theory developed here is applicable to three-level systems in general, where the non-locality of a quantum gate is related to its capacity to perform non-rigid transformations on the Majorana constellation of a state. The results are illustrated by an anisotropic Heisenberg model, the Lipkin-Meshkov-Glick model, and two coupled quantized oscillators with cross-Kerr interaction.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
