arXiv subjects

Sabre Kais

Publications and source records attributed to Sabre Kais.

At least 91 records · Page 5Linked to original sources

arXiv2022

Statistical Analysis on Random Quantum Sampling by Sycamore and Zuchongzhi Quantum Processors

Random quantum sampling, a task to sample bit-strings from a random quantum circuit, is considered one of suitable benchmark tasks to demonstrate the outperformance of quantum computers even with noisy qubits. Recently, random quantum sampling was performed on the Sycamore quantum processor with 53 qubits [Nature 574, 505 (2019)] and on the Zuchongzhi quantum processor with 56 qubits [Phys. Rev. Lett. 127, 180501 (2021)]. Here, we analyze and compare statistical properties of the outputs of random quantum sampling by Sycamore and Zuchongzhi. Using the Marchenko-Pastur law and the Wasssertein distances, we find that quantum random sampling of Zuchongzhi is more closer to classical uniform random sampling than those of Sycamore. Some Zuchongzhi's bit-strings pass the random number tests while both Sycamore and Zuchongzhi show similar patterns in heatmaps of bit-strings. It is shown that statistical properties of both random quantum samples change little as the depth of random quantum circuits increases. Our findings raise a question about computational reliability of noisy quantum processors that could produce statistically different outputs for the same random quantum sampling task.

quant-ph↗

arXiv2022

The unitary dependence theory for understanding quantum circuits and states

We develop a unitary dependence theory to characterize the behaviors of quantum circuits and states in terms of how quantum gates manipulate qubits and determine their measurement probabilities. A qubit has dependence on a 1-qubit unitary gate if its measurement probabilities depend on the parameters of the gate. A 1-qubit unitary creates such a dependence onto the target qubit, and a CNOT gate copies all the dependences from the control qubit to the target qubit. The complete dependence picture of the output state details the connections qubits may have when being manipulated or measured. Compared to the conventional entanglement description of quantum circuits and states, the dependence picture offers more practical information, easier generalization to many-qubit systems, and better robustness upon partitioning of the system. The unitary dependence theory is a useful tool for understanding quantum circuits and states that is based on the practical ideas of how manipulations and measurements are affected by elementary gates.

quant-ph↗

arXiv2022

Geometrical picture of the electron-electron correlation at the large-D limit

In electronic structure calculations, the correlation energy is defined as the difference between the mean field and the exact solution of the non relativistic Schrödinger equation. Such an error in the different calculations is not directly observable as there is no simple quantum mechanical operator, apart from correlation functions, that correspond to such quantity. Here, we use the dimensional scaling approach, in which the electrons are localized at the large-dimensional scaled space, to describe a geometric picture of the electronic correlation. Both, the mean field, and the exact solutions at the large-D limit have distinct geometries. Thus, the difference might be used to describe the correlation effect. Moreover, correlations can be also described and quantified by the entanglement between the electrons, which is a strong correlation without a classical analog. Entanglement is directly observable and it is one of the most striking properties of quantum mechanics and bounded by the area law for local gapped Hamiltonians of interacting many-body systems. This study opens up the possibility of presenting a geometrical picture of the electron-electron correlations and might give a bound on the correlation energy. The results at the large-D limit and at D=3 indicate the feasibility of using the geometrical picture to get a bound on the electron-electron correlations.

quant-ph↗

arXiv2022

Finite-Size Scaling on a Digital Quantum Simulator using Quantum Restricted Boltzmann Machine

The critical point and the critical exponents for a phase transition can be determined using the Finite-Size Scaling (FSS) analysis. This method assumes that the phase transition occurs only in the infinite size limit. However, there has been a lot of interest recently in quantum phase transitions occuring in finite size systems such as a single two-level system interacting with a single bosonic mode e.g. in the Quantum Rabi Model (QRM). Since, these phase transitions occur at a finite system size, the traditional FSS method is rendered inapplicable for these cases. For cases like this, we propose an alternative FSS method in which the truncation of the system is done in the Hilbert space instead of the physical space. This approach has previously been used to calculate the critical parameters for stability and symmetry breaking of electronic structure configurations of atomic and molecular systems. We calculate the critical point for the quantum phase transition of the QRM using this approach. We also provide a protocol to implement this method on a digital quantum simulator using the Quantum Restricted Boltzmann Machine algorithm. Our work opens up a new direction in the study of quantum phase transitions on quantum devices.

quant-ph↗

arXiv2021

Realization of Heisenberg models of spin systems with polar molecules in pendular states

We show that ultracold polar diatomic or linear molecules, oriented in an external electric field and mutually coupled by dipole-dipole interactions, can be used to realize the exact Heisenberg XYZ, XXZ and XY models without invoking any approximation. The two lowest lying excited pendular states coupled by microwave or radio-frequency fields are used to encode the pseudo-spin. We map out the general features of the models by evaluating the models' constants as functions of the molecular dipole moment, rotational constant, strength and direction of the external field as well as the distance between molecules. We calculate the phase diagram for a linear chain of polar molecules based on the Heisenberg models and discuss their drawbacks, advantages, and potential applications.

quant-ph↗

arXiv2021

Variational quantum circuits to prepare low energy symmetry states

We explore how to build quantum circuits that compute the lowest energy state corresponding to a given Hamiltonian within a Symmetry subspace by explicitly encoding it into the circuit. We create an explicit unitary and a variationally trained unitary that maps any vector output by ansatz A(~α) from a defined subspace to a vector in the symmetry space. The parameters are trained varitionally to minimize the energy thus keeping the output within the labelled symmetry value. The method was tested for a spin XXZ hamiltonian using rotation and reflection symmetry and H2 hamiltonian within S_z = 0 subspace using S^2 symmetry. We have found the variationally trained unitary surprisingly giving very good results with very low depth circuits and can thus be used to prepare symmetry states within near term quantum computers.

quant-ph↗

arXiv2021

The quantum condition space

In this work we first propose to exploit the fundamental properties of quantum physics to evaluate the probability of events with projection measurements. Next, to study what events can be specified by quantum methods, we introduce the concept of the condition space, which is found to be the dual space of the classical outcome space of bit strings. Just like the classical outcome space generates the quantum state space, the condition space generates the quantum condition space that is the central idea of this work. The quantum condition space permits the existence of entangled conditions that have no classical equivalent. In addition, the quantum condition space is related to the quantum state space by a Fourier transform guaranteed by the Pontryagin duality, and therefore an entropic uncertainty principle can be defined. The quantum condition space offers a novel perspective of understanding quantum states with the duality picture. In addition, the quantum conditions have physical meanings and realizations of their own and thus may be studied for purposes beyond the original motivation of characterizing events for probability evaluation. Finally, the relation between the condition space and quantum circuits provides insights into how quantum states are collectively modified by quantum gates, which may lead to deeper understanding of the complexity of quantum circuits.

quant-ph↗

arXiv2021

Quantum Machine-Learning for Eigenstate Filtration in Two-Dimensional Materials

Quantum machine learning algorithms have emerged to be a promising alternative to their classical counterparts as they leverage the power of quantum computers. Such algorithms have been developed to solve problems like electronic structure calculations of molecular systems and spin models in magnetic systems. However the discussion in all these recipes focus specifically on targeting the ground state. Herein we demonstrate a quantum algorithm that can filter any energy eigenstate of the system based on either symmetry properties or on a predefined choice of the user. The work horse of our technique is a shallow neural network encoding the desired state of the system with the amplitude computed by sampling the Gibbs- Boltzmann distribution using a quantum circuit and the phase information obtained classically from the non-linear activation of a separate set of neurons. We show that the resource requirements of our algorithm is strictly quadratic. To demonstrate its efficacy, we use state-filtration in monolayer transition metal-dichalcogenides which are hitherto unexplored in any flavor of quantum simulations. We implement our algorithm not only on quantum simulators but also on actual IBM-Q quantum devices and show good agreement with the results procured from conventional electronic structure calculations. We thus expect our protocol to provide a new alternative in exploring band-structures of exquisite materials to usual electronic structure methods or machine learning techniques which are implementable solely on a classical computer

physics.chem-ph↗

arXiv2021

Non-Randomness of Google's Quantum Supremacy Benchmark

The first achievement of quantum supremacy has been claimed recently by Google for the random quantum circuit benchmark with 53 superconducting qubits. Here, we analyze the randomness of Google's quantum random-bit sampling. The heat maps of Google's random bit-strings show stripe patterns at specific qubits in contrast to the Haar-measure or classical random-bit strings. Google's data contains more bit 0 than bit 1, i.e., about 2.8\% difference, and fail to pass the NIST random number tests, while the Haar-measure or classical random-bit samples pass. Their difference is also illustrated by the Marchenko-Pastur distribution and the Girko circular law of random matrices of random bit-strings. The calculation of the Wasserstein distances shows that Google's random bit-strings are farther away from the Haar-measure random bit-strings than the classical random bit-strings. Our results imply that random matrices and the Wasserstein distance could be new tools for analyzing the performance of quantum computers.

quant-ph↗

arXiv2021

A Universal Quantum Circuit Design for Periodical Functions

We propose a universal quantum circuit design that can estimate any arbitrary one-dimensional periodic functions based on the corresponding Fourier expansion. The quantum circuit contains N-qubits to store the information on the different N-Fourier components and $M+2$ auxiliary qubits with $M = \lceil{\log_2{N}}\rceil$ for control operations. The desired output will be measured in the last qubit $q_N$ with a time complexity of the computation of $O(N^2\lceil \log_2N\rceil^2)$. We illustrate the approach by constructing the quantum circuit for the square wave function with accurate results obtained by direct simulations using the IBM-QASM simulator. The approach is general and can be applied to any arbitrary periodic function.

quant-ph↗

arXiv2021

Prime Factorization Using Quantum Variational Imaginary Time Evolution

The road to computing on quantum devices has been accelerated by the promises that come from using Shor's algorithm to reduce the complexity of prime factorization. However, this promise hast not yet been realized due to noisy qubits and lack of robust error correction schemes. Here we explore a promising, alternative method for prime factorization that uses well-established techniques from variational imaginary time evolution. We create a Hamiltonian whose ground state encodes the solution to the problem and use variational techniques to evolve a state iteratively towards these prime factors. We show that the number of circuits evaluated in each iteration scales as O(n^{5}d), where n is the bit-length of the number to be factorized and $d$ is the depth of the circuit. We use a single layer of entangling gates to factorize several numbers represented using 7, 8, and 9-qubit Hamiltonians. We also verify the method's performance by implementing it on the IBMQ Lima hardware.

quant-ph↗

arXiv2021

Statistical correlation between quantum entanglement and spin-orbit coupling in crossed beam molecular dynamics

Non-classical features like interference is already being harnessed to control the output of chemical reactions. However quantum entanglement which is an equally enigmatic many-body quantum correlation can also be used as a powerful resource yet have eluded explicit attention. In this report, we propose an experimental scheme under the crossed beam molecular dynamical setup, with the F+HD reaction, aiming to study the possible influence of entanglement within reactant pairs on the angular features of the product distribution. The aforesaid reaction has garnered interest recently as an unusual horseshoe shape pattern in the product (HF) distribution was observed, which has been attributed to the coupling of spin and orbital degrees of freedom. We propose an experimental scheme aiming to study the possible influence of entanglement on the necessity for the inclusion of such spin-orbit characteristics, under circumstances wherein the existence of entanglement and spin-orbit interaction is simultaneously detectable. We further numerically simulate the attainable results highlighting specific patterns corresponding to various possibilities. Such studies if extended can provide unforeseen mechanistic insight in analogous reactions too from the lens of quantum information.

quant-ph↗

arXiv2021

Constructive Quantum Interference in a Photo-Chemical Reaction of $^{87}$Rb Bose Einstein Condensate

Interferences emerge when multiple pathways coexist together leading towards the same result. A Recent study by Blasing and coworkers [PRL 121(7):073202] showed that in a photo-association reaction of Raman dressed spin orbit coupled $^{87}$Rb Bose Einstein Condensate when the reactant spin state is prepared in a coherent superposition of multiple bare spin states it leads to a destructive interference between reaction pathways. Here we report a theoretical study for a reaction scheme which leads to constructive quantum interference. This is achieved by changing the reactive scattering channel in the reaction. As the origin of coherent control comes from the spin part of the wavefunction it is sufficient to use radio frequency coupling to achieve the superposition state. Our results show that interferences can be used as a resource for the coherent control of photo-chemical reactions. The approach is general and can be employed to study a wide spectra of chemical reactions in the ultracold regime.

quant-ph↗

arXiv2021

Convergence of reconstructed density matrix to a pure state using maximal entropy approach

Impressive progress has been made in the past decade in the study of technological applications of varied types of quantum systems. With industry giants like IBM laying down their roadmap for scalable quantum devices with more than 1000-qubits by the end of 2023, efficient validation techniques are also being developed for testing quantum processing on these devices. The characterization of a quantum state is done by experimental measurements through the process called quantum state tomography (QST) which scales exponentially with the size of the system. However, QST performed using incomplete measurements is aptly suited for characterizing these quantum technologies especially with the current nature of noisy intermediate-scale quantum (NISQ) devices where not all mean measurements are available with high fidelity. We, hereby, propose an alternative approach to QST for the complete reconstruction of the density matrix of a quantum system in a pure state for any number of qubits by applying the maximal entropy formalism on the pairwise combinations of the known mean measurements. This approach provides the best estimate of the target state when we know the complete set of observables which is the case of convergence of the reconstructed density matrix to a pure state. Our goal is to provide a practical inference of a quantum system in a pure state that can find its applications in the field of quantum error mitigation on a real quantum computer that we intend to investigate further.

quant-ph↗

arXiv2021

Dimensional Interpolation for Random Walk

We employ a simple and accurate dimensional interpolation formula for the shapes of random walks at $D=3$ and $D=2$ based on the analytically known solutions at both limits $D=\infty$ and $D=1$. The results obtained for the radii of gyration of an arbitrary shaped object are about $2\%$ error compared with accurate numerical results at $D = 3$ and $D = 2$. We also calculated the asphericity for a three-dimensional random walk using the dimensional interpolation formula. Result agrees very well with the numerically simulated result. The method is general and can be used to estimate other properties of random walks.

cond-mat.stat-mech↗

arXiv2021

Quantum Cluster Algorithm for Data classification

We present a quantum algorithm for data classification based on the nearest-neighbor learning algorithm. The classification algorithm is divided into two steps: Firstly, data in the same class is divided into smaller groups with sublabels assisting building boundaries between data with different labels. Secondly we construct a quantum circuit for classification that contains multi control gates. The algorithm is easy to implement and efficient in predicting the labels of test data. To illustrate the power and efficiency of this approach, we construct the phase transition diagram for the metal-insulator transition of $VO_2$, using limited trained experimental data, where $VO_2$ is a typical strongly correlated electron materials, and the metallic-insulating phase transition has drawn much attention in condensed matter physics. Moreover, we demonstrate our algorithm on the classification of randomly generated data and the classification of entanglement for various Werner states, where the training sets can not be divided by a single curve, instead, more than one curves are required to separate them apart perfectly. Our preliminary result shows considerable potential for various classification problems, particularly for constructing different phases in materials.

quant-ph↗

arXiv2021

A practical quantum encryption protocol with varying encryption configurations

Quantum communication is an important application that derives from the burgeoning field of quantum information and quantum computation. Focusing on secure communication, quantum cryptography has two major directions of development, namely quantum key distribution and quantum encryption. In this work we propose a quantum encryption protocol that utilizes a quantum algorithm to create blocks of ciphertexts based on quantum states. The main feature of our quantum encryption protocol is that the encryption configuration of each block is determined by the previous blocks, such that additional security is provided. We then demonstrate our method by an example model encrypting the English alphabet, with numerical simulation results showing the large error rate of a mock attack by a potential adversary. With possible future improvements in mind, our quantum encryption protocol is a capable addition to the toolbox of quantum cryptography.

quant-ph↗

arXiv2021

Implementation of Quantum Machine Learning for Electronic Structure Calculations of Periodic Systems on Quantum Computing Devices

Quantum machine learning algorithms, the extensions of machine learning to quantum regimes, are believed to be more powerful as they leverage the power of quantum properties. Quantum machine learning methods have been employed to solve quantum many-body systems and have demonstrated accurate electronic structure calculations of lattice models, molecular systems, and recently periodic systems. A hybrid approach using restricted Boltzmann machines and a quantum algorithm to obtain the probability distribution that can be optimized classically is a promising method due to its efficiency and ease of implementation. Here we implement the benchmark test of the hybrid quantum machine learning on the IBM-Q quantum computer to calculate the electronic structure of typical 2-dimensional crystal structures: hexagonal-Boron Nitride and graphene. The band structures of these systems calculated using the hybrid quantum machine learning are in good agreement with those obtained by the conventional electronic structure calculation. This benchmark result implies that the hybrid quantum machine learning, empowered by quantum computers, could provide a new way of calculating the electronic structures of quantum many-body systems.

physics.comp-ph↗