Datasets:

Ken4070TiS

/

qubit_arXiv

like 0

Scalable Quantum Simulations of Scattering in Scalar Field Theory on 120 Qubits

Simulations of collisions of fundamental particles on a quantum computer are expected to have an exponential advantage over classical methods and promise to enhance searches for new physics. Furthermore, scattering in scalar field theory has been shown to be BQP-complete, making it a representative problem for which quantum computation is efficient. As a step toward large-scale quantum simulations of collision processes, scattering of wavepackets in one-dimensional scalar field theory is simulated using 120 qubits of IBM's Heron superconducting quantum computer ibm_fez. Variational circuits compressing vacuum preparation, wavepacket initialization, and time evolution are determined using classical resources. By leveraging physical properties of states in the theory, such as symmetries and locality, the variational quantum algorithm constructs scalable circuits that can be used to simulate arbitrarily-large system sizes. A new strategy is introduced to mitigate errors in quantum simulations, which enables the extraction of meaningful results from circuits with up to 4924 two-qubit gates and two-qubit gate depths of 103. The effect of interactions is clearly seen, and is found to be in agreement with classical Matrix Product State simulations. The developments that will be necessary to simulate high-energy inelastic collisions on a quantum computer are discussed.

2411.02486v1

Experimental demonstration of the Bell-type inequalities for four qubit Dicke state using IBM Quantum Processing Unit

Violation of the Bell-type inequalities is very necessary to confirm the existence of the nonlocality in the nonclassical (entangled) states. We have designed a customized operator which is made of the sum of the identity and Pauli matrices ($I$, $\sigma_x$, $\sigma_y$, and $\sigma_z$). We theoretically evaluate the Bell-type violation for the two-qubit Bell state and a four-qubit Dicke state, which gives the Bell-CHSH parameter values $2\sqrt{2}$ and $3.05$, respectively for our customized operator. For experimental implementation, IBM's 127-qubitQuantum Processing Units (QPU) were utilized, where we have applied our customized operator to evaluate Bell-type inequalities for two-qubit Bell state ($\vert\Phi^+\rangle$) and four-qubit Dicke state ($|D^{(2)}_4\rangle$). We observed, for the two-qubit Bell state, the experimental Bell violation was $2.7507\pm 0.0197$. For Dicke state, we found the violation be to $2.1239\pm0.0457$ and $2.2175\pm0.0352$ respectively for two distinct methods of state preparation. All our results show clear violation of the local realism; however, we find that the experimental violation of the Bell state ($2.75$) is close to the theoretical ($2.82$) results due to lower circuit depth in state-preparation as well as fewer measurements, while the Dicke state shows greater errors ($2.12$ and $2.21$ vs. $3.05$) from higher depth and more measurements.

2410.20241v1

Measuring error rates of mid-circuit measurements

High-fidelity mid-circuit measurements, which read out the state of specific qubits in a multiqubit processor without destroying them or disrupting their neighbors, are a critical component for useful quantum computing. They enable fault-tolerant quantum error correction, dynamic circuits, and other paths to solving classically intractable problems. But there are almost no methods to assess their performance comprehensively. We address this gap by introducing the first randomized benchmarking protocol that measures the rate at which mid-circuit measurements induce errors in many-qubit circuits. Using this protocol, we detect and eliminate previously undetected measurement-induced crosstalk in a 20-qubit trapped-ion quantum computer. Then, we use the same protocol to measure the rate of measurement-induced crosstalk error on a 27-qubit IBM Q processor, and quantify how much of that error is eliminated by dynamical decoupling.

2410.16706v1

Cost-Effective Realization of n-Bit Toffoli Gates for IBM Quantum Computers Using the Bloch Sphere Approach and IBM Native Gates

A cost-effective n-bit Toffoli gate is proposed to be realized (or transpiled) based on the layouts (linear, T-like, and I-like) and the number of n physical qubits for IBM quantum computers. This proposed gate is termed the "layout-aware n-bit Toffoli gate". The layout-aware n-bit Toffoli gate is designed using the visual approach of the Bloch sphere, from the visual representations of the rotational quantum operations for IBM native gates. In this paper, we also proposed a new formula for the quantum cost, which calculates the total number of native gates, the crossing connections, and the depth of the final transpiled quantum circuit. This formula is termed the "transpilation quantum cost". After transpilation, our proposed layout-aware n-bit Toffoli gate always has a much lower transpilation quantum cost than that of the conventional n-bit Toffoli gate, where 3 <= n <= 7 qubits, for different IBM quantum computers.

2410.13104v1

Implementing Quantum Secret Sharing on Current Hardware

Quantum secret sharing is a cryptographic scheme that enables a secure storage and reconstruction of quantum information. While the theory of secret sharing is mature in its development, relatively few studies have explored the performance of quantum secret sharing on actual devices. In this work, we provide a pedagogical description of encoding and decoding circuits for different secret sharing codes, and we test their performance on IBM's 127-qubit Brisbane system. We evaluate the quality of implementation by performing a SWAP test between the decoded state and the ideal one, as well as by estimating how well the code preserves entanglement with a reference system. Results indicate that a ((3,5)) threshold secret sharing scheme performs slightly better overall than a ((5,7)) scheme based on the SWAP test, but is outperformed by the Steane Code scheme in regards to the entanglement fidelity. We also investigate one implementation of a ((2,3)) qutrit scheme and find that it performs the worst of all, which is expected due to the additional number of multi-qubit gate operations needed to encode and decode qutrits.

2410.11640v1

QADL: Prototype of Quantum Architecture Description Language

Quantum Software (QSW) uses the principles of quantum mechanics, specifically programming quantum bits (qubits) that manipulate quantum gates, to implement quantum computing systems. QSW has become a specialized field of software development, requiring specific notations, languages, patterns, and tools for mapping the behavior of qubits and the structure of quantum gates to components and connectors of QSW architectures. To support declarative modeling of QSW, we aim to enable architecture-driven development, where software engineers can design, program, and evaluate quantum software systems by abstracting complex details through high-level components and connectors. We introduce QADL (Quantum Architecture Description Language), which provides a specification language, design space, and execution environment for architecting QSW. Inspired by classical ADLs, QADL offers (1) a graphical interface to specify and design QSW components, (2) a parser for syntactical correctness, and (3) an execution environment by integrating QADL with IBM Qiskit. The initial evaluation of QADL is based on usability assessments by a team of quantum physicists and software engineers, using quantum algorithms such as Quantum Teleportation and Grover's Search. QADL offers a pioneering specification language and environment for QSW architecture. A demo is available at https://youtu.be/xaplHH_3NtQ.

2410.19770v1

Tackling Coherent Noise in Quantum Computing via Cross-Layer Compiler Optimization

Quantum computing hardware is affected by quantum noise that undermine the quality of results of an executed quantum program. Amongst other quantum noises, coherent error that caused by parameter drifting and miscalibration, remains critical. While coherent error mitigation has been studied before, studies focused either on gate-level or pulse-level -- missing cross-level optimization opportunities; And most of them only target single-qubit gates -- while multi-qubit gates are also used in practice. To address above limitations, this work proposes a cross-layer approach for coherent error mitigation that considers program-level, gate-level, and pulse-level compiler optimizations, by leveraging the hidden inverse theory, and exploiting the structure inside different quantum programs, while also considering multi-qubit gates. We implemented our approach as compiler optimization passes, and integrated into IBM Qiskit framework. We tested our technique on real quantum computer (IBM-Brisbane), and demonstrated up to 92% fidelity improvements (45% on average), on several benchmarks.

2410.09664v1

Towards a benchmark for quantum computers based on an iterated post-selective protocol

Applying post selection in each step of an iterated protocol leads to sensitive quantum dynamics that may be utilized to test and benchmark current quantum computers. An example of this type of protocols was originally proposed for the task of matching an unknown quantum state to a reference state. We propose to employ the quantum state matching protocol for the purpose of testing and benchmarking quantum computers. In particular, we implement this scheme on freely available IBM superconducting quantum computers. By comparing measured values with the theoretical conditional probability of the single, final post-selected qubit, which is easy to calculate classically, we define a benchmark metric. Additionally, the standard deviation of the experimental results from their average serves as a secondary benchmark metric, characterizing fluctuations in the given device. A peculiar feature of the considered protocol is that there is a phase parameter of the initially prepared state, on which the resulting conditional probability should not depend. A careful analysis of the measured values indicates that its dependence on the initial phase can reveal useful information about coherent gate errors of the quantum device.

2410.07056v1

QCRMut: Quantum Circuit Random Mutant generator tool

Quantum computing has been on the rise in recent years, evidenced by a surge in publications on quantum software engineering and testing. Progress in quantum hardware has also been notable, with the introduction of impressive systems like Condor boasting 1121 qubits, and IBM Quantum System Two, which employs three 133-qubit Heron processors. As this technology edges closer to practical application, ensuring the efficacy of our software becomes imperative. Mutation testing, a well-established technique in classical computing, emerges as a valuable approach in this context. In our paper, we aim to introduce QCRMut, a mutation tool tailored for quantum programs, leveraging the inherent Quantum Circuit structure. We propose a randomised approach compared to previous works with exhaustive creation processes and the capability for marking immutable positions within the circuit. These features facilitate the preservation of program structure, which is crucial for future applications such as metamorphic testing.

2410.01415v1

Experimental demonstration of Robust Amplitude Estimation on near-term quantum devices for chemistry applications

This study explores hardware implementation of Robust Amplitude Estimation (RAE) on IBM quantum devices, demonstrating its application in quantum chemistry for one- and two-qubit Hamiltonian systems. Known for potentially offering quadratic speedups over traditional methods in estimating expectation values, RAE is evaluated under realistic noisy conditions. Our experiments provide detailed insights into the practical challenges associated with RAE. We achieved a significant reduction in sampling requirements compared to direct measurement techniques. In estimating the ground state energy of the hydrogen molecule, the RAE implementation demonstrated two orders of magnitude better accuracy for the two-qubit experiments and achieved chemical accuracy. These findings reveal its potential to enhance computational efficiencies in quantum chemistry applications despite the inherent limitations posed by hardware noise. We also found that its performance can be adversely impacted by coherent error and device stability and does not always correlate with the average gate error. These results underscore the importance of adapting quantum computational methods to hardware specifics to realize their full potential in practical scenarios.

2410.00686v1

Floquet evolution of the q-deformed \texorpdfstring{SU(3)${}_1$}{SU(3)1} Yang-Mills theory on a two-leg ladder

We simulate Floquet time-evolution of a truncated SU(3) lattice Yang-Mills theory on a two-leg ladder geometry under open boundary conditions using IBM's superconducting 156-qubit device ibm\_fez. To this end, we derive the quantum spin representation of the lattice Yang-Mills theory, and compose a quantum circuit carefully tailored to hard wares, reducing the use of CZ gates. Since it is still challenging to simulate Hamiltonian evolution in present noisy quantum processors, we make the step size in the Suzuki-Trotter decomposition very large, and simulate thermalization dynamics in Floquet circuit composed of the Suzuki-Trotter evolution. We demonstrate that IBM's Heron quantum processor can simulate, by error mitigation, Floqeut thermalization dynamics in a large system consisting of $62$ qubits. Our work would be a benchmark for further quantum simulations of lattice gauge theories using real devices.

2409.20263v1

Deep Circuit Compression for Quantum Dynamics via Tensor Networks

Dynamic quantum simulation is a leading application for achieving quantum advantage. However, high circuit depths remain a limiting factor on near-term quantum hardware. We present a compilation algorithm based on Matrix Product Operators for generating compressed circuits enabling real-time simulation on digital quantum computers, that for a given depth are more accurate than all Trotterizations of the same depth. By the efficient use of environment tensors, the algorithm is scalable in depth beyond prior work, and we present circuit compilations of up to 64 layers of $SU(4)$ gates. Surpassing only 1D circuits, our approach can flexibly target a particular quasi-2D gate topology. We demonstrate this by compiling a 52-qubit 2D Transverse-Field Ising propagator onto the IBM Heavy-Hex topology. For all circuit depths and widths tested, we produce circuits with smaller errors than all equivalent depth Trotter unitaries, corresponding to reductions in error by up to 4 orders of magnitude and circuit depth compressions with a factor of over 6.

2409.16361v1

Machine Learning Methods as Robust Quantum Noise Estimators

Access to quantum computing is steadily increasing each year as the speed advantage of quantum computers solidifies with the growing number of usable qubits. However, the inherent noise encountered when running these systems can lead to measurement inaccuracies, especially pronounced when dealing with large or complex circuits. Achieving a balance between the complexity of circuits and the desired degree of output accuracy is a nontrivial yet necessary task for the creation of production-ready quantum software. In this study, we demonstrate how traditional machine learning (ML) models can estimate quantum noise by analyzing circuit composition. To accomplish this, we train multiple ML models on random quantum circuits, aiming to learn to estimate the discrepancy between ideal and noisy circuit outputs. By employing various noise models from distinct IBM systems, our results illustrate how this approach can accurately predict the robustness of circuits with a low error rate. By providing metrics on the stability of circuits, these techniques can be used to assess the quality and security of quantum code, leading to more reliable quantum products.

2409.14831v1

Violation of no-signaling on a public quantum computer

No-signaling is a consequence of the no-communication theorem that states that bipartite systems cannot transfer information unless a communication channel exists. It is also a by-product of the assumptions of Bell theorem about quantum nonlocality. We have tested no-signaling in bipartite systems of qubits from IBM Quantum devices in extremely large statistics, resulting in significant violations. Although the time and space scales of IBM Quantum cannot in principle rule out subluminal communications, there is no obvious physical mechanism leading to signaling. The violation is also at similar level as observed in Bell tests. It is therefore mandatory to check possible technical imperfections that may cause the violation and to repeat the loophole-free Bell test at much larger statistics, in order to be ruled out definitively at strict spacelike conditions.

2409.11348v1

IBM Quantum Computers: Evolution, Performance, and Future Directions

Quantum computers represent a transformative frontier in computational technology, promising exponential speedups beyond classical computing limits. IBM Quantum has led significant advancements in both hardware and software, providing access to quantum hardware via IBM Cloud since 2016, achieving a milestone with the world's first accessible quantum computer. This article explores IBM's quantum computing journey, focusing on the development of practical quantum computers. We summarize the evolution and advancements of IBM Quantum's processors across generations, including their recent breakthrough surpassing the 1,000-qubit barrier. The paper reviews detailed performance metrics across various hardware, tracing their evolution over time and highlighting IBM Quantum's transition from the noisy intermediate-scale quantum (NISQ) computing era towards fault-tolerant quantum computing capabilities.

2410.00916v1

Demonstration of Scully-Drühl-type quantum erasers on quantum computers

We present a novel quantum circuit that genuinely implements the Scully-Dr\"uhl-type delayed-choice quantum eraser, where the two recorders of the which-way information directly interact with the signal qubit and remain spatially separated. Experiments conducted on IBM Quantum and IonQ processors demonstrate that the recovery of interference patterns, to varying degrees, aligns closely with theoretical predictions, despite the presence of systematic errors. This quantum circuit-based approach, more manageable and versatile than traditional optical experiments, facilitates arbitrary adjustment of the erasure and enables a true random choice in a genuine delayed-choice manner. On the IBM Quantum platform, delay gates can be employed to further defer the random choice, thereby amplifying the retrocausal effect. Since gate operations are executed sequentially in time, the system does not have any involvement of random choice until after the signal qubit has been measured, therefore eliminating any potential philosophical loopholes regarding retrocausality that might exist in other experimental setups. Remarkably, quantum erasure is achieved with delay times up to $\sim1\,\mu\text{s}$ without noticeable decoherence, a feat challenging to replicate in optical setups.

2409.08053v2

Effect of noise on quantum circuit realization of non-Hermitian time crystals

Non-Hermitian quantum dynamics lie in an intermediate regime between unitary Hamiltonian dynamics and trace-preserving non-unitary open quantum system dynamics. Given differences in the noise tolerance of unitary and non-unitary dynamics, it is interesting to consider implementing non-Hermitian dynamics on a noisy quantum computer. In this paper, we do so for a non-Hermitian Ising Floquet model whose many-body dynamics gives rise to persistent temporal oscillations, a form of time crystallinity. In the simplest two qubit case that we consider, there is an infinitely long-lived periodic steady state at certain fine-tuned points. These oscillations remain reasonably long-lived over a range of parameters in the ideal non-Hermitean dynamics and for the levels of noise and imperfection expected of modern day quantum devices. Using a generalized Floquet analysis, we show that infinitely long-lived oscillations are generically lost for arbitrarily weak values of common types of noise and compute corresponding damping rate. We perform simulations using IBM's Qiskit platform to confirm our findings; however, experiments on a real device (ibmq-lima) do not show remnants of these oscillations.

2409.06113v3

Resource-efficient context-aware dynamical decoupling embedding for arbitrary large-scale quantum algorithms

We introduce and implement GraphDD: an efficient method for real-time, circuit-specific, optimal embedding of dynamical decoupling (DD) into executable quantum algorithms. We demonstrate that for an arbitrary quantum circuit, GraphDD exactly refocuses both quasi-static single-qubit dephasing and crosstalk idling errors over the entire circuit, while using a minimal number of additional single-qubit gates embedded into idle periods. The method relies on a graph representation of the embedding problem, where the optimal decoupling sequence can be efficiently calculated using an algebraic computation that scales linearly with the number of idles. This allows optimal DD to be embedded during circuit compilation, without any calibration overhead, additional circuit execution, or numerical optimization. The method is generic and applicable to any arbitrary circuit; in compiler runtime the specific pulse-sequence solutions are tailored to the individual circuit, and consider a range of contextual information on circuit structure and device connectivity. We verify the ability of GraphDD to deliver enhanced circuit-level error suppression on 127-qubit IBM devices, showing that the optimal circuit-specific DD embedding resulting from GraphDD provides orders of magnitude improvements to measured circuit fidelities compared with standard embedding approaches available in Qiskit.

2409.05962v1

Qubit Mapping: The Adaptive Divide-and-Conquer Approach

The qubit mapping problem (QMP) focuses on the mapping and routing of qubits in quantum circuits so that the strict connectivity constraints imposed by near-term quantum hardware are satisfied. QMP is a pivotal task for quantum circuit compilation and its decision version is NP-complete. In this study, we present an effective approach called Adaptive Divided-And-Conqure (ADAC) to solve QMP. Our ADAC algorithm adaptively partitions circuits by leveraging subgraph isomorphism and ensuring coherence among subcircuits. Additionally, we employ a heuristic approach to optimise the routing algorithm during circuit partitioning. Through extensive experiments across various NISQ devices and circuit benchmarks, we demonstrate that the proposed ADAC algorithm outperforms the state-of-the-art method. Specifically, ADAC shows an improvement of nearly 50\% on the IBM Tokyo architecture. Furthermore, ADAC exhibits an improvement of around 18\% on pseudo-realistic circuits implemented on grid-like architectures with larger qubit numbers, where the pseudo-realistic circuits are constructed based on the characteristics of widely existing realistic circuits, aiming to investigate the applicability of ADAC. Our findings highlight the potential of ADAC in quantum circuit compilation and the deployment of practical applications on near-term quantum hardware platforms.

2409.04752v1

Extracting and Storing Energy From a Quasi-Vacuum on a Quantum Computer

We explore recent advancements in the understanding and manipulation of vacuum energy in quantum physics, with a focus on the quantum energy teleportation (QET) protocol. Traditional QET protocols extract energy from what we refer to as a ``quasi-vacuum'' state, but the extracted quantum energy is dissipated into classical devices, limiting its practical utility. To address this limitation, we propose an enhanced QET protocol that incorporates an additional qubit, enabling the stored energy to be stored within a quantum register for future use. We experimentally validated this enhanced protocol using IBM superconducting quantum computers, demonstrating its feasibility and potential for future applications in quantum energy manipulation.

2409.03973v1

qSAT: Design of an Efficient Quantum Satisfiability Solver for Hardware Equivalence Checking

The use of Boolean Satisfiability (SAT) solver for hardware verification incurs exponential run-time in several instances. In this work we have proposed an efficient quantum SAT (qSAT) solver for equivalence checking of Boolean circuits employing Grover's algorithm. The Exclusive-Sum-of-Product based generation of the Conjunctive Normal Form equivalent clauses demand less qubits and minimizes the gates and depth of quantum circuit interpretation. The consideration of reference circuits for verification affecting Grover's iterations and quantum resources are also presented as a case study. Experimental results are presented assessing the benefits of the proposed verification approach using open-source Qiskit platform and IBM quantum computer.

2409.03917v1

Bias-Field Digitized Counterdiabatic Quantum Algorithm for Higher-Order Binary Optimization

We present an enhanced bias-field digitized counterdiabatic quantum optimization (BF-DCQO) algorithm to address higher-order unconstrained binary optimization (HUBO) problems. Combinatorial optimization plays a crucial role in many industrial applications, yet classical computing often struggles with complex instances. By encoding these problems as Ising spin glasses and leveraging the advancements in quantum computing technologies, quantum optimization methods emerge as a promising alternative. We apply BF-DCQO with an enhanced bias term to a HUBO problem featuring three-local terms in the Ising spin-glass model. Our protocol is experimentally validated using 156 qubits on an IBM quantum processor with a heavy-hex architecture. In the studied instances, the results outperform standard methods, including the quantum approximate optimization algorithm (QAOA), quantum annealing, simulated annealing, and Tabu search. Furthermore, we perform an MPS simulation and provide numerical evidence of the feasibility of a similar HUBO problem on a 433-qubit Osprey-like quantum processor. Both studied cases, the experiment on 156 qubits and the simulation on 433 qubits, can be considered as the start of the commercial quantum advantage era, Kipu dixit, and even more when extended soon to denser industry-level HUBO problems.

2409.04477v1

Quantum Computing for Discrete Optimization: A Highlight of Three Technologies

Quantum optimization has emerged as a promising frontier of quantum computing, providing novel numerical approaches to mathematical optimization problems. The main goal of this paper is to facilitate interdisciplinary research between the Operations Research (OR) and Quantum Computing communities by providing an OR scientist's perspective on selected quantum-powered methods for discrete optimization. To this end, we consider three quantum-powered optimization approaches that make use of different types of quantum hardware available on the market. To illustrate these approaches, we solve three classical optimization problems: the Traveling Salesperson Problem, Weighted Maximum Cut, and Maximum Independent Set. With a general OR audience in mind, we attempt to provide an intuition behind each approach along with key references, describe the corresponding high-level workflow, and highlight crucial practical considerations. In particular, we emphasize the importance of problem formulations and device-specific configurations, and their impact on the amount of resources required for computation (where we focus on the number of qubits). These points are illustrated with a series of experiments on three types of quantum computers: a neutral atom machine from QuEra, a quantum annealer from D-Wave, and a gate-based device from IBM.

2409.01373v1

An Efficient Quantum Binary-Neuron Algorithm for Accurate Multi-Story Floor Localization

Accurate floor localization in a multi-story environment is an important but challenging task. Among the current floor localization techniques, fingerprinting is the mainstream technology due to its accuracy in noisy environments. To achieve accurate floor localization in a building with many floors, we have to collect sufficient data on each floor, which needs significant storage and running time; preventing fingerprinting techniques from scaling to support large multi-story buildings, especially on a worldwide scale. In this paper, we propose a quantum algorithm for accurate multi-story localization. The proposed algorithm leverages quantum computing concepts to provide an exponential enhancement in both space and running time compared to the classical counterparts. In addition, it builds on an efficient binary-neuron implementation that can be implemented using fewer qubits compared to the typical non-binary neurons, allowing for easier deployment with near-term quantum devices. We implement the proposed algorithm on a real IBM quantum machine and evaluate it on three real indoor testbeds. Results confirm the exponential saving in both time and space for the proposed quantum algorithm, while keeping the same localization accuracy compared to the traditional classical techniques, and using half the number of qubits required for other quantum localization algorithms.

2409.00792v1

A zero-entropy classical shadow reconstruction of density state operators

Classical shadow (CS) has opened the door to predicting the characteristics of quantum systems using very few measurements. As quantum systems grow in size, new ways to characterize them are needed to show the quality of their qubits, gates, and how noise affects them. In this work, we explore the capabilities of CS for reconstructing density state operators of sections of quantum devices to make a diagnostic of their qubits quality. We introduce zero-entropy classical shadow (ZECS), a methodology that focuses on reconstructing a positive semidefinite and unit trace density state operator using the CS information. This procedure makes a reliable reconstruction of the density state operator removing partially the errors associated with a limited sampling and quantum device noise. It gives a threshold of the maximum coherent information that qubits on a quantum device have. We test ZECS on ibm_lagos and ibm_brisbane using up to 10,000 shots. We show that with only 6,000 shots, we can make a diagnostic of the properties of groups of 2, 3, and 4 qubits on the 127-qubits ibm_brisbane device. We show two applications of ZECS: as a routing technique and as a detector for non-local noisy correlations. In the routing technique, an optimal set of 20 ibm_brisbane qubits is selected based on the ZECS procedure and used for a quantum optimization application. This method improves the solution quality by 10% and extends the quantum algorithm's lifetime by 33% when compared to the qubits chosen by the best transpilation procedure in Qiskit. Additionally, with the detector of non-local correlations, we identify regions of ibm\_brisbane that are not directly connected but have a strong correlation that maintains in time, suggesting some non-local crosstalk that can come, for example, at the multiplexing readout stage.

2408.17317v1

Muon/Pion Identification at BESIII based on Variational Quantum Classifier

In collider physics experiments, particle identification (PID), i. e. the identification of the charged particle species in the detector is usually one of the most crucial tools in data analysis. In the past decade, machine learning techniques have gradually become one of the mainstream methods in PID, usually providing superior discrimination power compared to classical algorithms. In recent years, quantum machine learning (QML) has bridged the traditional machine learning and the quantum computing techniques, providing further improvement potential for traditional machine learning models. In this work, targeting at the $\mu^{\pm} /\pi^{\pm}$ discrimination problem at the BESIII experiment, we developed a variational quantum classifier (VQC) with nine qubits. Using the IBM quantum simulator, we studied various encoding circuits and variational ansatzes to explore their performance. Classical optimizers are able to minimize the loss function in quantum-classical hybrid models effectively. A comparison of VQC with the traditional multiple layer perception neural network reveals they perform similarly on the same datasets. This illustrates the feasibility to apply quantum machine learning to data analysis in collider physics experiments in the future.

2408.13812v1

Optimizing Quantum Fourier Transformation (QFT) Kernels for Modern NISQ and FT Architectures

Rapid development in quantum computing leads to the appearance of several quantum applications. Quantum Fourier Transformation (QFT) sits at the heart of many of these applications. Existing work leverages SAT solver or heuristics to generate a hardware-compliant circuit for QFT by inserting SWAP gates to remap logical qubits to physical qubits. However, they might face problems such as long compilation time due to the huge search space for SAT solver or suboptimal outcome in terms of the number of cycles to finish all gate operations. In this paper, we propose a domain-specific hardware mapping approach for QFT. We unify our insight of relaxed ordering and unit exploration in QFT to search for a qubit mapping solution with the help of program synthesis tools. Our method is the first one that guarantees linear-depth QFT circuits for Google Sycamore, IBM heavy-hex, and the lattice surgery, with respect to the number of qubits. Compared with state-of-the-art approaches, our method can save up to 53% in SWAP gate and 92% in depth.

2408.11226v1

Bounding the systematic error in quantum error mitigation due to model violation

Quantum error mitigation is a promising route to achieving quantum utility, and potentially quantum advantage in the near-term. Many state-of-the-art error mitigation schemes use knowledge of the errors in the quantum processor, which opens the question to what extent inaccuracy in the error model impacts the performance of error mitigation. In this work, we develop a methodology to efficiently compute upper bounds on the impact of error-model inaccuracy in error mitigation. Our protocols require no additional experiments, and instead rely on comparisons between the error model and the error-learning data from which the model is generated. We demonstrate the efficacy of our methodology by deploying it on an IBM Quantum superconducting qubit quantum processor, and through numerical simulation of standard error models. We show that our estimated upper bounds are typically close to the worst observed performance of error mitigation on random circuits. Our methodology can also be understood as an operationally meaningful metric to assess the quality of error models, and we further extend our methodology to allow for comparison between error models. Finally, contrary to what one might expect we show that observable error in noisy layered circuits of sufficient depth is not always maximized by a Clifford circuit, which may be of independent interest.

2408.10985v1

Floquet prethermalization of ${\bf Z}_2$ lattice gauge theory on superconducting qubits

Simulating nonequilibirum dynamics of a quantum many-body system is one of the promising applications of quantum computing. We simulate the time evolution of one-dimensional ${\bf Z}_2$ lattice gauge theory on IBM's superconducting 156-qubit device ibm\_fez. We consider the Floquet circuit made of the Trotter decomposition of Hamiltonian evolution and focus on its dynamics toward thermalization. Quantum simulation with the help of error mitigation is successful in running the Floquet circuit made of $38$ and $116$ qubits up to $10$ Trotter steps in the best case. This is enough to reach the early stage of prethermalization. Our work would be a benchmark for the potential power of quantum computing for high-energy physics problems.

2408.10079v1

Quantum Buffer Design Using Petri Nets

This paper introduces a simplified quantum Petri net (QPN) model and uses this model to generalize classical SISO, SIMO, MISO, MIMO and priority buffers to their quantum counterparts. It provides a primitive storage element, namely a quantum S-R flip-flop design using quantum CNOT and SWAP gates that can be replicated to obtain a quantum register for any given number of qubits. The aforementioned quantum buffers are then obtained using the simplified QPN model and quantum registers. $\!\!$The quantum S-R flip-flop and quantum buffer designs have been tested using OpenQASM and Qiskit on IBM quantum computers and simulators and the results validate the presented quantum S-R flip-flop and buffer designs.

2408.08369v1

Using linear and nonlinear entanglement witnesses to generate and detect bound entangled states on an IBM quantum processor

We investigate bound entanglement in three-qubit mixed states which are diagonal in the Greenberger-Horne-Zeilinger (GHZ) basis. Entanglement in these states is detected using entanglement witnesses and the analysis focuses on states exhibiting positive partial transpose (PPT). We then compare the detection capabilities of optimal linear and nonlinear entanglement witnesses. In theory, both linear and nonlinear witnesses produce non-negative values for separable states and negative values for some entangled GHZ diagonal states with PPT, indicating the presence of entanglement. Our experimental results reveal that in cases where linear entanglement witnesses fail to detect entanglement, nonlinear witnesses are consistently able to identify its presence. Optimal linear and nonlinear witnesses were generated on an IBM quantum computer and their performance was evaluated using two bound entangled states (Kay and Kye states) from the literature, and randomly generated entangled states in the GHZ diagonal form. Additionally, we propose a general quantum circuit for generating a three-qubit GHZ diagonal mixed state using a six-qubit pure state on the IBM quantum processor. We experimentally implemented the circuit to obtain expectation values for three-qubit mixed states and compute the corresponding entanglement witnesses.

2408.07769v1

Randomized Benchmarking Protocol for Dynamic Circuits

Dynamic circuit operations -- measurements with feedforward -- are important components for future quantum computing efforts, but lag behind gates in the availability of characterization methods. Here we introduce a series of dynamic circuit benchmarking routines based on interleaving dynamic circuit operation blocks $F$ in one-qubit randomized benchmarking sequences of data qubits. $F$ spans between the set of data qubits and a measurement qubit and may include feedforward operations based on the measurement. We identify six candidate operation blocks, such as preparing the measured qubit in $|0\rangle$ and performing a $Z$-Pauli on the data qubit conditioned on a measurement of `1'. Importantly, these blocks provide a methodology to accumulate readout assignment errors in a long circuit sequence. We also show the importance of dynamic-decoupling in reducing ZZ crosstalk and measurement-induced phase errors during dynamic circuit blocks. When measured on an IBM Eagle device with appropriate dynamical decoupling, the results are consistent with measurement assignment error and the decoherence of the data qubit as the leading error sources.

2408.07677v1

Tensor-based quantum phase difference estimation for large-scale demonstration

We develop an energy calculation algorithm leveraging quantum phase difference estimation (QPDE) scheme and a tensor-network-based unitary compression method in the preparation of superposition states and time-evolution gates. Alongside its efficient implementation, this algorithm reduces depolarization noise affections exponentially. We demonstrated energy gap calculations for one-dimensional Hubbard models on IBM superconducting devices using circuits up to 32-system (plus one-ancilla) qubits, a five-fold increase over previous QPE demonstrations, at the 7242 controlled-Z gate level of standard transpilation, utilizing a Q-CTRL error suppression module. Additionally, we propose a technique towards molecular executions using spatial orbital localization and index sorting, verified by a 13- (17-)qubit hexatriene (octatetraene) simulation. Since QPDE can handle the same objectives as QPE, our algorithm represents a leap forward in quantum computing on real devices.

2408.04946v3

CALA-$n$: A Quantum Library for Realizing Cost-Effective 2-, 3-, 4-, and 5-bit Gates on IBM Quantum Computers using Bloch Sphere Approach, Clifford+T Gates, and Layouts

We introduce a new quantum layout-aware approach to realize cost-effective $n$-bit gates using the Bloch sphere, for $2 \le n \le 5$ qubits. These $n$-bit gates are entirely constructed from the Clifford+T gates, in the approach of selecting sequences of rotations visualized on the Bloch sphere. This Bloch sphere approach ensures to match the quantum layout for synthesizing (transpiling) these $n$-bit gates into an IBM quantum computer. Various standard $n$-bit gates (Toffoli, Fredkin, etc.) and their operational equivalent of our proposed $n$-bit gates are examined and evaluated, in the context of the final quantum costs, as the final counts of generated IBM native gates. In this paper, we demonstrate that all our $n$-bit gates always have lower quantum costs than those of standard $n$-bit gates after transpilation. Hence, our Bloch sphere approach can be used to build a quantum library of various cost-effective $n$-bit gates for different layouts of IBM quantum computers.

2408.01025v1

On the use of calibration data in error-aware compilation techniques for NISQ devices

Reliably executing quantum algorithms on noisy intermediate-scale quantum (NISQ) devices is challenging, as they are severely constrained and prone to errors. Efficient quantum circuit compilation techniques are therefore crucial for overcoming their limitations and dealing with their high error rates. These techniques consider the quantum hardware restrictions, such as the limited qubit connectivity, and perform some transformations to the original circuit that can be executed on a given quantum processor. Certain compilation methods use error information based on calibration data to further improve the success probability or the fidelity of the circuit to be run. However, it is uncertain to what extent incorporating calibration information in the compilation process can enhance the circuit performance. For instance, considering the most recent error data provided by vendors after calibrating the processor might not be functional enough as quantum systems are subject to drift, making the latest calibration data obsolete within minutes. In this paper, we explore how different usage of calibration data impacts the circuit fidelity, by using several compilation techniques and quantum processors (IBM Perth and Brisbane). To this aim, we implemented a framework that incorporates some of the state-of-the-art noise-aware and non-noise-aware compilation techniques and allows the user to perform fair comparisons under similar processor conditions. Our experiments yield valuable insights into the effects of noise-aware methodologies and the employment of calibration data. The main finding is that pre-processing historical calibration data can improve fidelity when real-time calibration data is not available due to factors such as cloud service latency and waiting queues between compilation and execution on the quantum backend.

2407.21462v1

Tensor Network enhanced Dynamic Multiproduct Formulas

Tensor networks and quantum computation are two of the most powerful tools for the simulation of quantum many-body systems. Rather than viewing them as competing approaches, here we consider how these two methods can work in tandem. We introduce a novel algorithm that combines tensor networks and quantum computation to produce results that are more accurate than what could be achieved by either method used in isolation. Our algorithm is based on multiproduct formulas (MPF) - a technique that linearly combines Trotter product formulas to reduce algorithmic error. Our algorithm uses a quantum computer to calculate the expectation values and tensor networks to calculate the coefficients used in the linear combination. We present a detailed error analysis of the algorithm and demonstrate the full workflow on a one-dimensional quantum simulation problem on $50$ qubits using two IBM quantum computers: $ibm\_torino$ and $ibm\_kyiv$.

2407.17405v3

Qutrit and Qubit Circuits for Three-Flavor Collective Neutrino Oscillations

We explore the utility of qutrits and qubits for simulating the flavor dynamics of dense neutrino systems. The evolution of such systems impacts some important astrophysical processes, such as core-collapse supernovae and the nucleosynthesis of heavy nuclei. Many-body simulations require classical resources beyond current computing capabilities for physically relevant system sizes. Quantum computers are therefore a promising candidate to efficiently simulate the many-body dynamics of collective neutrino oscillations. Previous quantum simulation efforts have primarily focused on properties of the two-flavor approximation due to their direct mapping to qubits. Here, we present new quantum circuits for simulating three-flavor neutrino systems on qutrit- and qubit-based platforms, and demonstrate their feasibility by simulating systems of two, four and eight neutrinos on IBM and Quantinuum quantum computers.

2407.13914v1

Unraveling Rodeo Algorithm Through the Zeeman Model

We unravel the Rodeo Algorithm to determine the eigenstates and eigenvalues spectrum for a general Hamiltonian considering arbitrary initial states. By presenting a novel methodology, we detail the original method and show how to define all properties without having prior knowledge regarding the eigenstates. To this end, we exploit Pennylane and Qiskit platforms resources to analyze scenarios where the Hamiltonians are described by the Zeeman model for one and two spins. We also introduce strategies and techniques to improve the algorithm's performance by adjusting its intrinsic parameters and reducing the fluctuations inherent to data distribution. First, we explore the dynamics of a single qubit on Xanadu simulators to set the parameters that optimize the method performance and select the best strategies to execute the algorithm. On the sequence, we extend the methodology for bipartite systems to discuss how the algorithm works when degeneracy and entanglement are taken into account. Finally, we compare the predictions with the results obtained on a real superconducting device provided by the IBM Q Experience program, establishing the conditions to increase the protocol efficiency for multi-qubit systems.

2407.11301v1

Finding Quantum Codes via Riemannian Optimization

We propose a novel optimization scheme designed to find optimally correctable subspace codes for a known quantum noise channel. To each candidate subspace code we first associate a universal recovery map, as if the code was perfectly correctable, and aim to maximize a performance functional that combines a modified channel fidelity with a tuneable regularization term that promotes simpler codes. With this choice optimization is performed only over the set of codes, and not over the set of recovery operators. The set of codes of fixed dimension is parametrized as a complex-valued Stiefel manifold: the resulting non-convex optimization problem is then solved by gradient-based local algorithms. When perfectly correctable codes cannot be found, a second optimization routine is run on the recovery Kraus map, also parametrized in a suitable Stiefel manifold via Stinespring representation. To test the approach, correctable codes are sought in different scenarios and compared to existing ones: three qubits subjected to bit-flip errors (single and correlated), four qubits undergoing local amplitude damping and five qubits subjected to local depolarizing channels. Approximate codes are found and tested for the previous examples as well pure non-Markovian dephasing noise acting on a $7/2$ spin, induced by a $1/2$ spin bath, and the noise of the first three qubits of IBM's \texttt{ibm\_kyoto} quantum computer. The fidelity results are competitive with existing iterative optimization algorithms, with respect to which we maintain a strong computational advantage, while obtaining simpler codes.

2407.08423v2

BHT-QAOA: Generalizing Quantum Approximate Optimization Algorithm to Solve Arbitrary Boolean Problems as Hamiltonians

A new methodology is proposed to solve classical Boolean problems as Hamiltonians, using the quantum approximate optimization algorithm (QAOA). Our methodology successfully finds all optimized approximated solutions for Boolean problems, after converting them from Boolean oracles (in different structures) into Phase oracles, and then into the Hamiltonians of QAOA. From such a conversion, we noticed that the total utilized numbers of qubits and quantum gates are dramatically minimized for the final quantum circuits of Hamiltonians. In this paper, arbitrary classical Boolean problems are examined by successfully solving them with our proposed methodology, using structures based on various logic synthesis methods, an IBM quantum computer, and a classical optimization minimizer. Accordingly, this methodology will provide broad opportunities to solve many classical Boolean problems as Hamiltonians, for the practical engineering applications of several algorithms, robotics, machine learning, just to name a few, in the hybrid classical-quantum domain.

2407.07250v1

Cyclic solid-state quantum battery: Thermodynamic characterization and quantum hardware simulation

We introduce a cyclic quantum battery model, based on an interacting bipartite system, weakly coupled to a thermal bath. The working cycle of the battery consists of four strokes: system thermalization, disconnection of subsystems, ergotropy extraction, and reconnection. The thermal bath acts as a charger in the thermalization stroke, while ergotropy extraction is possible because the ensuing thermal state is no longer passive after the disconnection stroke. Focusing on the case of two interacting qubits, we show that phase coherence, in the presence of non-trivial correlations between the qubits, can be exploited to reach working regimes with efficiency higher than 50% while providing finite ergotropy. Our protocol is illustrated through a simple and feasible circuit model of a cyclic superconducting quantum battery. Furthermore, we simulate the considered cycle on superconducting IBM quantum machines. The good agreement between the theoretical and simulated results strongly suggests that our scheme for cyclic quantum batteries can be successfully realized in superconducting quantum hardware.

2407.07157v1

Dynamic thermalization on noisy quantum hardware

Relaxation after a global quench is a natural way to probe thermalization in closed quantum systems. When a system relaxes after the quench, thermal observables emerge in the absence of constraints, provided long-time averaging or a large system. We demonstrate a thermalization mechanism based on averaging the observables over realizations of a global quench protocol that does not rely on a system's size or long-time evolution. The quench abruptly establishes all-to-all couplings of random strength in a few-body system and initializes the dynamics. Shortly after the quench, the observables averaged over realizations of random couplings become stationary. The average occupation probabilities of many-body energy states equilibrate toward the Gibbs distribution with a finite positive or negative absolute temperature that depends on the initial state's energy, with the negative temperatures occurring due to the confined spectrum of the system. Running an experiment on an IBM Quantum computer (IBMQ) for four qubits, we report the utility of the digital quantum computer for predicting thermal observables and their fluctuations for positive or negative absolute temperatures. Implementing thermalization on IBMQ, this result facilitates probing the dynamical emergence of thermal equilibrium and, consequently, equilibrium properties of matter at finite temperatures on noisy intermediate-scale quantum hardware.

2407.04770v1

Teleporting two-qubit entanglement across 19 qubits on a superconducting quantum computer

Quantum teleportation is not merely a fascinating corollary of quantum entanglement, it also finds utility in quantum processing and circuit compilation. In this paper, we measure and track the entanglement and fidelity of two-qubit states prepared on a 127-qubit IBM Quantum device, as one of the qubits is teleported across 19 qubits. We design, evaluate and compare two distinct approaches to teleportation: post-selected measurement categorisation and dynamic circuit corrections based on mid-circuit measurements, and compare with direct state transportation using SWAP gates. By optimally choosing the teleportation path which exhibits the highest total negativity entanglement measure across nearest-neighbour pairs, we show the entanglement of a two-qubit graph state is sustained after at least 19 hops in teleportation using the post-selection approach and 17 hops using the dynamic circuit approach. We observe a higher level of teleported entanglement in paths determined from two-qubit negativities compared to those obtained from gate errors, demonstrating an advantage in using the negativity map over the gate error map for compiling quantum circuits.

2407.02858v1

Quantum-Enhanced Secure Approval Voting Protocol

In a world where elections touch every aspect of society, the need for secure voting is paramount. Traditional safeguards, based on classical cryptography, rely on complex math problems like factoring large numbers. However, quantum computing is changing the game. Recent advances in quantum technology suggest that classical cryptographic methods may not be as secure as we thought. This paper introduces a quantum voting protocol, a blend of quantum principles (entanglement and superposition), blockchain technology, and digital signatures, all powered by $\log_2{n}$ qubits, and designed for approval voting with n candidates. The result is a symphony of security features - binding, anonymity, non-reusability, verifiability, eligibility, and fairness - that chart a new course for voting security. The real world beckons, as we tested this protocol on IBM quantum hardware, achieving impressively low error rates of just 1.17% in a four-candidate election.

2406.19730v1

Dataflow-Based Optimization for Quantum Intermediate Representation Programs

This paper proposes QDFO, a dataflow-based optimization approach to Microsoft QIR. QDFO consists of two main functions: one is to preprocess the QIR code so that the LLVM optimizer can capture more optimization opportunities, and the other is to optimize the QIR code so that duplicate loading and constructing of qubits and qubit arrays can be avoided. We evaluated our work on the IBM Challenge Dataset, the results show that our method effectively reduces redundant operations in the QIR code. We also completed a preliminary implementation of QDFO and conducted a case study on the real-world code. Our observational study indicates that the LLVM optimizer can further optimize the QIR code preprocessed by our algorithm. Both the experiments and the case study demonstrate the effectiveness of our approach.

2406.19592v1

QOS: A Quantum Operating System

We introduce the Quantum Operating System (QOS), a unified system stack for managing quantum resources while mitigating their inherent limitations, namely their limited and noisy qubits, (temporal and spatial) heterogeneities, and load imbalance. QOS features the $\textit{QOS compiler}$ -- a modular and composable compiler for analyzing and optimizing quantum applications to run on small and noisy quantum devices with high performance and configurable overheads. For scalable execution of the optimized applications, we propose the $\textit{QOS runtime}$ -- an efficient quantum resource management system that multi-programs and schedules the applications across space and time while achieving high system utilization, low waiting times, and high-quality results. We evaluate QOS on real quantum devices hosted by IBM, using 7000 real quantum runs of more than 70.000 benchmark instances. We show that the QOS compiler achieves 2.6--456.5$\times$ higher quality results, while the QOS runtime further improves the quality by 1.15--9.6$\times$ and reduces the waiting times by up to 5$\times$ while sacrificing only 1--3\% of results quality (or fidelity).

2406.19120v1

Near-Term Quantum Spin Simulation of the Spin-$\frac{1}{2}$ Square $J_{1}-J_{2}$ Heisenberg Model

Simulating complex spin systems, known for high frustration and entanglement, presents significant challenges due to their intricate energy landscapes. This study focuses on the $J_{1}-J_{2}$ Heisenberg model, renowned for its rich phase behavior on the square lattice, to investigate strongly correlated spin systems. We conducted the first experimental quantum computing study of this model using the 127-qubit IBM Rensselear Eagle processor and the Variational Quantum Eigensolver (VQE) algorithm. By employing classical warm-starting ($+40\%$ ground state energy approximation) and a newly developed ansatz ($+9.31\%$ improvement compared to prior best), we improved ground state approximation accuracy on the 16-site variant, achieving usable results with approximately $10^{3}$ iterations, significantly fewer than the $10^{4}-10^{5}$ steps proposed by previous theoretical studies. We utilized existing error mitigation strategies and introduced a novel Classically-Reinforced VQE error mitigation scheme, achieving $93\%$ ground state accuracy, compared to $83.7\%$ with the Quantum Moments algorithm and $60\%$ with standard error mitigation. These strategies reduced the average error of observable prediction from $\approx 20\%$ to $5\%$, enhancing phase prediction from qualitative to quantitative alignment. Additionally, we explored an experimental implementation of the Quantum Lanczos (QLanczos) algorithm using Variational-Fast Forwarding (VFF) on a 4-qubit site, achieving $\approx 97\%$ ground state approximation. Theoretical simulations indicated that Krylov-based methods outperform VQE, with the Lanczos basis converging faster than the real-time basis. Our study demonstrates that near-term quantum devices can predict phase-relevant observables for the $J_1-J_2$ Heisenberg model, transitioning focus from theoretical to experimental, and suggesting general improvements to VQE-based methods.

2406.18474v2

Scaling Quantum Computations via Gate Virtualization

We present the Quantum Virtual Machine (QVM), an end-to-end generic system for scalable execution of large quantum circuits with high fidelity on noisy and small quantum processors (QPUs) by leveraging gate virtualization. QVM exposes a virtual circuit intermediate representation (IR) that extends the notion of quantum circuits to incorporate gate virtualization. Based on the virtual circuit as our IR, we propose the QVM compiler - an extensible compiler infrastructure to transpile a virtual circuit through a series of modular optimization passes to produce a set of optimized circuit fragments. Lastly, these transpiled circuit fragments are executed on QPUs using our QVM runtime - a scalable and distributed infrastructure to virtualize and execute circuit fragments on a set of distributed QPUs. We evaluate QVM on IBM's 7- and 27-qubit QPUs. Our evaluation shows that using our system, we can scale the circuit sizes executable on QPUs up to double the size of the QPU while improving fidelity by 4.7$\times$ on average compared to larger QPUs and that we can effectively reduce circuit depths to only 40\% of the original circuit depths.

2406.18410v2

Can Quantum Computers Do Nothing?

Quantum computing platforms are subject to contradictory engineering requirements: qubits must be protected from mutual interactions when idling ('doing nothing'), and strongly interacting when in operation. If idling qubits are not sufficiently protected, information can 'leak' into neighbouring qubits, become non-locally distributed, and ultimately inaccessible. Candidate solutions to this dilemma include patterning-enhanced many-body localization, dynamical decoupling, and active error correction. However, no information-theoretic protocol exists to actually quantify this information loss due to internal dynamics in a similar way to e.g. SPAM errors or dephasing times. In this work, we develop a scalable, flexible, device non-specific protocol for quantifying this bitwise idle information loss based on the exploitation of tools from quantum information theory. We implement this protocol in over 3500 experiments carried out across 4 months (Dec 2023 - Mar 2024) on IBM's entire Falcon 5.11 series of processors. After accounting for other sources of error, and extrapolating results via a scaling analysis in shot count to zero shot noise, we detect idle information leakage to a high degree of statistical significance. This work thus provides a firm quantitative foundation from which the protection-operation dilemma can be investigated and ultimately resolved.

2406.16861v1

Comprehensive characterization of three-qubit Grover search algorithm on IBM's 127-qubit superconducting quantum computers

The Grover search algorithm is a pivotal advancement in quantum computing, promising a remarkable speedup over classical algorithms in searching unstructured large databases. Here, we report results for the implementation and characterization of a three-qubit Grover search algorithm using the state-of-the-art scalable quantum computing technology of superconducting quantum architectures. To delve into the algorithm's scalability and performance metrics, our investigation spans the execution of the algorithm across all eight conceivable single-result oracles, alongside nine two-result oracles, employing IBM Quantum's 127-qubit quantum computers. Moreover, we conduct five quantum state tomography experiments to precisely gauge the behavior and efficiency of our implemented algorithm under diverse conditions; ranging from noisy, noise-free environments to the complexities of real-world quantum hardware. By connecting theoretical concepts with real-world experiments, this study not only shed light on the potential of NISQ (Noisy Intermediate-Scale Quantum) computers in facilitating large-scale database searches but also offer valuable insights into the practical application of the Grover search algorithm in real-world quantum computing applications.

2406.16018v1

Thermal state preparation of the SYK model using a variational quantum algorithm

We study the preparation of thermal states of the dense and sparse Sachdev-Ye-Kitaev (SYK) model using a variational quantum algorithm for $6 \le N \le 12$ Majorana fermions over a wide range of temperatures. Utilizing IBM's 127-qubit quantum processor, we perform benchmark computations for the dense SYK model with $N = 6$, showing good agreement with exact results. The preparation of thermal states of a non-local random Hamiltonian with all-to-all coupling using the simulator and quantum hardware represents a significant step toward future computations of thermal out-of-time order correlators in quantum many-body systems.

2406.15545v2

Transversal CNOT gate with multi-cycle error correction

A scalable and programmable quantum computer holds the potential to solve computationally intensive tasks that classical computers cannot accomplish within a reasonable time frame, achieving quantum advantage. However, the vulnerability of the current generation of quantum processors to errors poses a significant challenge towards executing complex and deep quantum circuits required for practical problems. Quantum error correction codes such as Stabilizer codes offer a promising path forward for fault-tolerant quantum computing, however their realisation on quantum hardware is an on-going area of research. In particular, fault-tolerant quantum processing must employ logical gates on logical qubits with error suppression with realistically large size codes. This work has implemented a transversal CNOT gate between two logical qubits constructed using the Repetition code with flag qubits, and demonstrated error suppression with increasing code size under multiple rounds of error detection. By performing experiments on IBM quantum devices through cloud access, our results show that despite the potential for error propagation among logical qubits during the transversal CNOT gate operation, increasing the number of physical qubits from 21 to 39 and 57 can suppress errors, which persists over 10 rounds of error detection. Our work establishes the feasibility of employing logical CNOT gates alongside error detection on a superconductor-based processor using current generation quantum hardware.

2406.12267v1

Simon's algorithm in the NISQ cloud

Simon's algorithm was one of the first problems to demonstrate a genuine quantum advantage. The algorithm, however, assumes access to noise-free qubits. In our work we use Simon's algorithm to benchmark the error rates of devices currently available in the "quantum cloud." As a main result we obtain an objective comparison between the different physical platforms made available by IBM and IonQ. Our study highlights the importance of understanding the device architectures and chip topologies when transpiling quantum algorithms onto hardware. For instance, we demonstrate that two-qubit operations on spatially separated qubits on superconducting chips should be avoided.

2406.11771v1

Probing entanglement dynamics and topological transitions on noisy intermediate-scale quantum computers

We simulate quench dynamics of the Su-Schrieffer-Heeger (SSH) chain on the IBM quantum computers, calculating the R\'enyi entanglement entropy, the twist order parameter and the Berry phase. The latter two quantities can be deduced from a slow-twist operator defined in the Lieb-Schultz-Mattis theorem. The R\'enyi entropy is obtained using a recently developed randomized measurement scheme. The twist order parameter and the Berry phase are measured without the need for additional gates or ancilla qubits. We consider quench protocols in which a trivial initial state evolves dynamically in time under the topological SSH Hamiltonian in the fully dimerized limit (the flat-band limit). During these quenches, there are persistent and periodic oscillations in the time evolution of both entanglement entropy and twist order parameter. Through the implementation of error mitigation techniques using a global depolarizing ansatz and postselection, our simulations on the IBM devices yield results that closely match exact solutions.

2406.10159v2

Bose-Hubbard model with a single qubit

The use of a single-qubit parametrized circuit as an Ansatz for the variational wave function in the calculation of the ground state energy of a quantum many-body system is demonstrated using the one-dimensional Bose-Hubbard model. Comparison is made to calculations where a classic neural network is used to generate the variational wave function. Computations carried out on IBM Quantum hardware are also presented.

2406.09316v1

Towards minimal self-testing of qubit states and measurements in prepare-and-measure scenarios

Self-testing is a promising approach to certifying quantum states or measurements. Originally, it relied solely on the outcome statistics of the measurements involved in a device-independent (DI) setup. Extra physical assumptions about the system make the setup semi-DI. In the latter approach, we consider a prepare-and-measure scenario in which the dimension of the mediating particle is assumed to be two. In a setup involving four (three) preparations and three (two) projective measurements in addition to the target, we exemplify how to self-test any four- (three-) outcome extremal positive operator-valued measure using a linear witness. One of our constructions also achieves self-testing of any number of states with the help of as many projective measurements as the dimensionality of the space spanned by the corresponding Bloch vectors. These constructions are conjectured to be minimal in terms of the number of preparations and measurements required. In addition, we implement one of our prepare-and-measure constructions on IBM and IonQ quantum processors and certify the existence of a complex qubit Hilbert space based on the data obtained from these experiments.

2406.08661v1

Generating multipartite nonlocality to benchmark quantum computers

We show that quantum computers can be used for producing large $n$-partite nonlocality, thereby providing a method to benchmark them. The main challenges to overcome are: (i) The interaction topology might not allow arbitrary two-qubit gates. (ii) Noise limits the Bell violation. (iii) The number of combinations of local measurements grows exponentially with $n$. To overcome (i), we point out that graph states that are compatible with the two-qubit connectivity of the computer can be efficiently prepared. To mitigate (ii), we note that, for specific graph states, there are $n$-partite Bell inequalities whose resistance to white noise increases exponentially with $n$. To address (iii) for any $n$ and any connectivity, we introduce an estimator that relies on random sampling. As a result, we propose a method for producing $n$-partite Bell nonlocality with unprecedented large $n$. This allows in return to benchmark nonclassical correlations regardless of the number of qubits or the connectivity. We test our approach by using a simulation for a noisy IBM quantum computer, which predicts $n$-partite Bell nonlocality for at least $n=24$ qubits.

2406.07659v2

Novel Optimized Designs of Modulo $2n+1$ Adder for Quantum Computing

Quantum modular adders are one of the most fundamental yet versatile quantum computation operations. They help implement functions of higher complexity, such as subtraction and multiplication, which are used in applications such as quantum cryptanalysis, quantum image processing, and securing communication. To the best of our knowledge, there is no existing design of quantum modulo $(2n+1)$ adder. In this work, we propose four quantum adders targeted specifically for modulo $(2n+1)$ addition. These adders can provide both regular and modulo $(2n+1)$ sum concurrently, enhancing their application in residue number system based arithmetic. Our first design, QMA1, is a novel quantum modulo $(2n+1)$ adder. The second proposed adder, QMA2, optimizes the utilization of quantum gates within the QMA1, resulting in 37.5% reduced CNOT gate count, 46.15% reduced CNOT depth, and 26.5% decrease in both Toffoli gates and depth. We propose a third adder QMA3 that uses zero resets, a dynamic circuits based feature that reuses qubits, leading to 25% savings in qubit count. Our fourth design, QMA4, demonstrates the benefit of incorporating additional zero resets to achieve a purer zero state, reducing quantum state preparation errors. Notably, we conducted experiments using 5-qubit configurations of the proposed modulo $(2n+1)$ adders on the IBM Washington, a 127-qubit quantum computer based on the Eagle R1 architecture, to demonstrate a 28.8% reduction in QMA1's error of which: (i) 18.63% error reduction happens due to gate and depth reduction in QMA2, and (ii) 2.53% drop in error due to qubit reduction in QMA3, and (iii) 7.64% error decreased due to application of additional zero resets in QMA4.

2406.07486v1

Quantum optimization using a 127-qubit gate-model IBM quantum computer can outperform quantum annealers for nontrivial binary optimization problems

We introduce a comprehensive quantum solver for binary combinatorial optimization problems on gate-model quantum computers that outperforms any published alternative and consistently delivers correct solutions for problems with up to 127 qubits. We provide an overview of the internal workflow, describing the integration of a customized ansatz and variational parameter update strategy, efficient error suppression in hardware execution, and QPU-overhead-free post-processing to correct for bit-flip errors. We benchmark this solver on IBM quantum computers for several classically nontrivial unconstrained binary optimization problems -- the entire optimization is conducted on hardware with no use of classical simulation or prior knowledge of the solution. First, we demonstrate the ability to correctly solve Max-Cut instances for random regular graphs with a variety of densities using up to 120 qubits, where the graph topologies are not matched to device connectivity. Next, we apply the solver to higher-order binary optimization and successfully search for the ground state energy of a 127-qubit spin-glass model with linear, quadratic, and cubic interaction terms. Use of this new quantum solver increases the likelihood of finding the minimum energy by up to $\sim1,500\times$ relative to published results using a DWave annealer, and it can find the correct solution when the annealer fails. Furthermore, for both problem types, the Q-CTRL solver outperforms a heuristic local solver used to indicate the relative difficulty of the problems pursued. Overall, these results represent the largest quantum optimizations successfully solved on hardware to date, and demonstrate the first time a gate-model quantum computer has been able to outperform an annealer for a class of binary optimization problems.

2406.01743v4

Incompressible Navier-Stokes solve on noisy quantum hardware via a hybrid quantum-classical scheme

Partial differential equation solvers are required to solve the Navier-Stokes equations for fluid flow. Recently, algorithms have been proposed to simulate fluid dynamics on quantum computers. Fault-tolerant quantum devices might enable exponential speedups over algorithms on classical computers. However, current and foreseeable quantum hardware introduce noise into computations, requiring algorithms that make judicious use of quantum resources: shallower circuit depths and fewer qubits. Under these restrictions, variational algorithms are more appropriate and robust. This work presents a hybrid quantum-classical algorithm for the incompressible Navier--Stokes equations. A classical device performs nonlinear computations, and a quantum one uses a variational solver for the pressure Poisson equation. A lid-driven cavity problem benchmarks the method. We verify the algorithm via noise-free simulation and test it on noisy IBM superconducting quantum hardware. Results show that high-fidelity results can be achieved via this approach, even on current quantum devices. Multigrid preconditioning of the Poisson problem helps avoid local minima and reduces resource requirements for the quantum device. A quantum state readout technique called HTree is used for the first time on a physical problem. Htree is appropriate for real-valued problems and achieves linear complexity in the qubit count, making the Navier-Stokes solve further tractable on current quantum devices. We compare the quantum resources required for near-term and fault-tolerant solvers to determine quantum hardware requirements for fluid simulations with complexity improvements.

2406.00280v2

mRNA secondary structure prediction using utility-scale quantum computers

Recent advancements in quantum computing have opened new avenues for tackling long-standing complex combinatorial optimization problems that are intractable for classical computers. Predicting secondary structure of mRNA is one such notoriously difficult problem that can benefit from the ever-increasing maturity of quantum computing technology. Accurate prediction of mRNA secondary structure is critical in designing RNA-based therapeutics as it dictates various steps of an mRNA life cycle, including transcription, translation, and decay. The current generation of quantum computers have reached utility-scale, allowing us to explore relatively large problem sizes. In this paper, we examine the feasibility of solving mRNA secondary structures on a quantum computer with sequence length up to 60 nucleotides representing problems in the qubit range of 10 to 80. We use Conditional Value at Risk (CVaR)-based VQE algorithm to solve the optimization problems, originating from the mRNA structure prediction problem, on the IBM Eagle and Heron quantum processors. To our encouragement, even with ``minimal'' error mitigation and fixed-depth circuits, our hardware runs yield accurate predictions of minimum free energy (MFE) structures that match the results of the classical solver CPLEX. Our results provide sufficient evidence for the viability of solving mRNA structure prediction problems on a quantum computer and motivate continued research in this direction.

2405.20328v1

Improving the Fidelity of CNOT Circuits on NISQ Hardware

We introduce an improved CNOT synthesis algorithm that considers nearest-neighbour interactions and CNOT gate error rates in noisy intermediate-scale quantum (NISQ) hardware. Compared to IBM's Qiskit compiler, it improves the fidelity of a synthesized CNOT circuit by about 2 times on average (up to 9 times). It lowers the synthesized CNOT count by a factor of 13 on average (up to a factor of 162). Our contribution is twofold. First, we define a $\textsf{Cost}$ function by approximating the average gate fidelity $F_{avg}$. According to the simulation results, $\textsf{Cost}$ fits the error probability of a noisy CNOT circuit, $\textsf{Prob} = 1 - F_{avg}$, much tighter than the commonly used cost functions. On IBM's fake Nairobi backend, it matches $\textsf{Prob}$ to within $10^{-3}$. On other backends, it fits $\textsf{Prob}$ to within $10^{-1}$. $\textsf{Cost}$ accurately quantifies the dynamic error characteristics and shows remarkable scalability. Second, we propose a noise-aware CNOT routing algorithm, NAPermRowCol, by adapting the leading Steiner-tree-based connectivity-aware CNOT synthesis algorithms. A weighted edge is used to encode a CNOT gate error rate and $\textsf{Cost}$-instructed heuristics are applied to each reduction step. NAPermRowCol does not use ancillary qubits and is not restricted to certain initial qubit maps. Compared with algorithms that are noise-agnostic, it improves the fidelity of a synthesized CNOT circuit across varied NISQ hardware. Depending on the benchmark circuit and the IBM backend selected, it lowers the synthesized CNOT count up to $56.95\%$ compared to ROWCOL and up to $21.62\%$ compared to PermRowCol. It reduces the synthesis $\textsf{Cost}$ up to $25.71\%$ compared to ROWCOL and up to $9.12\%$ compared to PermRowCol. Our method can be extended to route a more general quantum circuit, giving a powerful new tool for compiling on NISQ devices.

2405.19891v1

Device-independent dimension leakage null test on qubits at low operational cost

We construct a null test of the two-level space of a qubit, which is both device independent and needs a small number of different experiments. We demonstrate its feasibility on IBM Quantum, with most qubits failing the test by more than 10 standard deviations. The robustness of the test against common technical imperfections, like decoherence and phase shifts, and supposedly negligible leakage, indicates that the origin of deviations is beyond known effects.

2405.18827v2

STIQ: Safeguarding Training and Inferencing of Quantum Neural Networks from Untrusted Cloud

The high expenses imposed by current quantum cloud providers, coupled with the escalating need for quantum resources, may incentivize the emergence of cheaper cloud-based quantum services from potentially untrusted providers. Deploying or hosting quantum models, such as Quantum Neural Networks (QNNs), on these untrusted platforms introduces a myriad of security concerns, with the most critical one being model theft. This vulnerability stems from the cloud provider's full access to these circuits during training and/or inference. In this work, we introduce STIQ, a novel ensemble-based strategy designed to safeguard QNNs against such cloud-based adversaries. Our method innovatively trains two distinct QNNs concurrently, hosting them on same or different platforms, in a manner that each network yields obfuscated outputs rendering the individual QNNs ineffective for adversaries operating within cloud environments. However, when these outputs are combined locally (using an aggregate function), they reveal the correct result. Through extensive experiments across various QNNs and datasets, our technique has proven to effectively masks the accuracy and losses of the individually hosted models by upto 76\%, albeit at the expense of $\leq 2\times$ increase in the total computational overhead. This trade-off, however, is a small price to pay for the enhanced security and integrity of QNNs in a cloud-based environment prone to untrusted adversaries. We also demonstrated STIQ's practical application by evaluating it on real 127-qubit IBM\_Sherbrooke hardware, showing that STIQ achieves up to 60\% obfuscation, with combined performance comparable to an unobfuscated model.

2405.18746v1

Efficient Quantum Circuit Encoding of Object Information in 2D Ray Casting

Quantum computing holds the potential to solve problems that are practically unsolvable by classical computers due to its ability to significantly reduce time complexity. We aim to harness this potential to enhance ray casting, a pivotal technique in computer graphics for simplifying the rendering of 3D objects. To perform ray casting in a quantum computer, we need to encode the defining parameters of primitives into qubits. However, during the current noisy intermediate-scale quantum (NISQ) era, challenges arise from the limited number of qubits and the impact of noise when executing multiple gates. Through logic optimization, we reduced the depth of quantum circuits as well as the number of gates and qubits. As a result, the event count of correct measurements from an IBM quantum computer significantly exceeded that of incorrect measurements.

2405.16132v1

Qudit-Generalization of the Qubit Echo and Its Application to a Qutrit-Based Toffoli Gate

The fidelity of certain gates on noisy quantum computers may be improved when they are implemented using more than two levels of the involved transmons. The main impediments to achieving this potential are the dynamic gate phase errors that cannot be corrected via calibration. The standard tool for countering such phase errors in two-level qubits is the echo protocol, often referred to as the dynamical decoupling sequence, where the evolution of a qubit is punctuated by an even number of X gates. We introduce basis cycling, which is a direct generalization of the qubit echo to general qudits, and provide an analytic framework for designing gate sequences to produce desired effects using this technique. We then apply basis cycling to a Toffoli gate decomposition incorporating a qutrit and obtain CCZ gate fidelity values up to 93.8$\pm$0.1%, measured by quantum process tomography, on IBM quantum computers. The gate fidelity remains stable without recalibration even while the resonant frequency of the qutrit fluctuates, highlighting the dynamical nature of phase error cancellation through basis cycling. Our results demonstrate that one of the biggest difficulties in implementing qudit-based gate decompositions on superconducting quantum computers can be systematically overcome when certain conditions are met, and thus open a path toward fulfilling the promise of qudits as circuit optimization agents.

2405.14752v2

Towards a universal QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems

The quantum approximate optimization algorithm (QAOA) is a promising algorithm for solving combinatorial optimization problems (COPs). In this algorithm, there are alternating layers consisting of a mixer and a problem Hamiltonian. Each layer $i=0,\ldots,p-1$ is parameterized by $\beta_i$ and $\gamma_i$. How to find these parameters has been an open question with the majority of the research focused on finding them using classical algorithms. In this work, we present evidence that fixed linear ramp schedules constitute a universal set of QAOA parameters, i.e., a set of $\gamma$ and $\beta$ parameters that rapidly approximate the optimal solution, $x^*$, independently of the COP selected, and that the success probability of finding it, $probability(x^*)$, increases with the number of QAOA layers $p$. We simulate linear ramp QAOA protocols (LR-QAOA) involving up to $N_q=42$ qubits and $p = 400$ layers on random instances of 9 different COPs. The results suggest that $probability(x^*) \approx 1/2^{(\eta N_q / p)}$ for a constant $\eta$. For example, when implementing LR-QAOA with $p=42$, the $probability(x^*)$ for 42-qubit Weighted MaxCut problems (W-MaxCut) increases from $2/2^{42}\approx 10^{-13}$ to an average of 0.13. We compare LR-QAOA, simulated annealing (SA), and branch-and-bound (B\&B) finding a scaling improvement in LR-QAOA. We test LR-QAOA on real hardware using IonQ Aria, Quantinuum H2-1, IBM Brisbane, IBM Kyoto, and IBM Osaka, encoding random weighted MaxCut (W-MaxCut) problems from 5 to 109 qubits and $p=3$ to $100$. Even for the largest case, $N_q=109$ qubits and $p=100$, information about the LR-QAOA optimization protocol is present. The circuit involved requires 21200 CNOT gates. These results show that LR-QAOA effectively finds high-quality solutions for a large variety of COPs and suggest a scaling advantage of quantum computation for combinatorial optimization.

2405.09169v2

Full Band Structure Calculation of Semiconducting Materials on a Noisy Quantum Processor

Quantum chemistry is a promising application in the era of quantum computing since the unique effects of quantum mechanics that take exponential growing resources to simulate classically are controllable on quantum computers. Fermionic degrees of freedom can be encoded efficiently onto qubits and allow for algorithms such as the Quantum Equation-of-Motion method to find the entire energy spectrum of a quantum system. In this paper, we propose the Reduced Quantum Equation-of-Motion method by reducing the dimensionality of its generalized eigenvalue equation, which results in half the measurements required compared to the Quantum Equation-of-Motion method, leading to speed up the algorithm and less noise accumulation on real devices. In particular, we analyse the performance of our method on two noise models and calculate the excitation energies of a bulk Silicon and Gallium Arsenide using our method on an IBM quantum processor. Our method is fully robust to the uniform depolarizing error and we demonstrate that the selection of suitable atomic orbital complexity could increase the robustness of our algorithm under real noise. We also find that taking the average of multiple experiments tends towards the correct energies due to the fluctuations around the exact values. Such noise resilience of our approach could be used on current quantum devices to solve quantum chemistry problems.

2405.09122v1

Graph Neural Networks for Parameterized Quantum Circuits Expressibility Estimation

Parameterized quantum circuits (PQCs) are fundamental to quantum machine learning (QML), quantum optimization, and variational quantum algorithms (VQAs). The expressibility of PQCs is a measure that determines their capability to harness the full potential of the quantum state space. It is thus a crucial guidepost to know when selecting a particular PQC ansatz. However, the existing technique for expressibility computation through statistical estimation requires a large number of samples, which poses significant challenges due to time and computational resource constraints. This paper introduces a novel approach for expressibility estimation of PQCs using Graph Neural Networks (GNNs). We demonstrate the predictive power of our GNN model with a dataset consisting of 25,000 samples from the noiseless IBM QASM Simulator and 12,000 samples from three distinct noisy quantum backends. The model accurately estimates expressibility, with root mean square errors (RMSE) of 0.05 and 0.06 for the noiseless and noisy backends, respectively. We compare our model's predictions with reference circuits [Sim and others, QuTe'2019] and IBM Qiskit's hardware-efficient ansatz sets to further evaluate our model's performance. Our experimental evaluation in noiseless and noisy scenarios reveals a close alignment with ground truth expressibility values, highlighting the model's efficacy. Moreover, our model exhibits promising extrapolation capabilities, predicting expressibility values with low RMSE for out-of-range qubit circuits trained solely on only up to 5-qubit circuit sets. This work thus provides a reliable means of efficiently evaluating the expressibility of diverse PQCs on noiseless simulators and hardware.

2405.08100v1

Robust shallow shadows

We present a robust shadow estimation protocol for wide classes of shallow measurement circuits that mitigates noise as long as the effective measurement map is locally unitarily invariant. This is in practice an excellent approximation, encompassing for instance the case of ideal single-qubit Clifford gates composing the first circuit layer of an otherwise arbitrary circuit architecture and even non-Markovian, gate-dependent noise in the rest of the circuit. We argue that for approximately local noise the measurement channel has an efficient matrix-product (tensor-train) representation, and show how to estimate this directly from experimental data using tensor-network tools, eliminating the need for analytical or numeric calculations. We illustrate the relevance of our method with both numerics and proof-of-principle experiments on an IBM Q device. Numerically, we show that, while unmitigated shallow shadows with noisy circuits become more biased as the depth increases, robust ones become more accurate for relevant parameter regimes. Experimentally, we observe major bias reductions in two simple fidelity estimation tasks using 5-qubit circuits with up to 2 layers of entangling gates using the mitigated variant, of close to an order of magnitude for $10^4$ measurement shots, e.g. Under the practical constraints of current and near-term noisy quantum devices, our method maximally realizes the potential of shadow estimation with global rotations.

2405.06022v1

Resource-Efficient and Self-Adaptive Quantum Search in a Quantum-Classical Hybrid System

Over the past decade, the rapid advancement of deep learning and big data applications has been driven by vast datasets and high-performance computing systems. However, as we approach the physical limits of semiconductor fabrication in the post-Moore's Law era, questions arise about the future of these applications. In parallel, quantum computing has made significant progress with the potential to break limits. Major companies like IBM, Google, and Microsoft provide access to noisy intermediate-scale quantum (NISQ) computers. Despite the theoretical promise of Shor's and Grover's algorithms, practical implementation on current quantum devices faces challenges, such as demanding additional resources and a high number of controlled operations. To tackle these challenges and optimize the utilization of limited onboard qubits, we introduce ReSaQuS, a resource-efficient index-value searching system within a quantum-classical hybrid framework. Building on Grover's algorithm, ReSaQuS employs an automatically managed iterative search approach. This method analyzes problem size, filters fewer probable data points, and progressively reduces the dataset with decreasing qubit requirements. Implemented using Qiskit and evaluated through extensive experiments, ReSaQuS has demonstrated a substantial reduction, up to 86.36\% in cumulative qubit consumption and 72.72\% in active periods, reinforcing its potential in optimizing quantum computing application deployment.

2405.04490v1

Data augmentation experiments with style-based quantum generative adversarial networks on trapped-ion and superconducting-qubit technologies

In the current noisy intermediate scale quantum computing era, and after the significant progress of the quantum hardware we have seen in the past few years, it is of high importance to understand how different quantum algorithms behave on different types of hardware. This includes whether or not they can be implemented at all and, if so, what the quality of the results is. This work quantitatively demonstrates, for the first time, how the quantum generator architecture for the style-based quantum generative adversarial network (qGAN) can not only be implemented but also yield good results on two very different types of hardware for data augmentation: the IBM bm_torino quantum computer based on the Heron chip using superconducting transmon qubits and the aria-1 IonQ quantum computer based on trapped-ion qubits. The style-based qGAN, proposed in 2022, generalizes the state of the art for qGANs and allows for shallow-depth networks. The results obtained on both devices are of comparable quality, with the aria-1 device delivering somewhat more accurate results than the ibm_torino device, while the runtime on ibm_torino is significantly shorter than on aria-1. Parallelization of the circuits, using up to 48 qubits on IBM quantum systems and up to 24 qubits on the IonQ system, is also presented, reducing the number of submitted jobs and allowing for a substantial reduction of the runtime on the quantum processor to generate the total number of samples.

2405.04401v1

Quantum Circuit Learning on NISQ Hardware

Current quantum computers are small and error-prone systems for which the term noisy intermediate-scale quantum (NISQ) has become established. Since large scale, fault-tolerant quantum computers are not expected to be available in the near future, the task of finding NISQ suitable algorithms has received a lot of attention in recent years. The most prominent candidates in this context are variational quantum algorithms. Due to their hybrid quantum-classical architecture they require fewer qubits and quantum gates so that they can cope with the limitations of NISQ computers. An important class of variational quantum algorithms is the quantum circuit learning (QCL) framework. Consisting of a data encoding and a trainable, parametrized layer, these schemes implement a quantum model function that can be fitted to the problem at hand. For instance, in combination with the parameter shift rule to compute derivatives, they can be used to solve differential equations. QCL and related algorithms have been widely studied in the literature. However, numerical experiments are usually limited to simulators and results from real quantum computers are scarce. In this paper we close this gap by executing QCL circuits on a superconducting IBM quantum processor in conjunction with an analysis of the hardware errors. We show that exemplary QCL circuits with up to three qubits are executable on the IBM quantum computer. For this purpose, multiple functions are learned and an exemplary differential equation is solved on the quantum computer. Moreover, we present how the QCL framework can be used to learn different quantum model functions in parallel, which can be applied to solve coupled differential equations in an efficient way.

2405.02069v1

The impact of noise on the simulation of NMR spectroscopy on NISQ devices

We present the simulation of nuclear magnetic resonance (NMR) spectroscopy of small organic molecules with two promising quantum computing platforms, namely IBM's quantum processors based on superconducting qubits and IonQ's Aria trapped ion quantum computer addressed via Amazon Braket. We analyze the impact of noise on the obtained NMR spectra, and we formulate an effective decoherence rate that quantifies the threshold noise that our proposed algorithm can tolerate. Furthermore we showcase how our noise analysis allows us to improve the spectra. Our investigations pave the way to better employ such application-driven quantum tasks on current noisy quantum devices.

2404.18903v2

Quantum Benchmarking via Random Dynamical Quantum Maps

We present a benchmarking protocol for universal quantum computers, achieved through the simulation of random dynamical quantum maps. This protocol provides a holistic assessment of system-wide error rates, encapsulating both gate inaccuracies and the errors associated with mid-circuit qubit measurements and resets. By employing random quantum circuits and segmenting mid-circuit qubit measurement and reset in a repeated fashion, we steer the system of qubits to an ensemble of steady-states. These steady-states are described by random Wishart matrices, and align with the steady-state characteristics previously identified in random Lindbladian dynamics, including the universality property. The protocol assesses the resulting ensemble probability distribution measured in the computational basis, effectively avoiding a tomographic reconstruction. Our various numerical simulations demonstrate the relationship between the final distribution and different error sources. Additionally, we implement the protocol on state-of-the-art transmon qubits provided by IBM Quantum, drawing comparisons between empirical results, theoretical expectations, and simulations derived from a fitted noise model of the device.

2404.18846v1

XGSwap: eXtreme Gradient boosting Swap for Routing in NISQ Devices

In the current landscape of noisy intermediate-scale quantum (NISQ) computing, the inherent noise presents significant challenges to achieving high-fidelity long-range entanglement. Furthermore, this challenge is amplified by the limited connectivity of current superconducting devices, necessitating state permutations to establish long-distance entanglement. Traditionally, graph methods are used to satisfy the coupling constraints of a given architecture by routing states along the shortest undirected path between qubits. In this work, we introduce a gradient boosting machine learning model to predict the fidelity of alternative--potentially longer--routing paths to improve fidelity. This model was trained on 4050 random CNOT gates ranging in length from 2 to 100+ qubits. The experiments were all executed on ibm_quebec, a 127-qubit IBM Quantum System One. Through more than 200+ tests run on actual hardware, our model successfully identified higher fidelity paths in approximately 23% of cases.

2404.17982v1

Exploiting many-body localization for scalable variational quantum simulation

Variational quantum algorithms have emerged as a promising approach to achieving practical quantum advantages using near-term quantum devices. Despite their potential, the scalability of these algorithms poses a significant challenge. This is largely attributed to the "barren plateau" phenomenon, which persists even in the absence of noise. In this work, we explore the many-body localization (MBL)-thermalization phase transitions within a framework of Floquet-initialized variational quantum circuits and investigate how MBL could be used to avoid barren plateaus. The phase transitions are observed through calculations of the inverse participation ratio, the entanglement entropy, and a metric termed low-weight stabilizer R\'enyi entropy. By initializing the circuit in the MBL phase and employing an easily preparable initial state, we find it is possible to prevent the formation of a unitary 2-design, resulting in an output state with entanglement that follows an area- rather than a volume-law, and which circumvents barren plateaus throughout the optimization. Utilizing this methodology, we successfully determine the ground states of various model Hamiltonians across different phases and show that the resources required for the optimization are significantly reduced. We have further validated the MBL approach through experiments carried out on the 127-qubit $ibm\_brisbane$ quantum processor. These experiments confirm that the gradients needed to carry out variational calculations are restored in the MBL phase of a Heisenberg model subject to random unitary "kicks". These results provide new insights into the interplay between MBL and quantum computing, and suggest that the role of MBL states should be considered in the design of quantum algorithms.

2404.17560v2

Creating entangled logical qubits in the heavy-hex lattice with topological codes

Designs for quantum error correction depend strongly on the connectivity of the qubits. For solid state qubits, the most straightforward approach is to have connectivity constrained to a planar graph. Practical considerations may also further restrict the connectivity, resulting in a relatively sparse graph such as the heavy-hex architecture of current IBM Quantum devices. In such cases it is hard to use all qubits to their full potential. Instead, in order to emulate the denser connectivity required to implement well-known quantum error correcting codes, many qubits remain effectively unused. In this work we show how this bug can be turned into a feature. By using the unused qubits of one code to execute another, two codes can be implemented on top of each other, allowing easy application of fault-tolerant entangling gates and measurements. We demonstrate this by realizing a surface code and a Bacon-Shor code on a 133 qubit IBM Quantum device. Using transversal CX gates and lattice surgery we demonstrate entanglement between these logical qubits with code distance up to $d = 4$ and five rounds of stabilizer measurement cycles. The nonplanar coupling between the qubits allows us to simultaneously measure the logical $XX$, $YY$, and $ZZ$ observables. With this we verify the violation of Bell's inequality for both the $d=2$ case with post selection featuring a fidelity of $94\%$, and the $d=3$ instance using only quantum error correction.

2404.15989v1

PristiQ: A Co-Design Framework for Preserving Data Security of Quantum Learning in the Cloud

Benefiting from cloud computing, today's early-stage quantum computers can be remotely accessed via the cloud services, known as Quantum-as-a-Service (QaaS). However, it poses a high risk of data leakage in quantum machine learning (QML). To run a QML model with QaaS, users need to locally compile their quantum circuits including the subcircuit of data encoding first and then send the compiled circuit to the QaaS provider for execution. If the QaaS provider is untrustworthy, the subcircuit to encode the raw data can be easily stolen. Therefore, we propose a co-design framework for preserving the data security of QML with the QaaS paradigm, namely PristiQ. By introducing an encryption subcircuit with extra secure qubits associated with a user-defined security key, the security of data can be greatly enhanced. And an automatic search algorithm is proposed to optimize the model to maintain its performance on the encrypted quantum data. Experimental results on simulation and the actual IBM quantum computer both prove the ability of PristiQ to provide high security for the quantum data while maintaining the model performance in QML.

2404.13475v1

Qubit dynamics driven by smooth pulses of finite duration

We present a study of the dynamics of a qubit driven by a pulsed field of finite duration. The pulse shape starts and ends linearly in time. The most typical example of such a shape is the sine function between two of its nodes, but several other pulse shapes are also studied. All of them present smooth alternatives to the commonly used rectangular pulse shape, resulting in much weaker power broadening, much faster vanishing wings in the excitation line profile and hence much reduced sidebands. In the same time, such shapes with a well-defined finite duration do not suffer from the spurious effects arising when truncating a pulse of infinite duration, e.g. Gaussian. We derive two approximate analytic solutions which describe the ensuing quantum dynamics. Both approximations assume that the field changes linearly at the beginning and the end of the driving pulse, and adiabatically in between. The first approximation matches the linear and adiabatic parts at an appropriate instant of time and is expressed in terms of Weber's parabolic cylinder functions. The second, much simpler, approximation uses the asymptotics of the Weber function in order to replace it by simpler functions, and some additional transformations. Both approximations prove highly accurate when compared to experimental data obtained with two of the IBM Quantum processors. Both the greatly reduced power broadening and the greatly suppressed sidebands are observed for all pulse shapes, in a nearly complete agreement between theory and experiment.

2404.12236v1

Dynamical Mean Field Theory for Real Materials on a Quantum Computer

Quantum computers (QC) could harbor the potential to significantly advance materials simulations, particularly at the atomistic scale involving strongly correlated fermionic systems where an accurate description of quantum many-body effects scales unfavorably with size. While a full-scale treatment of condensed matter systems with currently available noisy quantum computers remains elusive, quantum embedding schemes like dynamical mean-field theory (DMFT) allow the mapping of an effective, reduced subspace Hamiltonian to available devices to improve the accuracy of ab initio calculations such as density functional theory (DFT). Here, we report on the development of a hybrid quantum-classical DFT+DMFT simulation framework which relies on a quantum impurity solver based on the Lehmann representation of the impurity Green's function. Hardware experiments with up to 14 qubits on the IBM Quantum system are conducted, using advanced error mitigation methods and a novel calibration scheme for an improved zero-noise extrapolation to effectively reduce adverse effects from inherent noise on current quantum devices. We showcase the utility of our quantum DFT+DMFT workflow by assessing the correlation effects on the electronic structure of a real material, Ca2CuO2Cl2, and by carefully benchmarking our quantum results with respect to exact reference solutions and experimental spectroscopy measurements.

2404.09527v1

Quantum subspace expansion in the presence of hardware noise

Finding ground state energies on current quantum processing units (QPUs) using algorithms like the variational quantum eigensolver (VQE) continues to pose challenges. Hardware noise severely affects both the expressivity and trainability of parametrized quantum circuits, limiting them to shallow depths in practice. Here, we demonstrate that both issues can be addressed by synergistically integrating VQE with a quantum subspace expansion, allowing for an optimal balance between quantum and classical computing capabilities and costs. We perform a systematic benchmark analysis of the iterative quantum-assisted eigensolver of [K. Bharti and T. Haug, Phys. Rev. A {\bf 104}, L050401 (2021)] in the presence of hardware noise. We determine ground state energies of 1D and 2D mixed-field Ising spin models on noisy simulators and on the IBM QPUs ibmq_quito (5 qubits) and ibmq_guadalupe (16 qubits). To maximize accuracy, we propose a suitable criterion to select the subspace basis vectors according to the trace of the noisy overlap matrix. Finally, we show how to systematically approach the exact solution by performing controlled quantum error mitigation based on probabilistic error reduction on the noisy backend fake_guadalupe.

2404.09132v1

Qubit frugal entanglement determination with the deep multi-scale entanglement renormalization ansatz

We study the deep multi-scale entanglement renormalization ansatz (DMERA) on quantum hardware and the causal cone of a subset of the qubits which make up the ansatz. This causal cone spans $O(M+\log{N})$ physical qubits on a quantum device, where $M$ and $N$ are the subset size and the total number qubits in the ansatz respectively. This allows for the determination of the von Neumann entanglement entropy of the $N$ qubit wave-function using $O(M+\log{N})$ qubits by diagonalization of the reduced density matrix (RDM). We show this by randomly initializing a 16-qubit DMERA and diagonalizing the resulting RDM of the $M$-qubit subsystem using density matrix simulation. As an example of practical interest, we also encode the variational ground state of the quantum critical long-range transverse field Ising model (LRTIM) on 8 spins using DMERA. We perform density matrix simulation with and without noise to obtain entanglement entropies in separate experiments using only 4 qubits. Finally we repeat the experiment on the IBM Kyoto backend reproducing simulation results.

2404.08548v2

Certifying the qubit space with a minimal number of parameters

We present a precise certification test of the dimension of a qubit system on the public IBM quantum computer, using the determinant dimension witness and with a minimal number of independent parameters. We achieve it by mapping the Bloch sphere $\pi/2$-rotation axis angle on the nonplanar so-called Viviani curve. During the implementation of the rotation by single qubit gates on IBM devices, we found the majority of qubits passing the test, although some specific qubits failed by more than ten standard deviations. The nature of those deviations has no simple explanation, as the test is robust against common non-idealities.

2404.06792v1

Learning to rank quantum circuits for hardware-optimized performance enhancement

We introduce and experimentally test a machine-learning-based method for ranking logically equivalent quantum circuits based on expected performance estimates derived from a training procedure conducted on real hardware. We apply our method to the problem of layout selection, in which abstracted qubits are assigned to physical qubits on a given device. Circuit measurements performed on IBM hardware indicate that the maximum and median fidelities of logically equivalent layouts can differ by an order of magnitude. We introduce a circuit score used for ranking that is parameterized in terms of a physics-based, phenomenological error model whose parameters are fit by training a ranking-loss function over a measured dataset. The dataset consists of quantum circuits exhibiting a diversity of structures and executed on IBM hardware, allowing the model to incorporate the contextual nature of real device noise and errors without the need to perform an exponentially costly tomographic protocol. We perform model training and execution on the 16-qubit ibmq_guadalupe device and compare our method to two common approaches: random layout selection and a publicly available baseline called Mapomatic. Our model consistently outperforms both approaches, predicting layouts that exhibit lower noise and higher performance. In particular, we find that our best model leads to a $1.8\times$ reduction in selection error when compared to the baseline approach and a $3.2\times$ reduction when compared to random selection. Beyond delivering a new form of predictive quantum characterization, verification, and validation, our results reveal the specific way in which context-dependent and coherent gate errors appear to dominate the divergence from performance estimates extrapolated from simple proxy measures.

2404.06535v1

Accurate and precise quantum computation of valence two-neutron systems

Developing methods to solve nuclear many-body problems with quantum computers is an imperative pursuit within the nuclear physics community. Here, we introduce a quantum algorithm to accurately and precisely compute the ground state of valence two-neutron systems leveraging presently available Noisy Intermediate-Scale Quantum devices. Our focus lies on the nuclei having a doubly-magic core plus two valence neutrons in the $ p $, $ sd $, and $ pf $ shells, i.e. ${}^6$He, ${}^{18}$O, and ${}^{42}$Ca, respectively. Our ansatz, quantum circuit, is constructed in the pair-wise form, taking into account the symmetries of the system in an explicit manner, and enables us to reduce the number of qubits and the number of CNOT gates required. The results on a real quantum hardware by IBM Quantum Platform show that the proposed method gives very accurate results of the ground-state energies, which are typically within $ 0.1 \, \% $ error in the energy for ${}^6$He and ${}^{18}$O and at most $ 1 \, \% $ error for ${}^{42}$Ca. Furthermore, our experiments using real quantum devices also show the pivotal role of the circuit layout design, attuned to the connectivity of the qubits, in mitigating errors.

2404.01694v2

qIoV: A Quantum-Driven Internet-of-Vehicles-Based Approach for Environmental Monitoring and Rapid Response Systems

This research addresses the critical necessity for advanced rapid response operations in managing a spectrum of environmental hazards. We propose a novel framework, qIoV that integrates quantum computing with the Internet-of-Vehicles (IoV) to leverage the computational efficiency, parallelism, and entanglement properties of quantum mechanics. Our approach involves the use of environmental sensors mounted on vehicles for precise air quality assessment. These sensors are designed to be highly sensitive and accurate, leveraging the principles of quantum mechanics to detect and measure environmental parameters. A salient feature of our proposal is the Quantum Mesh Network Fabric (QMF), a system designed to dynamically adjust the quantum network topology in accordance with vehicular movements. This capability is critical to maintaining the integrity of quantum states against environmental and vehicular disturbances, thereby ensuring reliable data transmission and processing. Moreover, our methodology is further augmented by the incorporation of a variational quantum classifier (VQC) with advanced quantum entanglement techniques. This integration offers a significant reduction in latency for hazard alert transmission, thus enabling expedited communication of crucial data to emergency response teams and the public. Our study on the IBM OpenQSAM 3 platform, utilizing a 127 Qubit system, revealed significant advancements in pair plot analysis, achieving over 90% in precision, recall, and F1-Score metrics and an 83% increase in the speed of toxic gas detection compared to conventional methods.Additionally, theoretical analyses validate the efficiency of quantum rotation, teleportation protocols, and the fidelity of quantum entanglement, further underscoring the potential of quantum computing in enhancing analytical performance.

2403.18622v1

Nonlinear dynamics as a ground-state solution on quantum computers

For the solution of time-dependent nonlinear differential equations, we present variational quantum algorithms (VQAs) that encode both space and time in qubit registers. The spacetime encoding enables us to obtain the entire time evolution from a single ground-state computation. We describe a general procedure to construct efficient quantum circuits for the cost function evaluation required by VQAs. To mitigate the barren plateau problem during the optimization, we propose an adaptive multigrid strategy. The approach is illustrated for the nonlinear Burgers equation. We classically optimize quantum circuits to represent the desired ground-state solutions, run them on IBM Q System One and Quantinuum System Model H1, and demonstrate that current quantum computers are capable of accurately reproducing the exact results.

2403.16791v2

Unveiling clean two-dimensional discrete time quasicrystals on a digital quantum computer

In periodically driven (Floquet) systems, evolution typically results in an infinite-temperature thermal state due to continuous energy absorption over time. However, before reaching thermal equilibrium, such systems may transiently pass through a meta-stable state known as a prethermal state. This prethermal state can exhibit phenomena not commonly observed in equilibrium, such as discrete time crystals (DTCs), making it an intriguing platform for exploring out-of-equilibrium dynamics. Here, we investigate the relaxation dynamics of initially prepared product states under periodic driving in a kicked Ising model using the IBM Quantum Heron processor, comprising 133 superconducting qubits arranged on a heavy-hexagonal lattice, over up to $100$ time steps. We identify the presence of a prethermal regime characterised by magnetisation measurements oscillating at twice the period of the Floquet cycle and demonstrate its robustness against perturbations to the transverse field. Our results provide evidence supporting the realisation of a period-doubling DTC in a two-dimensional system. Moreover, we discover that the longitudinal field induces additional amplitude modulations in the magnetisation with a period incommensurate with the driving period, leading to the emergence of discrete time quasicrystals (DTQCs). These observations are further validated through comparison with tensor-network and state-vector simulations. Our findings not only enhance our understanding of clean DTCs in two dimensions but also highlight the utility of digital quantum computers for simulating the dynamics of quantum many-body systems, addressing challenges faced by state-of-the-art classical simulations.

2403.16718v1

Direct Probe of Topology and Geometry of Quantum States on IBM Q

The concepts of topology and geometry are of critical importance in exploring exotic phases of quantum matter. Though they have been investigated on various experimental platforms, to date a direct probe of topological and geometric properties on a universal quantum computer even for a minimum model is still in vain. In this work, we first show that a density matrix form of the quantum geometric tensor (QGT) can be explicitly re-constructed from Pauli operator measurements on a quantum circuit. We then propose two algorithms, suitable for IBM quantum computers, to directly probe QGT. The first algorithm is a variational quantum algorithm particularly suitable for Noisy Intermediate-Scale Quantum (NISQ)-era devices, whereas the second one is a pure quantum algorithm based on quantum imaginary time evolution. Explicit results obtained from IBM Q simulating a Chern insulator model are presented and analysed. Our results indicate that transmon qubit-based universal quantum computers have the potential to directly simulate and investigate topological and geometric properties of a quantum system.

2403.14249v2

Average circuit eigenvalue sampling on NISQ devices

Average circuit eigenvalue sampling (ACES) was introduced by Flammia in arXiv:2108.05803 as a protocol to characterize the Pauli error channels of individual gates across the device simultaneously. The original paper posed using ACES to characterize near-term devices as an open problem. This work advances in this direction by presenting a full implementation of ACES for real devices and deploying it to Superstaq arXiv:2309.05157, along with a device-tailored resource estimation obtained through simulations and experiments. Our simulations show that ACES is able to estimate one- and two-qubit non-uniform Pauli error channels to an average eigenvalue absolute error of under $0.003$ and total variation distance of under 0.001 between simulated and reconstructed probability distributions over Pauli errors with $10^5$ shots per circuit using 5 circuits of depth 14. The question of estimating general error channels through twirling techniques in real devices remains open, as it is dependent on a device's native gates, but simulations with the Clifford set show results in agreement with reported hardware data. Experimental results on IBM's Algiers and Osaka devices are presented, where we characterize their error channels as Pauli channels without twirling.

2403.12857v2

Effectiveness of the syndrome extraction circuit with flag qubits on IBM quantum hardware

Large-scale quantum circuits are required to exploit the advantages of quantum computers. Present-day quantum computers have become less reliable with increasing depths of quantum circuits. To overcome this limitation, quantum error-correction codes have been introduced. Although the success of quantum error correction codes has been announced in Google[1, 2] and neutral atom[3] quantum computers, there have been no reports on IBM quantum computers showing error suppression owing to its unique heavy-hexagon structure. This structure restricts connectivity, and quantum error-correction codes on IBM quantum computers require flag qubits. Here, we report the successful implementation of a syndrome extraction circuit with flag qubits on IBM quantum computers. Moreover, we demonstrate its effectiveness by considering the repetition code as a test code among the quantum error-correcting codes. Even though the data qubit is not adjacent to the syndrome qubit, logical error rates diminish exponentially as the distance of the repetition code increases from three to nine. Even when two flag qubits exist between the data and syndrome qubits, the logical error rates decrease as the distance increases similarly. This confirms the successful implementation of the syndrome extraction circuit with flag qubits on the IBM quantum computer.

2403.10217v2

Quantum Fourier Transform using Dynamic Circuits

In dynamic quantum circuits, classical information from mid-circuit measurements is fed forward during circuit execution. This emerging capability of quantum computers confers numerous advantages that can enable more efficient and powerful protocols by drastically reducing the resource requirements for certain core algorithmic primitives. In particular, in the case of the $n$-qubit quantum Fourier transform followed immediately by measurement, the scaling of resource requirements is reduced from $O(n^2)$ two-qubit gates in an all-to-all connectivity in the standard unitary formulation to $O(n)$ mid-circuit measurements in its dynamic counterpart without any connectivity constraints. Here, we demonstrate the advantage of dynamic quantum circuits for the quantum Fourier transform on IBM's superconducting quantum hardware with certified process fidelities of $>50\%$ on up to $16$ qubits and $>1\%$ on up to $37$ qubits, exceeding previous reports across all quantum computing platforms. These results are enabled by our contribution of an efficient method for certifying the process fidelity, as well as of a dynamical decoupling protocol for error suppression during mid-circuit measurements and feed-forward within a dynamic quantum circuit that we call ``feed-forward-compensated dynamical decoupling" (FC-DD). Our results demonstrate the advantages of leveraging dynamic circuits in optimizing the compilation of quantum algorithms.

2403.09514v2

Simulation of a Diels-Alder Reaction on a Quantum Computer

The simulation of chemical reactions is an anticipated application of quantum computers. Using a Diels-Alder reaction as a test case, in this study we explore the potential applications of quantum algorithms and hardware in investigating chemical reactions. Our specific goal is to calculate the activation barrier of a reaction between ethylene and cyclopentadiene forming a transition state. To achieve this goal, we use quantum algorithms for near-term quantum hardware (entanglement forging and quantum subspace expansion) and classical post-processing (many-body perturbation theory) in concert. We conduct simulations on IBM quantum hardware using up to 8 qubits, and compute accurate activation barriers in the reaction between cyclopentadiene and ethylene by accounting for both static and dynamic electronic correlation. This work illustrates a hybrid quantum-classical computational workflow to study chemical reactions on near-term quantum devices, showcasing the potential of quantum algorithms and hardware in accurately calculating activation barriers.

2403.08107v1

Multi-qubit Dynamical Decoupling for Enhanced Crosstalk Suppression

Dynamical decoupling (DD) is one of the simplest error suppression methods, aiming to enhance the coherence of qubits in open quantum systems. Moreover, DD has demonstrated effectiveness in reducing coherent crosstalk, one major error source in near-term quantum hardware, which manifests from two types of interactions. Static crosstalk exists in various hardware platforms, including superconductor and semiconductor qubits, by virtue of always-on qubit-qubit coupling. Additionally, driven crosstalk may occur as an unwanted drive term due to leakage from driven gates on other qubits. Here we explore a novel staggered DD protocol tailored for multi-qubit systems that suppresses the decoherence error and both types of coherent crosstalk. We develop two experimental setups -- an "idle-idle" experiment in which two pairs of qubits undergo free evolution simultaneously and a "driven-idle" experiment in which one pair is continuously driven during the free evolution of the other pair. These experiments are performed on an IBM Quantum superconducting processor and demonstrate the significant impact of the staggered DD protocol in suppressing both types of coherent crosstalk. When compared to the standard DD sequences from state-of-the-art methodologies with the application of X2 sequences, our staggered DD protocol enhances circuit fidelity by 19.7% and 8.5%, respectively, in addressing these two crosstalk types.

2403.05391v3

Treespilation: Architecture- and State-Optimised Fermion-to-Qubit Mappings

Quantum computers hold great promise for efficiently simulating Fermionic systems, benefiting fields like quantum chemistry and materials science. To achieve this, algorithms typically begin by choosing a Fermion-to-qubit mapping to encode the Fermioinc problem in the qubits of a quantum computer. In this work, we introduce "treespilation," a technique for efficiently mapping Fermionic systems using a large family of favourable tree-based mappings previously introduced by some of the authors. We use this technique to minimise the number of CNOT gates required to simulate chemical groundstates found numerically using the ADAPT-VQE algorithm. We observe significant reductions, up to $74\%$, in CNOT counts on full connectivity and for limited qubit connectivity-type devices such as IBM Eagle and Google Sycamore, we observe similar reductions in CNOT counts. In many instances, the reductions achieved on these limited connectivity devices even surpass the initial full connectivity CNOT count. Additionally, we find our method improves the CNOT and parameter efficiency of QEB- and qubit-ADAPT-VQE, which are, to our knowledge, the most CNOT-efficient VQE protocols for molecular state preparation.

2403.03992v3

Experimental demonstration of scalable cross-entropy benchmarking to detect measurement-induced phase transitions on a superconducting quantum processor

Quantum systems subject to random unitary evolution and measurements at random points in spacetime exhibit entanglement phase transitions which depend on the frequency of these measurements. Past work has experimentally observed entanglement phase transitions on near-term quantum computers, but the characterization approach using entanglement entropy is not scalable due to exponential overhead of quantum state tomography and post selection. Recently, an alternative protocol to detect entanglement phase transitions using linear cross-entropy was proposed which eliminates both bottlenecks. Here, we report the demonstration of this protocol in systems with one-dimensional and all-to-all connectivities on IBM's quantum hardware on up to 22 qubits, a regime which is presently inaccessible if post-selection is required. We demonstrate a collapse of the data into a scale-invariant form with critical exponents agreeing with theory within uncertainty. Our demonstration paves the way for studies of measurement-induced entanglement phase transitions and associated critical phenomena on larger near-term quantum systems.

2403.00938v1

New Pathways in Neutrino Physics via Quantum-Encoded Data Analysis

Ever-increasing amount of data is produced by particle detectors in their quest to unveil the laws of Nature. The large data rate requires the use of specialized triggers that promptly reduce the data rate to a manageable level; however, in doing so, unexpected new phenomena may escape detection. Additionally, the large data rate is increasingly difficult to analyze effectively, which has led to a recent revolution on machine learning techniques. Here, we present a methodology based on recent quantum compression techniques that has the capacity to store exponentially more amount of information than classically available methods. To demonstrate this, we encode the full neutrino telescope event information using parity observables in an IBM quantum processor using 8 qubits. Then we show that we can recover the information stored on the quantum computer with a fidelity of 84%. Finally, we illustrate the use of our protocol by performing a classification task that separates electron-neutrino events to muon-neutrinos events in a neutrino telescope. This new capability would eventually allow us to solve the street light effect in particle physics, where we only record signatures of particles with which we are familiar.

2402.19306v2

Evaluating Ground State Energies of Chemical Systems with Low-Depth Quantum Circuits and High Accuracy

Solving electronic structure problems is considered one of the most promising applications of quantum computing. However, due to limitations imposed by the coherence time of qubits in the Noisy Intermediate Scale Quantum (NISQ) era or the capabilities of early fault-tolerant quantum devices, it is vital to design algorithms with low-depth circuits. In this work, we develop an enhanced Variational Quantum Eigensolver (VQE) ansatz based on the Qubit Coupled Cluster (QCC) approach, which demands optimization over only $n$ parameters rather than the usual $n+2m$ parameters, where $n$ represents the number of Pauli string time evolution gates $e^{-itP}$, and $m$ is the number of qubits involved. We evaluate the ground state energies of $\mathrm{O_3}$, $\mathrm{Li_4}$, and $\mathrm{Cr_2}$, using CAS(2,2), (4,4) and (6,6) respectively in conjunction with our enhanced QCC ansatz, UCCSD (Unitary Coupled Cluster Single Double) ansatz, and canonical CCSD method as the active space solver, and compare with CASCI results. Finally, we assess our enhanced QCC ansatz on two distinct quantum hardware, IBM Kolkata and Quantinuum H1-1.

2402.13960v1

SPAM-Robust Multi-axis Quantum Noise Spectroscopy in Temporally Correlated Environments

Characterizing temporally correlated (``non-Markovian'') noise is a key prerequisite for achieving noise-tailored error mitigation and optimal device performance. Quantum noise spectroscopy can afford quantitative estimation of the noise spectral features; however, in its current form it is highly vulnerable to implementation non-idealities, notably, state-preparation and measurement (SPAM) errors. Further to that, existing protocols have been mostly developed for dephasing-dominated noise processes, with competing dephasing and relaxation effects being largely unaccounted for. We introduce quantum noise spectroscopy protocols inspired by spin-locking techniques that enable the characterization of arbitrary temporally correlated multi-axis noise on a qubit with fixed energy splitting, while remaining resilient to realistic static SPAM errors. By validating our protocol's performance in both numerical simulation and cloud-based IBM quantum processors, we demonstrate the successful separation and estimation of native noise spectrum components as well as SPAM error rates. We find that SPAM errors can significantly alter or mask important noise features, with spectra overestimated by up to 26.4% in a classical noise regime. Clear signatures of non-classical noise are manifest in the reconstructed IBM-qubit dephasing spectra, once SPAM-error effects are compensated for. Our work provides a timely tool for benchmarking realistic sources of noise in qubit devices.

2402.12361v1