SearcharxivSearch

arXiv subjects

Ehsan Zahedinejad

Publications and source records attributed to Ehsan Zahedinejad.

11 recordsLinked to original sources

Quantum Multiple Kernel Learning

Kernel methods play an important role in machine learning applications due to their conceptual simplicity and superior performance on numerous machine learning tasks. Expressivity of a machine learning model, referring to the ability of the model to approximate complex functions, has a significant influence on its performance in these tasks. One approach to enhancing the expressivity of kernel machines is to combine multiple individual kernels to arrive at a more expressive combined kernel. This approach is referred to as multiple kernel learning (MKL). In this work, we propose an MKL method we refer to as quantum MKL, which combines multiple quantum kernels. Our method leverages the power of deterministic quantum computing with one qubit (DQC1) to estimate the combined kernel for a set of classically intractable individual quantum kernels. The combined kernel estimation is achieved without explicitly computing each individual kernel, while still allowing for the tuning of individual kernels in order to achieve better expressivity. Our simulations on two binary classification problems---one performed on a synthetic dataset and the other on a German credit dataset---demonstrate the superiority of the quantum MKL method over single quantum kernel machines.

quant-ph

Adiabatic Quantum Kitchen Sinks for Learning Kernels Using Randomized Features

Quantum information processing is likely to have far-reaching impact in the field of artificial intelligence. While the race to build an error-corrected quantum computer is ongoing, noisy, intermediate-scale quantum (NISQ) devices provide an immediate platform for exploring a possible quantum advantage through hybrid quantum--classical machine learning algorithms. One example of such a hybrid algorithm is "quantum kitchen sinks", which builds upon the classical algorithm known as "random kitchen sinks" to leverage a gate model quantum computer for machine learning applications. We propose an alternative algorithm called "adiabatic quantum kitchen sinks", which employs an adiabatic quantum device to transform data features into new features in a non-linear manner, which can then be employed by classical machine learning algorithms. We present the effectiveness of our algorithm for performing binary classification on both a synthetic dataset and a real-world dataset. In terms of classification accuracy, our algorithm significantly enhances the performance of a classical linear classifier on the studied binary classification tasks and can potentially be implemented on a current adiabatic quantum device to solve practical problems.

quant-ph

Quantum control for high-fidelity multi-qubit gates

Quantum control for error correction is critical for the practical use of quantum computers. We address quantum optimal control for single-shot multi-qubit gates by framing as a feasibility problem for the Hamiltonian model and then solving with standard global-optimization software. Our approach yields faster high-fidelity ($>$99.99\%) single-shot three-qubit-gate control than obtained previously, and our method has enabled us to solve the quantum-control problem for a fast high-fidelity four-qubit gate.

quant-ph

Multi-Community Detection in Signed Graphs Using Quantum Hardware

Signed graphs serve as a primary tool for modelling social networks. They can represent relationships between individuals (i.e., nodes) with the use of signed edges. Finding communities in a signed graph is of great importance in many areas, for example, targeted advertisement. We propose an algorithm to detect multiple communities in a signed graph. Our method reduces the multi-community detection problem to a quadratic binary unconstrained optimization problem and uses state-of-the-art quantum or classical optimizers to find an optimal assignment of each individual to a specific community.

quant-ph

Combinatorial Optimization on Gate Model Quantum Computers: A Survey

The advent of quantum computing processors with possibility to scale beyond experimental capacities magnifies the importance of studying their applications. Combinatorial optimization problems can be one of the promising applications of these new devices. These problems are recurrent in industrial applications and they are in general difficult for classical computing hardware. In this work, we provide a survey of the approaches to solving different types of combinatorial optimization problems, in particular quadratic unconstrained binary optimization (QUBO) problems on a gate model quantum computer. We focus mainly on four different approaches including digitizing the adiabatic quantum computing, global quantum optimization algorithms, the quantum algorithms that approximate the ground state of a general QUBO problem, and quantum sampling. We also discuss the quantum algorithms that are custom designed to solve certain types of QUBO problems.

quant-ph

Free energy-based reinforcement learning using a quantum processor

Recent theoretical and experimental results suggest the possibility of using current and near-future quantum hardware in challenging sampling tasks. In this paper, we introduce free energy-based reinforcement learning (FERL) as an application of quantum hardware. We propose a method for processing a quantum annealer's measured qubit spin configurations in approximating the free energy of a quantum Boltzmann machine (QBM). We then apply this method to perform reinforcement learning on the grid-world problem using the D-Wave 2000Q quantum annealer. The experimental results show that our technique is a promising method for harnessing the power of quantum sampling in reinforcement learning tasks.

cs.LG

Learning in Quantum Control: High-Dimensional Global Optimization for Noisy Quantum Dynamics

Quantum control is valuable for various quantum technologies such as high-fidelity gates for universal quantum computing, adaptive quantum-enhanced metrology, and ultra-cold atom manipulation. Although supervised machine learning and reinforcement learning are widely used for optimizing control parameters in classical systems, quantum control for parameter optimization is mainly pursued via gradient-based greedy algorithms. Although the quantum fitness landscape is often compatible with greedy algorithms, sometimes greedy algorithms yield poor results, especially for large-dimensional quantum systems. We employ differential evolution algorithms to circumvent the stagnation problem of non-convex optimization. We improve quantum control fidelity for noisy system by averaging over the objective function. To reduce computational cost, we introduce heuristics for early termination of runs and for adaptive selection of search subspaces. Our implementation is massively parallel and vectorized to reduce run time even further. We demonstrate our methods with two examples, namely quantum phase estimation and quantum gate design, for which we achieve superior fidelity and scalability than obtained using greedy algorithms.

cs.LG

Designing High-Fidelity Single-Shot Three-Qubit Gates: A Machine Learning Approach

Three-qubit quantum gates are key ingredients for quantum error correction and quantum information processing. We generate quantum-control procedures to design three types of three-qubit gates, namely Toffoli, Controlled-Not-Not and Fredkin gates. The design procedures are applicable to a system comprising three nearest-neighbor-coupled superconducting artificial atoms. For each three-qubit gate, the numerical simulation of the proposed scheme achieves 99.9% fidelity, which is an accepted threshold fidelity for fault-tolerant quantum computing. We test our procedure in the presence of decoherence-induced noise as well as show its robustness against random external noise generated by the control electronics. The three-qubit gates are designed via the machine learning algorithm called Subspace-Selective Self-Adaptive Differential Evolution (SuSSADE).

quant-ph

High-Fidelity Single-Shot Toffoli Gate via Quantum Control

A single-shot Toffoli, or controlled-controlled-NOT, gate is desirable for classical and quantum information processing. The Toffoli gate alone is universal for reversible computing and, accompanied by the Hadamard gate, forms a universal gate set for quantum computing. The Toffoli gate is also a key ingredient for (non-topological) quantum error correction. Currently Toffoli gates are achieved by decomposing into sequentially implemented single- and two-qubit gates, which requires much longer times and yields lower overall fidelities compared to a single-shot implementation. We develop a quantum-control procedure to construct a single-shot Toffoli gate for three nearest-neighbor-coupled superconducting transmon systems such that the fidelity is 99.9% and is as fast as an entangling two-qubit gate under the same realistic conditions. The gate is achieved by a non-greedy quantum control procedure using our enhanced version of the Differential Evolution algorithm.

quant-ph

Evolutionary Algorithms for Hard Quantum Control

Although quantum control typically relies on greedy (local) optimization, traps (irregular critical points) in the control landscape can make optimization hard by foiling local search strategies. We demonstrate the failure of greedy algorithms to realize two fast quantum computing gates: a qutrit phase gate and a controlled-not gate. Then we show that our evolutionary algorithm circumvents the trap to deliver effective quantum control in both instances. Even when greedy algorithms succeed, our evolutionary algorithm delivers a superior control procedure because less time resolution is required for the control sequence.

quant-ph

Quantum Storage and Retrieval of Light by Sweeping the Atomic Frequency

We propose a quantum memory protocol based on dynamically changing the resonance frequency of an ensemble of two-level atoms. By sweeping the atomic frequency in an adiabatic fashion, photons are reversibly transferred into atomic coherences. We present a polaritonic description for this type of storage, which shares some similarities with Electromagnetically Induced Transparency (EIT) based quantum memories. On the other hand the proposed memory is also linked to the Gradient Echo Memory (GEM) due to the effective spatial gradient that pulses experience in the medium. We discuss a possible implementation of the protocol in hollow-core photonic crystal fibers.

quant-ph