Quantum state discrimination (QSD) is a fundamental task in quantum information processing with numerous applications. We present a variational quantum algorithm that performs the minimum-error QSD, called the variational quantum state discriminator (VQSD). The VQSD uses a parameterized quantum circuit that is trained by minimizing a cost function derived from the QSD, and finds the optimal positive-operator valued measure (POVM) for distinguishing target quantum states. The VQSD is capable of discriminating even unknown states, eliminating the need for expensive quantum state tomography. Our numerical simulations and comparisons with semidefinite programming demonstrate the effectiveness of the VQSD in finding optimal POVMs for minimum-error QSD of both pure and mixed states. In addition, the VQSD can be utilized as a supervised machine learning algorithm for multi-class classification. The area under the receiver operating characteristic curve obtained in numerical simulations with the Iris flower dataset ranges from 0.97 to 1 with an average of 0.985, demonstrating excellent performance of the VQSD classifier.

The two-qubit controlled-NOT gate is one of the central entangling operations in quantum information technology. The controlled-NOT gate for single photon qubits is normally realized as a network of five individual beamsplitters on six optical modes. Quantum walks (QWs) are an alternative photonic architecture involving arrays of coupled waveguides, which have been successful for investigating condensed matter physics, however, have not yet been applied to quantum logical operations. Here, we engineer the tight-binding Hamiltonian of an array of lithium niobate-on-insulator waveguides to experimentally demonstrate the two-qubit controlled-NOT gate in a QW. We measure the two-qubit transfer matrix with 0.938 ± 0.003 fidelity, and we use the gate to generate entangled qubits with 0.945 ± 0.002 fidelity by preparing the control photon in a superposition state. Our results highlight a new application for QWs that use a compact multi-mode interaction region to realize large multi-component quantum circuits.

A proper quantum memory is argued to consist in a quantum channel which cannot be simulated with a measurement followed by classical information storage and a final state preparation, i.e. with an entanglement breaking (EB) channel. The verification of quantum memories (non-EB channels) is a task in which an honest user wants to test the quantum memory of an untrusted, remote provider. This task is inherently suited for the class of protocols with trusted quantum inputs, sometimes called measurement-device-independent (MDI) protocols. Here, we study the MDI certification of non-EB channels in continuous variable (CV) systems. We provide a simple witness based on adversarial metrology, and describe an experimentally friendly protocol that can be used to verify all non Gaussian incompatibility breaking quantum memories. Our results can be tested with current technology and can be applied to test other devices resulting in non-EB channels, such as CV quantum transducers and transmission lines.

We propose a variational quantum eigensolver (VQE) algorithm that uses a fault-tolerant (FT) gate-set, and is hence suitable for implementation on a future error-corrected quantum computer. VQE quantum circuits are typically designed for near-term, noisy quantum devices and have continuously parameterized rotation gates as the central building block. On the other hand, an FT quantum computer (FTQC) can only implement a discrete set of logical gates, such as the so-called Clifford+T gates. We show that the energy minimization of VQE can be performed with such an FT discrete gate-set, where we use the Ross–Selinger algorithm to transpile the continuous rotation gates to the error-correctable Clifford+T gate-set. We find that there is no loss of convergence when compared to the one of parameterized circuits if an adaptive accuracy of the transpilation is used in the VQE optimization. State preparation with VQE requires only a moderate number of T-gates, depending on the system size and transpilation accuracy. We demonstrate these properties on emulators for two prototypical spin models with up to 16 qubits. This is a promising result for the integration of VQE and more generally variational algorithms in the emerging FT setting, where they can form building blocks of the general quantum algorithms that will become accessible in an FTQC.

The speed limit of quantum state transfer (QST) in a system of interacting particles is not only important for quantum information processing, but also directly linked to Lieb–Robinson-type bounds that are crucial for understanding various aspects of quantum many-body physics. For strongly long-range interacting systems such as a fully-connected quantum computer, such a speed limit is still unknown. Here we develop a new quantum brachistochrone method that can incorporate inequality constraints on the Hamiltonian. This method allows us to prove an exactly tight bound on the speed of QST on a subclass of Hamiltonians experimentally realizable by a fully-connected quantum computer.

Dynamical decoupling techniques are a versatile tool for engineering quantum states with tailored properties. In trapped ions, nested layers of continuous dynamical decoupling (CDD) by means of radio-frequency field dressing can cancel dominant magnetic and electric shifts and therefore provide highly prolonged coherence times of electronic states. Exploiting this enhancement for frequency metrology, quantum simulation or quantum computation, poses the challenge to combine the decoupling with laser-ion interactions for the quantum control of electronic and motional states of trapped ions. Ultimately, this will require running quantum gates on qubits from dressed decoupled states. We provide here a compact representation of nested CDD in trapped ions, and apply it to electronic S and D states and optical quadrupole transitions. Our treatment provides all effective transition frequencies and Rabi rates, as well as the effective selection rules of these transitions. On this basis, we discuss the possibility of combining CDD and Mølmer–Sørensen gates.

Tensor networks (TNs) are a family of computational methods built on graph-structured factorizations of large tensors, which have long represented state-of-the-art methods for the approximate simulation of complex quantum systems on classical computers. The rapid pace of recent advancements in numerical computation, notably the rise of GPU and TPU hardware accelerators, have allowed TN algorithms to scale to even larger quantum simulation problems, and to be employed more broadly for solving machine learning tasks. The ‘quantum-inspired’ nature of TNs permits them to be mapped to parametrized quantum circuits (PQCs), a fact which has inspired recent proposals for enhancing the performance of TN algorithms using near-term quantum devices, as well as enabling joint quantum–classical training frameworks that benefit from the distinct strengths of TN and PQC models. However, the success of any such methods depends on efficient and accurate methods for approximating TN states using realistic quantum circuits, which remains an unresolved question. This work compares a range of novel and previously-developed algorithmic protocols for decomposing matrix product states (MPS) of arbitrary bond dimension into low-depth quantum circuits consisting of stacked linear layers of two-qubit unitaries. These protocols are formed from different combinations of a preexisting analytical decomposition method together with constrained optimization of circuit unitaries, with initialization by the former method helping to avoid poor-quality local minima in the latter optimization process. While all of these protocols have efficient classical runtimes, our experimental results reveal one particular protocol employing sequential growth and optimization of the quantum circuit to outperform all others, with even greater benefits in the setting of limited computational resources. Given these promising results, we expect our proposed decomposition protocol to form a useful ingredient within any joint application of TNs and PQCs, further unlocking the rich and complementary benefits of classical and quantum computation.

Quantum search algorithms offer a remarkable advantage of quadratic reduction in query complexity using quantum superposition principle. However, how an actual architecture may access and handle the database in a quantum superposed state has been largely unexplored so far; the quantum state of data was simply assumed to be prepared and accessed by a black-box operation—so-called oracle, even though this process, if not appropriately designed, may adversely diminish the quantum query advantage. Here, we introduce an efficient quantum data-access process, dubbed as quantum data-access machine (QDAM), and present a general architecture for quantum search algorithm. We analyze the runtime of our algorithm in view of the fault-tolerant quantum computation (FTQC) consisting of logical qubits within an effective quantum error correction code. Specifically, we introduce a measure involving two computational complexities, i.e. quantum query and T-depth complexities, which can be critical to assess performance since the logical non-Clifford gates, such as the T (i.e. \pi/8 rotation) gate, are known to be costliest to implement in FTQC. Our analysis shows that for N searching data, a QDAM model exhibiting a logarithmic, i.e. O(\log{N}), growth of the T-depth complexity can be constructed. Further analysis reveals that our QDAM-embedded quantum search requires O(\sqrt{N} \times \log{N}) runtime cost. Our study thus demonstrates that the quantum data search algorithm can truly speed up over classical approaches with the logarithmic T-depth QDAM as a key component.

We present a tomographic protocol for the characterization of multiqubit quantum channels. We discuss a specific class of input states, for which the set of Pauli measurements at the output of the channel directly relates to its Pauli transfer matrix components. We compare our results to those of standard quantum process tomography, showing an exponential reduction in the number of different experimental configurations required by a single matrix element extraction, while keeping the same number of shots. This paves the way for more efficient experimental implementations, whenever a selective knowledge of the Pauli transfer matrix is needed. We provide several examples and simulations.

The quantum angle generator (QAG) is a new full quantum machine learning model designed to generate accurate images on current noise intermediate scale quantum devices. Variational quantum circuits form the core of the QAG model, and various circuit architectures are evaluated. In combination with the so-called MERA-upsampling architecture, the QAG model achieves excellent results, which are analyzed and evaluated in detail. To our knowledge, this is the first time that a quantum model has achieved such accurate results. To explore the robustness of the model to noise, an extensive quantum noise study is performed. In this paper, it is demonstrated that the model trained on a physical quantum device learns the noise characteristics of the hardware and generates outstanding results. It is verified that even a quantum hardware machine calibration change during training of up to 8% can be well tolerated. For demonstration, the model is employed in indispensable simulations in high energy physics required to measure particle energies and, ultimately, to discover unknown particles at the large Hadron Collider at CERN.

Exploring the bulk-boundary correspondences and the boundary-induced phenomena in the strongly-correlated quantum systems belongs to the most fundamental topics of condensed matter physics. In this work, we study the bulk-boundary competition in a simulative Hamiltonian, with which the thermodynamic properties of the infinite-size translationally-invariant system can be optimally mimicked. The simulative Hamiltonian is constructed by introducing local interactions on the boundaries, coined as the entanglement-bath Hamiltonian (EBH) that is analogous to the heat bath. The terms within the EBH are variationally determined by a thermal tensor network method, with coefficients varying with the temperature of the infinite-size system. By treating the temperature as an adjustable hyper-parameter of the EBH, we identify a discontinuity point of the coefficients, dubbed as the ‘boundary quench point’ (BQP), whose physical implication is to distinguish the point, below which the thermal fluctuations from the boundaries to the bulk become insignificant. Fruitful phenomena are revealed when considering the simulative Hamiltonian, with the EBH featuring its own hyper-parameter, under the canonical ensembles at different temperatures. Specifically, a discontinuity in bulk entropy at the BQP is observed. The exotic entropic distribution, the relations between the symmetries of Hamiltonian and BQP, and the impacts from the entanglement-bath dimension are also explored. Our results show that such a singularity differs from those in the conventional thermodynamic phase transition points that normally fall into the Landau–Ginzburg paradigm. Our work provides the opportunities on exploring the exotic phenomena induced by the competition between the bulk and boundaries.

We report the design, fabrication, and characterization of a cryogenic ion trap system for the implementation of quantum logic driven by near-field microwaves. The trap incorporates an on-chip microwave resonator with an electrode geometry designed to null the microwave field component that couples directly to the qubit, while giving a large field gradient for driving entangling logic gates. We map the microwave field using a single 43Ca+ ion, and measure the ion trapping lifetime and motional mode heating rates for one and two ions.

We present a protocol to produce a class of non-thermal Fock state mixtures in trapped ions. This class of states features a clear metrological advantage with respect to the ground state, thus overcoming the standard quantum limit without the need for full sideband cooling and Fock-state preparation on a narrow electronic transition. The protocol consists in the cyclic repetition of red-sideband (RSB), measurement and preparation laser pulses. By means of the Kraus map representation of the protocol, it is possible to relate the length of the RSB pulses to the specific class of states that can be generated. With the help of numerical simulations, we analyse the parametric regime where these states can be reliably reproduced.

The goal of the present work is to guide the development of quantum technologies in the context of fermionic systems. For this, we first elucidate the process of entanglement swapping in electron systems such as atoms, molecules or solid bodies. This demonstrates the significance of the number-parity superselection rule and highlights the relevance of localized few-orbital subsystems for quantum information processing tasks. Then, we explore and quantify the entanglement between localized orbitals in two systems, a tight-binding model of non-interacting electrons and the hydrogen ring. For this, we apply the first closed formula of a faithful entanglement measure, derived in (arXiv:2207.03377) as an extension of the von Neumann entropy to genuinely correlated many-orbital systems. For both systems, long-distance entanglement is found at low and high densities η, whereas for medium densities, \eta \approx \frac{1}{2}, practically only neighboring orbitals are entangled. The Coulomb interaction does not change the entanglement pattern qualitatively except for low and high densities where the entanglement increases as function of the distance between both orbitals.

Any quantum program on a realistic quantum device must be compiled into an executable form while taking into account the underlying hardware constraints. Stringent restrictions on architecture and control imposed by physical platforms make this very challenging. In this paper, based on the quantum variational algorithm, we propose a novel scheme to train an Ansatz circuit and realize high-fidelity compilation of a set of universal quantum gates for singlet-triplet qubits in semiconductor double quantum dots, a fairly heavily constrained system. Furthermore, we propose a scalable architecture for a modular implementation of quantum programs in this constrained systems and validate its performance with two representative demonstrations, the Grover’s algorithm for the database searching (static compilation) and a variant of variational quantum eigensolver for the Max-Cut optimization (dynamic compilation). Our methods are potentially applicable to a wide range of physical devices. This work constitutes an important stepping-stone for exploiting the potential for advanced and complicated quantum algorithms on near-term devices.

Entanglement-based quantum key distribution (QKD) is an essential ingredient in quantum communication, owing to the property of source-independent security and the potential on constructing large-scale quantum communication networks. However, implementation of entanglement-based QKD over long-distance optical fiber links is still challenging, especially over deployed fibers. In this work, we report an experimental QKD using energy-time entangled photon pairs that transmit over optical fibers of 242 km (including a section of 19 km deployed fibers). The QKD is realized through the protocol of dispersive-optics QKD (DO-QKD) with high-dimensional encoding to utilize coincidence counts more efficiently. A reliable, high-accuracy time synchronization technology for long-distance entanglement-based QKD is developed based on the distribution of optical pulses in quantum channels. Our system operates continuously for more than 7 d without active polarization or phase calibration. We ultimately generate secure keys with secure key rates of 0.22 bps and 0.06 bps in the asymptotic and finite-size regimes, respectively. It shows that entanglement-based DO-QKD is reliable for long-distance realization in the field if its high requirement on time synchronization is satisfied.

The ability to efficiently load functions on quantum computers with high fidelity is essential for many quantum algorithms, including those for solving partial differential equations and Monte Carlo estimation. In this work, we introduce the Fourier series loader (FSL) method for preparing quantum states that exactly encode multi-dimensional Fourier series using linear-depth quantum circuits. Specifically, the FSL method prepares a (Dn)-qubit state encoding the 2Dn-point uniform discretization of a D-dimensional function specified by a D-dimensional Fourier series. A free parameter, m, which must be less than n, determines the number of Fourier coefficients, 2^{D(m+1)}, used to represent the function. The FSL method uses a quantum circuit of depth at most 2(n-2)+\lceil \log_{2}(n-m) \rceil + 2^{D(m+1)+2} -2D(m+1), which is linear in the number of Fourier coefficients, and linear in the number of qubits (Dn) despite the fact that the loaded function’s discretization is over exponentially many (2Dn) points. The FSL circuit consists of at most Dn+2^{D(m+1)+1}-1 single-qubit and Dn(n+1)/2 + 2^{D(m+1)+1} - 3D(m+1) - 2 two-qubit gates; we present a classical compilation algorithm with runtime O(2^{3D(m+1)}) to determine the FSL circuit for a given Fourier series. The FSL method allows for the highly accurate loading of complex-valued functions that are well-approximated by a Fourier series with finitely many terms. We report results from noiseless quantum circuit simulations, illustrating the capability of the FSL method to load various continuous 1D functions, and a discontinuous 1D function, on 20 qubits with infidelities of less than 10−6 and 10−3, respectively. We also demonstrate the practicality of the FSL method for near-term quantum computers by presenting experiments performed on the Quantinuum H1-1 and H1-2 trapped-ion quantum computers: we loaded a complex-valued function on 3 qubits with a fidelity of over 95\%, as well as various 1D real-valued functions on up to 6 qubits with classical fidelities ≈99%, and a 2D function on 10 qubits with a classical fidelity ≈94%.

We introduce a family of variational quantum algorithms, which we coin as quantum iterative power algorithms (QIPAs), and demonstrate their capabilities as applied to global-optimization numerical experiments. Specifically, we demonstrate the QIPA based on a double exponential oracle as applied to ground state optimization of the H2 molecule, search for the transmon qubit ground-state, and biprime factorization. Our results indicate that QIPA outperforms quantum imaginary time evolution (QITE) and requires a polynomial number of queries to reach convergence even with exponentially small overlap between an initial quantum state and the final desired quantum state, under some circumstances. We analytically show that there exists an exponential amplitude amplification at every step of the variational quantum algorithm, provided the initial wavefunction has non-vanishing probability with the desired state and that the unique maximum of the oracle is given by \lambda_1\gt0, while all other values are given by the same value 0\lt\lambda_2\lt\lambda_1 (here λ can be taken as eigenvalues of the problem Hamiltonian). The generality of the global-optimization method presented here invites further application to other problems that currently have not been explored with QITE-based near-term quantum computing algorithms. Such approaches could facilitate identification of reaction pathways and transition states in chemical physics, as well as optimization in a broad range of machine learning applications. The method also provides a general framework for adaptation of a class of classical optimization algorithms to quantum computers to further broaden the range of algorithms amenable to implementation on current noisy intermediate-scale quantum computers.

One of the fastest growing areas of interest in quantum computing is its use within machine learning methods, in particular through the application of quantum kernels. Despite this large interest, there exist very few proposals for relevant physical platforms to evaluate quantum kernels. In this article, we propose and simulate a protocol capable of evaluating quantum kernels using Hong–Ou–Mandel interference, an experimental technique that is widely accessible to optics researchers. Our proposal utilises the orthogonal temporal modes of a single photon, allowing one to encode multi-dimensional feature vectors. As a result, interfering two photons and using the detected coincidence counts, we can perform a direct measurement and binary classification. This physical platform confers an exponential quantum advantage also described theoretically in other works. We present a complete description of this method and perform a numerical experiment to demonstrate a sample application for binary classification of classical data.