Entanglement in a 20-Qubit Superconducting Quantum Computer

Optimizing Josephson Junction Reproducibility in 30 kV E-Beam Lithography: An Analysis of Backscattered Electron Distribution

This paper explores methods to enhance the reproducibility of Josephson junctions, which are crucial elements in superconducting quantum technologies, when employing the Dolan technique in 30 kV e-beam processes. The study explores the influence of dose distribution along the bridge area on reproducibility, addressing challenges related to fabrication sensitivity. Experimental methods include e-beam lithography, with electron trajectory simulations shedding light on the behavior of backscattered electrons. Wedescribe the fabrication of various Josephson junction geometries and analyze the correlation between the success rates of different lithography patterns and the simulated distribution of backscattered electrons. Our findings demonstrate a success rate of up to 96.3% for the double-resist 1-step low-energy e-beam lithography process. As a means of implementation strategy, we provide a geometric example that takes advantage of simulated stability regions to administer a controlled, uniform dose across the junction area, introducing novel features to overcome the difficulties associated with fabricating bridge-like structures.

Qubit Condensation for Assessing Efficacy of Molecular Simulation on Quantum Computers

Quantum computers may demonstrate significant advantages over classical devices, as they are able to exploit a purely quantum-mechanical phenomenon known as entanglement in which a single quantum state simultaneously populates two-or-more classical configurations. However, due to environmental noise and device errors, elaborate quantum entanglement can be difficult to prepare on modern quantum computers. In this paper, we introduce a metric based on the condensation of qubits to assess the ability of a quantum device to simulate many-electron systems. Qubit condensation occurs when the qubits on a quantum computer condense into a single, highly correlated particle-hole state. While conventional metrics like gate errors and quantum volume do not directly target entanglement, the qubit-condensation metric measures the quantum computer's ability to generate an entangled state that achieves nonclassical long-range order across the device. To demonstrate, we prepare qubit condensations on various quantum devices and probe the degree to which qubit condensation is realized via postmeasurement analysis. We show that the predicted ranking of the quantum devices is consistent with the errors obtained from molecular simulations of H₂ using a contracted quantum eigensolver.

Efficient Decomposition of Unitary Matrices in Quantum Circuit Compilers

Unitary decomposition is a widely used method to map quantum algorithms to an arbitrary set of quantum gates. Efficient implementation of this decomposition allows for the translation of bigger unitary gates into elementary quantum operations, which is key to executing these algorithms on existing quantum computers. The decomposition can be used as an aggressive optimization method for the whole circuit, as well as to test part of an algorithm on a quantum accelerator. For the selection and implementation of the decomposition algorithm, perfect qubits are assumed. We base our decomposition technique on Quantum Shannon Decomposition, which generates O(344n) controlled-not gates for an n-qubit input gate. In addition, we implement optimizations to take advantage of the potential underlying structure in the input or intermediate matrices, as well as to minimize the execution time of the decomposition. Comparing our implementation to Qubiter and the UniversalQCompiler (UQC), we show that our implementation generates circuits that are much shorter than those of Qubiter and not much longer than the UQC. At the same time, it is also up to 10 times as fast as Qubiter and about 500 times as fast as the UQC.

Experimental classical entanglement in a 16 acoustic qubit-analogue

The possibility of achieving and controlling scalable classically entangled, i.e., inseparable, multipartite states, would fundamentally challenge the advantages of quantum systems in harnessing the power of complexity in information science. Here, we investigate experimentally the extent of classical entanglement in a \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$16$$\end{document}16 acoustic qubit-analogue platform. The acoustic qubit-analogue, a.k.a., logical phi-bit, results from the spectral partitioning of the nonlinear acoustic field of externally driven coupled waveguides. Each logical phi-bit is a two-level subsystem characterized by two independently measurable phases. The phi-bits are co-located within the same physical space enabling distance independent interactions. We chose a vector state representation of the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$16$$\end{document}16-phi-bit system which lies in a \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${2}^{16}$$\end{document}216-dimensional Hilbert space. The calculation of the entropy of entanglement demonstrates the possibility of achieving inseparability of the vector state and of navigating the corresponding Hilbert space. This work suggests a new direction in harnessing the complexity of classical inseparability in information science.

Deep neural networks for quantum circuit mapping

Quantum computers have become reality thanks to the effort of some majors in developing innovative technologies that enable the usage of quantum effects in computation, so as to pave the way towards the design of efficient quantum algorithms to use in different applications domains, from finance and chemistry to artificial and computational intelligence. However, there are still some technological limitations that do not allow a correct design of quantum algorithms, compromising the achievement of the so-called quantum advantage. Specifically, a major limitation in the design of a quantum algorithm is related to its proper mapping to a specific quantum processor so that the underlying physical constraints are satisfied. This hard problem, known as circuit mapping, is a critical task to face in quantum world, and it needs to be efficiently addressed to allow quantum computers to work correctly and productively. In order to bridge above gap, this paper introduces a very first circuit mapping approach based on deep neural networks, which opens a completely new scenario in which the correct execution of quantum algorithms is supported by classical machine learning techniques. As shown in experimental section, the proposed approach speeds up current state-of-the-art mapping algorithms when used on 5-qubits IBM Q processors, maintaining suitable mapping accuracy.

Universal separability criterion for arbitrary density matrices from causal properties of separable and entangled quantum states

General physical background of famous Peres-Horodecki positive partial transpose (PH- or PPT-) separability criterion is revealed. Especially, the physical sense of partial transpose operation is shown to be equivalent to what one could call as the "local causality reversal" (LCR-) procedure for all separable quantum systems or to the uncertainty in a global time arrow direction in all entangled cases. Using these universal causal considerations brand new general relations for the heuristic causal separability criterion have been proposed for arbitrary [Formula: see text] density matrices acting in [Formula: see text] Hilbert spaces which describe the ensembles of N quantum systems of D eigenstates each. Resulting general formulas have been then analyzed for the widest special type of one-parametric density matrices of arbitrary dimensionality, which model a number of equivalent quantum subsystems being equally connected (EC-) with each other to arbitrary degree by means of a single entanglement parameter p. In particular, for the family of such EC-density matrices it has been found that there exists a number of N- and D-dependent separability (or entanglement) thresholds [Formula: see text] for the values of the corresponded entanglement parameter p, which in the simplest case of a qubit-pair density matrix in [Formula: see text] Hilbert space are shown to reduce to well-known results obtained earlier independently by Peres (Phys Rev Lett 77:1413-1415, 1996) and Horodecki (Phys Lett A 223(1-2):1-8, 1996). As the result, a number of remarkable features of the entanglement thresholds for EC-density matrices has been described for the first time. All novel results being obtained for the family of arbitrary EC-density matrices are shown to be applicable to a wide range of both interacting and non-interacting (at the moment of measurement) multi-partite quantum systems, such as arrays of qubits, spin chains, ensembles of quantum oscillators, strongly correlated quantum many-body systems with the possibility of many-body localization, etc.

Entanglement and entropy squeezing in the system of two qubits interacting with a two-mode field in the context of power low potentials

We study the dynamics of two non-stationary qubits, allowing for dipole-dipole and Ising-like interplays between them, coupled to quantized fields in the framework of two-mode pair coherent states of power-low potentials. We focus on three particular cases of the coherent states through the exponent parameter taken infinite square, triangular and harmonic potential wells. We examine the possible effects of such features on the evolution of some quantities of current interest, such as population inversion, entanglement among subsystems and squeezing entropy. We show how these quantities can be affected by the qubit-qubit interaction and exponent parameter during the time evolution for both cases of stationary and non-stationary qubits. The obtained results suggest insights about the capability of quantum systems composed of nonstationary qubits to maintain resources in comparison with stationary qubits.

Identification of networking quantum teleportation on 14-qubit IBM universal quantum computer

Quantum teleportation enables networking participants to move an unknown quantum state between the nodes of a quantum network, and hence constitutes an essential element in constructing large-sale quantum processors with a quantum modular architecture. Herein, we propose two protocols for teleporting qubits through an N-node quantum network in a highly-entangled box-cluster state or chain-type cluster state. The proposed protocols are systematically scalable to an arbitrary finite number N and applicable to arbitrary size of modules. The protocol based on a box-cluster state is implemented on a 14-qubit IBM quantum computer for N up to 12. To identify faithful networking teleportation, namely that the elements on real devices required for the networking teleportation process are all qualified for achieving teleportation task, we quantify quantum-mechanical processes using a generic classical-process model through which any classical strategies of mimicry of teleportation can be ruled out. From the viewpoint of achieving a genuinely quantum-mechanical process, the present work provides a novel toolbox consisting of the networking teleportation protocols and the criteria for identifying faithful teleportation for universal quantum computers with modular architectures and facilitates further improvements in the reliability of quantum-information processing.