A Higher radix architecture for quantum carry-lookahead adder

In this paper, we propose an efficient quantum carry-lookahead adder based on the higher radix structure. For the addition of two n-bit numbers, our adder uses [Formula: see text] qubits and [Formula: see text] T gates to get the correct answer in T-depth [Formula: see text], where r is the radix. Quantum carry-lookahead adder has already attracted some attention because of its low T-depth. Our work further reduces the overall cost by introducing a higher radix layer. By analyzing the performance in T-depth, T-count, and qubit count, it is shown that the proposed adder is superior to existing quantum carry-lookahead adders. Even compared to the Draper out-of-place adder which is very compact and efficient, our adder is still better in terms of T-count.

The complexity of NISQ

The recent proliferation of NISQ devices has made it imperative to understand their power. In this work, we define and study the complexity class NISQ, which encapsulates problems that can be efficiently solved by a classical computer with access to noisy quantum circuits. We establish super-polynomial separations in the complexity among classical computation, NISQ, and fault-tolerant quantum computation to solve some problems based on modifications of Simon's problems. We then consider the power of NISQ for three well-studied problems. For unstructured search, we prove that NISQ cannot achieve a Grover-like quadratic speedup over classical computers. For the Bernstein-Vazirani problem, we show that NISQ only needs a number of queries logarithmic in what is required for classical computers. Finally, for a quantum state learning problem, we prove that NISQ is exponentially weaker than classical computers with access to noiseless constant-depth quantum circuits.

Engineering the formation of spin-defects from first principles

The full realization of spin qubits for quantum technologies relies on the ability to control and design the formation processes of spin defects in semiconductors and insulators. We present a computational protocol to investigate the synthesis of point-defects at the atomistic level, and we apply it to the study of a promising spin-qubit in silicon carbide, the divacancy (VV). Our strategy combines electronic structure calculations based on density functional theory and enhanced sampling techniques coupled with first principles molecular dynamics. We predict the optimal annealing temperatures for the formation of VVs at high temperature and show how to engineer the Fermi level of the material to optimize the defect's yield for several polytypes of silicon carbide. Our results are in excellent agreement with available experimental data and provide novel atomistic insights into point defect formation and annihilation processes as a function of temperature.

Benchmarking universal quantum gates via channel spectrum

Noise remains the major obstacle to scalable quantum computation. Quantum benchmarking provides key information on noise properties and is an important step for developing more advanced quantum processors. However, current benchmarking methods are either limited to a specific subset of quantum gates or cannot directly describe the performance of the individual target gate. To overcome these limitations, we propose channel spectrum benchmarking (CSB), a method to infer the noise properties of the target gate, including process fidelity, stochastic fidelity, and some unitary parameters, from the eigenvalues of its noisy channel. Our CSB method is insensitive to state-preparation and measurement errors, and importantly, can benchmark universal gates and is scalable to many-qubit systems. Unlike standard randomized schemes, CSB can provide direct noise information for both target native gates and circuit fragments, allowing benchmarking and calibration of global entangling gates and frequently used modules in quantum algorithms like Trotterized Hamiltonian evolution operator in quantum simulation.

Device-independent certification of indefinite causal order in the quantum switch

Quantum theory is compatible with scenarios in which the order of operations is indefinite. Experimental investigations of such scenarios, all of which have been based on a process known as the quantum switch, have provided demonstrations of indefinite causal order conditioned on assumptions on the devices used in the laboratory. But is a device-independent certification possible, similar to the certification of Bell nonlocality through the violation of Bell inequalities? Previous results have shown that the answer is negative if the switch is considered in isolation. Here, however, we present an inequality that can be used to device-independently certify indefinite causal order in the quantum switch in the presence of an additional spacelike-separated observer under an assumption asserting the impossibility of superluminal and retrocausal influences.

Non-adaptive measurement-based quantum computation on IBM Q

We test the quantumness of IBM's quantum computer IBM Quantum System One in Ehningen, Germany. We generate generalised n-qubit GHZ states and measure Bell inequalities to investigate the n-party entanglement of the GHZ states. The implemented Bell inequalities are derived from non-adaptive measurement-based quantum computation (NMQC), a type of quantum computing that links the successful computation of a non-linear function to the violation of a multipartite Bell-inequality. The goal is to compute a multivariate Boolean function that clearly differentiates non-local correlations from local hidden variables (LHVs). Since it has been shown that LHVs can only compute linear functions, whereas quantum correlations are capable of outputting every possible Boolean function it thus serves as an indicator of multipartite entanglement. Here, we compute various non-linear functions with NMQC on IBM's quantum computer IBM Quantum System One and thereby demonstrate that the presented method can be used to characterize quantum devices. We find a violation for a maximum of seven qubits and compare our results to an existing implementation of NMQC using photons.

High-fidelity parametric beamsplitting with a parity-protected converter

Fast, high-fidelity operations between microwave resonators are an important tool for bosonic quantum computation and simulation with superconducting circuits. An attractive approach for implementing these operations is to couple these resonators via a nonlinear converter and actuate parametric processes with RF drives. It can be challenging to make these processes simultaneously fast and high fidelity, since this requires introducing strong drives without activating parasitic processes or introducing additional decoherence channels. We show that in addition to a careful management of drive frequencies and the spectrum of environmental noise, leveraging the inbuilt symmetries of the converter Hamiltonian can suppress unwanted nonlinear interactions, preventing converter-induced decoherence. We demonstrate these principles using a differentially-driven DC-SQUID as our converter, coupled to two high-Q microwave cavities. Using this architecture, we engineer a highly-coherent beamsplitter and fast (~100 ns) swaps between the cavities, limited primarily by their intrinsic single-photon loss. We characterize this beamsplitter in the cavities' joint single-photon subspace, and show that we can detect and post-select photon loss events to achieve a beamsplitter gate fidelity exceeding 99.98%, which to our knowledge far surpasses the current state of the art.

Quantum computation at the edge of a disordered Kitaev honeycomb lattice

We analyze propagation of quantum information along chiral Majorana edge states in two-dimensional topological materials. The use of edge states may facilitate the braiding operation, an important ingredient in topological quantum computations. For the edge of the Kitaev honeycomb model in a topological phase, we discuss how the edge states can participate in quantum-information processing, and consider a two-qubit logic gate between distant external qubits coupled to the edge. Here we analyze the influence of disorder and noise on properties of the edge states and quantum-gate fidelity. We find that realistically weak disorder does not prevent one from implementation of a high-fidelity operation via the edge.

Selective and Scalable Control of Spin Quantum Memories in a Photonic Circuit

A central goal in many quantum information processing applications is a network of quantum memories that can be entangled with each other while being individually controlled and measured with high fidelity. This goal has motivated the development of programmable photonic integrated circuits (PICs) with integrated spin quantum memories using diamond color center spin-photon interfaces. However, this approach introduces a challenge into the microwave control of individual spins within closely packed registers. Here, we present a quantum memory-integrated photonics platform capable of (i) the integration of multiple diamond color center spins into a cryogenically compatible, high-speed programmable PIC platform, (ii) selective manipulation of individual spin qubits addressed via tunable magnetic field gradients, and (iii) simultaneous control of qubits using numerically optimized microwave pulse shaping. The combination of localized optical control, enabled by the PIC platform, together with selective spin manipulation opens the path to scalable quantum networks on intrachip and interchip platforms.

Bidirectional field-steering and atomic steering induced by a magnon mode in a qubit-photon system

This paper investigates the cavity-magnon steering and qubit-qubit steering of a hybrid quantum system consisting of a single-mode magnon, a two-qubit state, and a single-mode cavity field in the presence of their damping rates. The temporal wave vector of the system is obtained for the initial maximally entangled two-qubit state and initial vacuum state of the magnon and cavity modes. Additionally, the mathematical inequalities for obtaining the cavity-magnon steering and qubit-qubit steering are introduced. The findings reveal that steering between the magnon and cavity is asymmetric, while steering between the two qubits is symmetric in our system. Increasing the atom-field coupling improves steering from magnon to field, while reducing steering between the two qubits. Moreover, increasing magnon-field coupling enhances and elevates the lower bounds of qubit-qubit steering. Further, adding the damping rates causes deterioration of the cavity-magnon steering and qubit-qubit steering. However, the steering persistence is slightly greater when damping originates from the cavity field rather than the magnon modes based on the coupling parameters.

On the renormalization group fixed point of the two-dimensional Ising model at criticality

We analyze the renormalization group fixed point of the two-dimensional Ising model at criticality. In contrast with expectations from tensor network renormalization (TNR), we show that a simple, explicit analytic description of this fixed point using operator-algebraic renormalization (OAR) is possible. Specifically, the fixed point is characterized in terms of spin-spin correlation functions. Explicit error bounds for the approximation of continuum correlation functions are given.

Optimal control of quantum state preparation and entanglement creation in two-qubit quantum system with bounded amplitude

We consider the optimal control problem in a two-qubit system with bounded amplitude. Two cases are studied: quantum state preparation and entanglement creation. Cost functions, fidelity and concurrence, are optimized over bang-off controls for various values of the total duration, respectively. For quantum state preparation problem, three critical time points are determined accurately, and optimal controls are estimated. A better estimation of the quantum speed limit is obtained, so is the time-optimal control. For entanglement creation problem, two critical time points are determined, one of them is the minimal time to achieve maximal entanglement (unit concurrence) starting from the product state. In addition, the comparisons between bang-off and chopped random basis (CRAB) are made.

Asymmetric quantum decision-making

Collective decision-making plays a crucial role in information and communication systems. However, decision conflicts among agents often impede the maximization of potential utilities within the system. Quantum processes have shown promise in achieving conflict-free joint decisions between two agents through the entanglement of photons or the quantum interference of orbital angular momentum (OAM). Nonetheless, previous studies have shown symmetric resultant joint decisions, which, while preserving equality, fail to address disparities. In light of global challenges such as ethics and equity, it is imperative for decision-making systems to not only maintain existing equality but also address and resolve disparities. In this study, we investigate asymmetric collective decision-making theoretically and numerically using quantum interference of photons carrying OAM or entangled photons. We successfully demonstrate the realization of asymmetry; however, it should be noted that a certain degree of photon loss is inevitable in the proposed models. We also provide an analytical formulation for determining the available range of asymmetry and describe a method for obtaining the desired degree of asymmetry.

A highly accurate quantum optimization algorithm for CT image reconstruction based on sinogram patterns

Computed tomography (CT) has been developed as a nondestructive technique for observing minute internal images in samples. It has been difficult to obtain photorealistic (clean or clear) CT images due to various unwanted artifacts generated during the CT scanning process, along with the limitations of back-projection algorithms. Recently, an iterative optimization algorithm has been developed that uses an entire sinogram to reduce errors caused by artifacts. In this paper, we introduce a new quantum algorithm for reconstructing CT images. This algorithm can be used with any type of light source as long as the projection is defined. Assuming an experimental sinogram produced by a Radon transform, to find the CT image of this sinogram, we express the CT image as a combination of qubits. After acquiring the Radon transform of the undetermined CT image, we combine the actual sinogram and the optimized qubits. The global energy optimization value used here can determine the value of qubits through a gate model quantum computer or quantum annealer. In particular, the new algorithm can also be used for cone-beam CT image reconstruction and for medical imaging.

Security of quantum key distribution from generalised entropy accumulation

The goal of quantum key distribution (QKD) is to establish a secure key between two parties connected by an insecure quantum channel. To use a QKD protocol in practice, one has to prove that a finite size key is secure against general attacks: no matter the adversary's attack, they cannot gain useful information about the key. A much simpler task is to prove security against collective attacks, where the adversary is assumed to behave identically and independently in each round. In this work, we provide a formal framework for general QKD protocols and show that for any protocol that can be expressed in this framework, security against general attacks reduces to security against collective attacks, which in turn reduces to a numerical computation. Our proof relies on a recently developed information-theoretic tool called generalised entropy accumulation and can handle generic prepare-and-measure protocols directly without switching to an entanglement-based version.

Quantum correlation in a nano-electro-optomechanical system enhanced by an optical parametric amplifier and Coulomb-type interaction

In this paper, we investigated the quantum correlation of nano-electro-optomechanical system enhanced by an optical parametric amplifier (OPA) and Coulomb-type interaction. In particular, we consider a hybrid system consisting of a cavity and two charged mechanical oscillators with an OPA, where the optical cavity mode is coupled with a charged mechanical oscillator via radiation pressure, and the two charged mechanical oscillators are coupled through a Coulomb interaction. We use logarithmic negativity to quantify quantum entanglement, and quantum discord to measure the quantumness correlation between the two mechanical oscillators. We characterize quantum steering using the steerability between the two mechanical oscillators. Our results show that the presence of OPA and strong Coulomb coupling enhances the quantum correlations between the two mechanical oscillators. In addition, Coulomb interactions are more prominent in quantum correlations. Besides, in the presence of OPA, the maximum amount of quantum entanglement, quantum steering, and quantum discord were achieved between the two mechanical oscillators is greater than in the absence of OPA. Moreover, a proper phase choice of the optical field driving the OPA enhances quantum correlations under suitable conditions. We obtain quantum entanglement confines quantum steering and quantum discord beyond entanglement. Furthermore, quantum entanglement, quantum steering, and quantum discord decrease rapidly with increasing temperature as a result of decoherence. In addition, quantum discord persists at higher temperature values, although the quantum entanglement between the systems also vanishes completely. Our proposed scheme enhances quantum correlation and proves robust against fluctuations in the bath environment. We believe that the present scheme of quantum correlation provides a promising platform for the realization of continuous variable quantum information processing.

A hybrid-qudit representation of digital RGB images

Quantum image processing is an emerging topic in the field of quantum information and technology. In this paper, we propose a new quantum image representation of RGB images with deterministic image retrieval, which is an improvement over all the similar existing representations in terms of using minimum resource. We use two entangled quantum registers constituting of total 7 qutrits to encode the color channels and their intensities. Additionally, we generalize the existing encoding methods by using both qubits and qutrits to encode the pixel positions of a rectangular image. This hybrid-qudit approach aligns well with the current progress of NISQ devices in incorporating higher dimensional quantum systems than qubits. We then describe the image encoding method using higher-order qubit-qutrit gates, and demonstrate the decomposition of these gates in terms of simpler elementary gates. We use the Google Cirq's quantum simulator to verify the image preparation in both the ideal noise-free scenario and in presence of realistic noise modelling. We show that the complexity of the image encoding process is linear in the number of pixels. Lastly, we discuss the image compression and some basic RGB image processing protocols using our representation.

Shadow estimation of gate-set properties from random sequences

With quantum computing devices increasing in scale and complexity, there is a growing need for tools that obtain precise diagnostic information about quantum operations. However, current quantum devices are only capable of short unstructured gate sequences followed by native measurements. We accept this limitation and turn it into a new paradigm for characterizing quantum gate-sets. A single experiment-random sequence estimation-solves a wealth of estimation problems, with all complexity moved to classical post-processing. We derive robust channel variants of shadow estimation with close-to-optimal performance guarantees and use these as a primitive for partial, compressive and full process tomography as well as the learning of Pauli noise. We discuss applications to the quantum gate engineering cycle, and propose novel methods for the optimization of quantum gates and diagnosing cross-talk.

Variational quantum and quantum-inspired clustering

Here we present a quantum algorithm for clustering data based on a variational quantum circuit. The algorithm allows to classify data into many clusters, and can easily be implemented in few-qubit Noisy Intermediate-Scale Quantum devices. The idea of the algorithm relies on reducing the clustering problem to an optimization, and then solving it via a Variational Quantum Eigensolver combined with non-orthogonal qubit states. In practice, the method uses maximally-orthogonal states of the target Hilbert space instead of the usual computational basis, allowing for a large number of clusters to be considered even with few qubits. We benchmark the algorithm with numerical simulations using real datasets, showing excellent performance even with one single qubit. Moreover, a tensor network simulation of the algorithm implements, by construction, a quantum-inspired clustering algorithm that can run on current classical hardware.

Certification of qubits in the prepare-and-measure scenario with large input alphabet and connections with the Grothendieck constant

We address the problem of testing the quantumness of two-dimensional systems in the prepare-and-measure (PM) scenario, using a large number of preparations and a large number of measurement settings, with binary outcome measurements. In this scenario, we introduce constants, which we relate to the Grothendieck constant of order 3. We associate them with the white noise resistance of the prepared qubits and to the critical detection efficiency of the measurements performed. Large-scale numerical tools are used to bound the constants. This allows us to obtain new bounds on the minimum detection efficiency that a setup with 70 preparations and 70 measurement settings can tolerate.

Enhancing quantum teleportation efficacy with noiseless linear amplification

Quantum teleportation constitutes a fundamental tool for various applications in quantum communication and computation. However, state-of-the-art continuous-variable quantum teleportation is restricted to moderate fidelities and short-distance configurations. This is due to unavoidable experimental imperfections resulting in thermal decoherence during the teleportation process. Here we present a heralded quantum teleporter able to overcome these limitations through noiseless linear amplification. As a result, we report a high fidelity of 92% for teleporting coherent states using a modest level of quantum entanglement. Our teleporter in principle allows nearly complete removal of loss induced onto the input states being transmitted through imperfect quantum channels. We further demonstrate the purification of a displaced thermal state, impossible via conventional deterministic amplification or teleportation approaches. The combination of high-fidelity coherent state teleportation alongside the purification of thermalized input states permits the transmission of quantum states over significantly long distances. These results are of both practical and fundamental significance; overcoming long-standing hurdles en route to highly-efficient continuous-variable quantum teleportation, while also shining new light on applying teleportation to purify quantum systems from thermal noise.

Topological Methods for Studying Contextuality: N-Cycle Scenarios and Beyond

Simplicial distributions are combinatorial models describing distributions on spaces of measurements and outcomes that generalize nonsignaling distributions on contextuality scenarios. This paper studies simplicial distributions on two-dimensional measurement spaces by introducing new topological methods. Two key ingredients are a geometric interpretation of Fourier-Motzkin elimination and a technique based on the collapsing of measurement spaces. Using the first one, we provide a new proof of Fine's theorem characterizing noncontextual distributions in N-cycle scenarios. Our approach goes beyond these scenarios and can describe noncontextual distributions in scenarios obtained by gluing cycle scenarios of various sizes. The second technique is used for detecting contextual vertices and deriving new Bell inequalities. Combined with these methods, we explore a monoid structure on simplicial distributions.

Strong-laser-field physics, non-classical light states and quantum information science

Strong--laser--field physics is a research direction that relies on the use of high-power lasers and has led to fascinating achievements ranging from relativistic particle acceleration to attosecond science. On the other hand, quantum optics has been built on the use of low photon number sources and has opened the way for groundbreaking discoveries in quantum technology, advancing investigations ranging from fundamental tests of quantum theory to quantum information processing. Despite the tremendous progress, until recently these directions have remained disconnected. This is because, the majority of the interactions in the strong-field limit have been successfully described by semi-classical approximations treating the electromagnetic field classically, as there was no need to include the quantum properties of the field to explain the observations. The link between strong--laser--field physics, quantum optics, and quantum information science has been developed in the recent past. Studies based on fully quantized and conditioning approaches have shown that intense laser--matter interactions can be used for the generation of controllable entangled and non-classical light states. These achievements open the way for a vast number of investigations stemming from the symbiosis of strong--laser--field physics, quantum optics, and quantum information science. Here, after an introduction to the fundamentals of these research directions, we report on the recent progress in the fully quantized description of intense laser--matter interaction and the methods that have been developed for the generation of non-classical light states and entangled states. Also, we discuss the future directions of non-classical light engineering using strong laser fields, and the potential applications in ultrafast and quantum information science.

Experimental Guesswork with Quantum Side Information Using Twisted Light

Guesswork is an information-theoretic quantity which can be seen as an alternate security criterion to entropy. Recent work has established the theoretical framework for guesswork in the presence of quantum side information, which we extend both theoretically and experimentally. We consider guesswork when the side information consists of the BB84 states and their higher-dimensional generalizations. With this side information, we compute the guesswork for two different scenarios for each dimension. We then performed a proof-of-principle experiment using Laguerre-Gauss modes to experimentally compute the guesswork for higher-dimensional generalizations of the BB84 states. We find that our experimental results agree closely with our theoretical predictions. This work shows that guesswork can be a viable security criterion in cryptographic tasks and is experimentally accessible in a number of optical setups.

The Necessary and Sufficient Conditions When Global and Local Fidelities Are Equal

In the field of quantum information theory, the concept of quantum fidelity is employed to quantify the similarity between two quantum states. It has been observed that the fidelity between two states describing a bipartite quantum system A⊗B is always less than or equal to the quantum fidelity between the states in subsystem A alone. While this fidelity inequality is well understood, determining the conditions under which the inequality becomes an equality remains an open question. In this paper, we present the necessary and sufficient conditions for the equality of fidelities between a bipartite system A⊗B and subsystem A, considering pure quantum states. Moreover, we provide explicit representations of quantum states that satisfy the fidelity equality, based on our derived results.

Probing the symmetry breaking of a light-matter system by an ancillary qubit

Hybrid quantum systems in the ultrastrong, and even more in the deep-strong, coupling regimes can exhibit exotic physical phenomena and promise new applications in quantum technologies. In these nonperturbative regimes, a qubit-resonator system has an entangled quantum vacuum with a nonzero average photon number in the resonator, where the photons are virtual and cannot be directly detected. The vacuum field, however, is able to induce the symmetry breaking of a dispersively coupled probe qubit. We experimentally observe the parity symmetry breaking of an ancillary Xmon artificial atom induced by the field of a lumped-element superconducting resonator deep-strongly coupled with a flux qubit. This result opens a way to experimentally explore the novel quantum-vacuum effects emerging in the deep-strong coupling regime.

Demonstration of quantum-digital payments

Digital payments have replaced physical banknotes in many aspects of our daily lives. Similarly to banknotes, they should be easy to use, unique, tamper-resistant and untraceable, but additionally withstand digital attackers and data breaches. Current technology substitutes customers' sensitive data by randomized tokens, and secures the payment's uniqueness with a cryptographic function, called a cryptogram. However, computationally powerful attacks violate the security of these functions. Quantum technology comes with the potential to protect even against infinite computational power. Here, we show how quantum light can secure daily digital payments by generating inherently unforgeable quantum cryptograms. We implement the scheme over an urban optical fiber link, and show its robustness to noise and loss-dependent attacks. Unlike previously proposed protocols, our solution does not depend on long-term quantum storage or trusted agents and authenticated channels. It is practical with near-term technology and may herald an era of quantum-enabled security.

Improving the Performance of Quantum Cryptography by Using the Encryption of the Error Correction Data

Security of quantum key distribution (QKD) protocols rely solely on quantum physics laws, namely, on the impossibility to distinguish between non-orthogonal quantum states with absolute certainty. Due to this, a potential eavesdropper cannot extract full information from the states stored in their quantum memory after an attack despite knowing all the information disclosed during classical post-processing stages of QKD. Here, we introduce the idea of encrypting classical communication related to error-correction in order to decrease the amount of information available to the eavesdropper and hence improve the performance of quantum key distribution protocols. We analyze the applicability of the method in the context of additional assumptions concerning the eavesdropper's quantum memory coherence time and discuss the similarity of our proposition and the quantum data locking (QDL) technique.

Quantum Image Encryption Based on Quantum DNA Codec and Pixel-Level Scrambling

In order to increase the security and robustness of quantum images, this study combined the quantum DNA codec with quantum Hilbert scrambling to offer an enhanced quantum image encryption technique. Initially, to accomplish pixel-level diffusion and create enough key space for the picture, a quantum DNA codec was created to encode and decode the pixel color information of the quantum image using its special biological properties. Second, we used quantum Hilbert scrambling to muddle the image position data in order to double the encryption effect. In order to enhance the encryption effect, the altered picture was then employed as a key matrix in a quantum XOR operation with the original image. The inverse transformation of the encryption procedure may be used to decrypt the picture since all the quantum operations employed in this research are reversible. The two-dimensional optical image encryption technique presented in this study may significantly strengthen the anti-attack of quantum picture, according to experimental simulation and result analysis. The correlation chart demonstrates that the average information entropy of the RGB three channels is more than 7.999, the average NPCR and UACI are respectively 99.61% and 33.42%, and the peak value of the ciphertext picture histogram is uniform. It offers more security and robustness than earlier algorithms and can withstand statistical analysis and differential assaults.

Theoretical investigation of dynamics and concurrence of entangled [Formula: see text] and anti-[Formula: see text] symmetric polarized photons

Non-Hermitian systems with parity-time [Formula: see text] symmetry and anti-parity-time [Formula: see text] symmetry have exceptional points (EPs) resulting from eigenvector co-coalescence with exceptional properties. In the quantum and classical domains, higher-order EPs for [Formula: see text] symmetry and [Formula: see text]-symmetry systems have been proposed and realized. Both two-qubits [Formula: see text]-[Formula: see text] and [Formula: see text]-[Formula: see text] symmetric systems have seen an increase in recent years, especially in the dynamics of quantum entanglement. However, to our knowledge, neither theoretical nor experimental investigations have been conducted for the dynamics of two-qubits entanglement in the [Formula: see text]-[Formula: see text] symmetric system. We investigate the [Formula: see text]-[Formula: see text] dynamics for the first time. Moreover, we examine the impact of different initial Bell-state conditions on entanglement dynamics in [Formula: see text]-[Formula: see text], [Formula: see text]-[Formula: see text] and [Formula: see text]-[Formula: see text] symmetric systems. Additionally, we conduct a comparative study of entanglement dynamics in the [Formula: see text]-[Formula: see text] symmetrical system, [Formula: see text]-[Formula: see text] symmetrical system, and [Formula: see text]-[Formula: see text] symmetrical systems in order to learn more about non-Hermitian quantum systems and their environments. Entangled qubits evolve in a [Formula: see text]-[Formula: see text] symmetric unbroken regime, the entanglement oscillates with two different oscillation frequencies, and the entanglement is well preserved for a long period of time for the case when non-Hermitian parts of both qubits are taken quite away from the exceptional points.

Winning a CHSH Game without Entangled Particles in a Finite Number of Biased Rounds: How Much Luck Is Needed?

Quantum games, such as the CHSH game, are used to illustrate the puzzle and power of entanglement. These games are played over many rounds and in each round, the participants, Alice and Bob, each receive a question bit to which they each have to give an answer bit, without being able to communicate during the game. When all possible classical answering strategies are analyzed, it is found that Alice and Bob cannot win more than 75% of the rounds. A higher percentage of wins arguably requires an exploitable bias in the random generation of the question bits or access to "non-local" resources, such as entangled pairs of particles. However, in an actual game, the number of rounds has to be finite and question regimes may come up with unequal likelihood, so there is always a possibility that Alice and Bob win by pure luck. This statistical possibility has to be transparently analyzed for practical applications such as the detection of eavesdropping in quantum communication. Similarly, when Bell tests are used in macroscopic situations to investigate the connection strength between system components and the validity of proposed causal models, the available data are limited and the possible combinations of question bits (measurement settings) may not be controlled to occur with equal likelihood. In the present work, we give a fully self-contained proof for a bound on the probability to win a CHSH game by pure luck without making the usual assumption of only small biases in the random number generators. We also show bounds for the case of unequal probabilities based on results from McDiarmid and Combes and numerically illustrate certain exploitable biases.

A Differential-Geometric Approach to Quantum Ignorance Consistent with Entropic Properties of Statistical Mechanics

In this paper, we construct the metric tensor and volume for the manifold of purifications associated with an arbitrary reduced density operator ρS. We also define a quantum coarse-graining (CG) to study the volume where macrostates are the manifolds of purifications, which we call surfaces of ignorance (SOI), and microstates are the purifications of ρS. In this context, the volume functions as a multiplicity of the macrostates that quantifies the amount of information missing from ρS. Using examples where the SOI are generated using representations of SU(2), SO(3), and SO(N), we show two features of the CG: (1) A system beginning in an atypical macrostate of smaller volume evolves to macrostates of greater volume until it reaches the equilibrium macrostate in a process in which the system and environment become strictly more entangled, and (2) the equilibrium macrostate takes up the vast majority of the coarse-grained space especially as the dimension of the total system becomes large. Here, the equilibrium macrostate corresponds to a maximum entanglement between the system and the environment. To demonstrate feature (1) for the examples considered, we show that the volume behaves like the von Neumann entropy in that it is zero for pure states, maximal for maximally mixed states, and is a concave function with respect to the purity of ρS. These two features are essential to typicality arguments regarding thermalization and Boltzmann's original CG.

Native qudit entanglement in a trapped ion quantum processor

Quantum information carriers, just like most physical systems, naturally occupy high-dimensional Hilbert spaces. Instead of restricting them to a two-level subspace, these high-dimensional (qudit) quantum systems are emerging as a powerful resource for the next generation of quantum processors. Yet harnessing the potential of these systems requires efficient ways of generating the desired interaction between them. Here, we experimentally demonstrate an implementation of a native two-qudit entangling gate up to dimension 5 in a trapped-ion system. This is achieved by generalizing a recently proposed light-shift gate mechanism to generate genuine qudit entanglement in a single application of the gate. The gate seamlessly adapts to the local dimension of the system with a calibration overhead that is independent of the dimension.

Integrated Multiresonator Quantum Memory

We develop an integrated efficient multiresonator quantum memory scheme based on a system of three interacting resonators coupled through a common resonator to an external waveguide via switchable coupler. It is shown that high-precision parameter matching based on step-by-step optimization makes it possible to efficiently store the signal field and enables on-demand retrieval of the signal at specified time moments. Possible experimental implementations and practical applications of the proposed quantum memory scheme are discussed.

Beating the break-even point with a discrete-variable-encoded logical qubit

Quantum error correction (QEC) aims to protect logical qubits from noises by using the redundancy of a large Hilbert space, which allows errors to be detected and corrected in real time1. In most QEC codes2-8, a logical qubit is encoded in some discrete variables, for example photon numbers, so that the encoded quantum information can be unambiguously extracted after processing. Over the past decade, repetitive QEC has been demonstrated with various discrete-variable-encoded scenarios9-17. However, extending the lifetimes of thus-encoded logical qubits beyond the best available physical qubit still remains elusive, which represents a break-even point for judging the practical usefulness of QEC. Here we demonstrate a QEC procedure in a circuit quantum electrodynamics architecture18, where the logical qubit is binomially encoded in photon-number states of a microwave cavity8, dispersively coupled to an auxiliary superconducting qubit. By applying a pulse featuring a tailored frequency comb to the auxiliary qubit, we can repetitively extract the error syndrome with high fidelity and perform error correction with feedback control accordingly, thereby exceeding the break-even point by about 16% lifetime enhancement. Our work illustrates the potential of hardware-efficient discrete-variable encodings for fault-tolerant quantum computation19.

Practical overview of image classification with tensor-network quantum circuits

Circuit design for quantum machine learning remains a formidable challenge. Inspired by the applications of tensor networks across different fields and their novel presence in the classical machine learning context, one proposed method to design variational circuits is to base the circuit architecture on tensor networks. Here, we comprehensively describe tensor-network quantum circuits and how to implement them in simulations. This includes leveraging circuit cutting, a technique used to evaluate circuits with more qubits than those available on current quantum devices. We then illustrate the computational requirements and possible applications by simulating various tensor-network quantum circuits with PennyLane, an open-source python library for differential programming of quantum computers. Finally, we demonstrate how to apply these circuits to increasingly complex image processing tasks, completing this overview of a flexible method to design circuits that can be applied to industrially-relevant machine learning tasks.

Multiphoton non-local quantum interference controlled by an undetected photon

The interference of quanta lies at the heart of quantum physics. The multipartite generalization of single-quanta interference creates entanglement, the coherent superposition of states shared by several quanta. Entanglement allows non-local correlations between many quanta and hence is a key resource for quantum information technology. Entanglement is typically considered to be essential for creating non-local quantum interference. Here, we show that this is not the case and demonstrate multiphoton non-local quantum interference that does not require entanglement of any intrinsic properties of the photons. We harness the superposition of the physical origin of a four-photon product state, which leads to constructive and destructive interference with the photons' mere existence. With the intrinsic indistinguishability in the generation process of photons, we realize four-photon frustrated quantum interference. This allows us to observe the following noteworthy difference to quantum entanglement: We control the non-local multipartite quantum interference with a photon that we never detect, which does not require quantum entanglement. These non-local properties pave the way for the studies of foundations of quantum physics and potential applications in quantum technologies.

Existence of processes violating causal inequalities on time-delocalised subsystems

It has been shown that it is theoretically possible for there to exist quantum and classical processes in which the operations performed by separate parties do not occur in a well-defined causal order. A central question is whether and how such processes can be realised in practice. In order to provide a rigorous framework for the notion that certain such processes have a realisation in standard quantum theory, the concept of time-delocalised quantum subsystem has been introduced. In this paper, we show that realisations on time-delocalised subsystems exist for all unitary extensions of tripartite processes. This class contains processes that violate causal inequalities, i.e., that can generate correlations that witness the incompatibility with definite causal order in a device-independent manner, and whose realisability has been a central open problem. We consider a known example of such a tripartite classical process that has a unitary extension, and study its realisation on time-delocalised subsystems. We then discuss this finding with regard to the assumptions that underlie causal inequalities, and argue that they are indeed a meaningful concept to show the absence of a definite causal order between the variables of interest.

Optimization of shadow evaporation and oxidation for reproducible quantum Josephson junction circuits

The most commonly used physical realization of superconducting qubits for quantum circuits is a transmon. There are a number of superconducting quantum circuits applications, where Josephson junction critical current reproducibility over a chip is crucial. Here, we report on a robust chip scale Al/AlO_x/Al junctions fabrication method due to comprehensive study of shadow evaporation and oxidation steps. We experimentally demonstrate the evidence of optimal Josephson junction electrodes thickness, deposition rate and deposition angle, which ensure minimal electrode surface and line edge roughness. The influence of oxidation method, pressure and time on critical current reproducibility is determined. With the proposed method we demonstrate Al/AlO_x/Al junction fabrication with the critical current variation [Formula: see text] less than 3.9% (from 150 × 200 to 150 × 600 nm² area) and 7.7% (for 100 × 100 nm² area) over 20 × 20 mm² chip. Finally, we fabricate separately three 5 × 10 mm² chips with 18 transmon qubits (near 4.3 GHz frequency) showing less than 1.9% frequency variation between qubits on different chips. The proposed approach and optimization criteria can be utilized for a robust wafer-scale superconducting qubit circuits fabrication.

Advanced quantum image representation and compression using a DCT-EFRQI approach

In recent years, quantum image computing draws a lot of attention due to storing and processing image data faster compared to classical computers. A number of approaches have been proposed to represent the quantum image inside a quantum computer. Representing and compressing medium and big-size images inside the quantum computer is still challenging. To address this issue, we have proposed a block-wise DCT-EFRQI (Direct Cosine Transform Efficient Flexible Representation of Quantum Image) approach to represent and compress the gray-scale image efficiently to save computational time and reduce the quantum bits (qubits) for the state preparation. In this work, we have demonstrated the capability of block-wise DCT and DWT transformation inside the quantum domain to investigate their relative performances. The Quirk simulation tool is used to design the corresponding quantum image circuit. In the proposed DCT-EFRQI approach, a total of 17 qubits are used to represent the coefficients, the connection between coefficients and state (i.e., auxiliary), and their position for representing and compressing grayscale images inside a quantum computer. Among those, 8 qubits are used to map the coefficient values and the rest are used to generate the corresponding coefficient XY-coordinate position including one auxiliary qubit. Theoretical analysis and experimental results show that the proposed DCT-EFRQI scheme provides better representation and compression compared to DCT-GQIR, DWT-GQIR, and DWT-EFRQI in terms of rate-distortion performance.

Algorithm of quantum engineering of large-amplitude high-fidelity Schrödinger cat states

We present an algorithm of quantum engineering of large-amplitude [Formula: see text] high-fidelity [Formula: see text] even/odd Schrödinger cat states (SCSs) using a single mode squeezed vacuum (SMSV) state as resource. Set of [Formula: see text] beam splitters (BSs) with arbitrary transmittance and reflectance coefficients sequentially following each other acts as a hub that redirects a multiphoton state into the measuring modes simultaneously measured by photon number resolving (PNR) detectors. We show that the multiphoton state splitting guarantees significant increase of the success probability of the SCSs generator compared to its implementation in a single PNR detector version and imposes less requirements on ideal PNR detectors. We prove that the fidelity of the output SCSs and its success probability are in conflict with each other (which can be quantified) in a scheme with ineffective PNR detectors, especially when subtracting large (say, [Formula: see text]) number of photons, i.e., increasing the fidelity to perfect values leads to a sharp decrease in the success probability. In general, the strategy of subtracting up to [Formula: see text] photons from initial SMSV in setup with two BSs is acceptable for achieving sufficiently high values of the fidelity and success probability at the output of the generator of the SCSs of amplitude [Formula: see text] with two inefficient PNR detectors.

Quantum enhanced radio detection and ranging with solid spins

The accurate radio frequency (RF) ranging and localizing of objects has benefited the researches including autonomous driving, the Internet of Things, and manufacturing. Quantum receivers have been proposed to detect the radio signal with ability that can outperform conventional measurement. As one of the most promising candidates, solid spin shows superior robustness, high spatial resolution and miniaturization. However, challenges arise from the moderate response to a high frequency RF signal. Here, by exploiting the coherent interaction between quantum sensor and RF field, we demonstrate quantum enhanced radio detection and ranging. The RF magnetic sensitivity is improved by three orders to 21 [Formula: see text], based on nanoscale quantum sensing and RF focusing. Further enhancing the response of spins to the target's position through multi-photon excitation, a ranging accuracy of 16 μm is realized with a GHz RF signal. The results pave the way for exploring quantum enhanced radar and communications with solid spins.

Quantum computing reduces systemic risk in financial networks

In highly connected financial networks, the failure of a single institution can cascade into additional bank failures. This systemic risk can be mitigated by adjusting the loans, holding shares, and other liabilities connecting institutions in a way that prevents cascading of failures. We are approaching the systemic risk problem by attempting to optimize the connections between the institutions. In order to provide a more realistic simulation environment, we have incorporated nonlinear/discontinuous losses in the value of the banks. To address scalability challenges, we have developed a two-stage algorithm where the networks are partitioned into modules of highly interconnected banks and then the modules are individually optimized. We developed a new algorithms for classical and quantum partitioning for directed and weighed graphs (first stage) and a new methodology for solving Mixed Integer Linear Programming problems with constraints for the systemic risk context (second stage). We compare classical and quantum algorithms for the partitioning problem. Experimental results demonstrate that our two-stage optimization with quantum partitioning is more resilient to financial shocks, delays the cascade failure phase transition, and reduces the total number of failures at convergence under systemic risks with reduced time complexity.

A hybrid classical-quantum approach to speed-up Q-learning

We introduce a classical-quantum hybrid approach to computation, allowing for a quadratic performance improvement in the decision process of a learning agent. Using the paradigm of quantum accelerators, we introduce a routine that runs on a quantum computer, which allows for the encoding of probability distributions. This quantum routine is then employed, in a reinforcement learning set-up, to encode the distributions that drive action choices. Our routine is well-suited in the case of a large, although finite, number of actions and can be employed in any scenario where a probability distribution with a large support is needed. We describe the routine and assess its performance in terms of computational complexity, needed quantum resource, and accuracy. Finally, we design an algorithm showing how to exploit it in the context of Q-learning.

Efficient noise mitigation technique for quantum computing

Quantum computers have enabled solving problems beyond the current machines' capabilities. However, this requires handling noise arising from unwanted interactions in these systems. Several protocols have been proposed to address efficient and accurate quantum noise profiling and mitigation. In this work, we propose a novel protocol that efficiently estimates the average output of a noisy quantum device to be used for quantum noise mitigation. The multi-qubit system average behavior is approximated as a special form of a Pauli Channel where Clifford gates are used to estimate the average output for circuits of different depths. The characterized Pauli channel error rates, and state preparation and measurement errors are then used to construct the outputs for different depths thereby eliminating the need for large simulations and enabling efficient mitigation. We demonstrate the efficiency of the proposed protocol on four IBM Q 5-qubit quantum devices. Our method demonstrates improved accuracy with efficient noise characterization. We report up to 88% and 69% improvement for the proposed approach compared to the unmitigated, and pure measurement error mitigation approaches, respectively.

Quantum asymmetric key crypto scheme using Grover iteration

Here, we propose a quantum asymmetric key cryptography scheme using Grover's quantum search algorithm. In the proposed scheme, Alice generates a pair of public and private keys, keeps the private keys safe, and only discloses public keys to the outside. Bob uses Alice's public key to send a secret message to Alice and Alice uses her private key to decrypt the secret message. Furthermore, we discuss the safety of quantum asymmetric key encryption techniques based on quantum mechanical properties.