Search

We show that n-bit integers can be factorized by independently running a quantum circuit with \(\tilde{O}(n^{3/2})\) gates for \(\sqrt {n}+4\) times, and then using polynomial-time classical post-processing. The correctness of the algorithm relies on a certain number-theoretic conjecture. It is currently not clear if the algorithm can lead to improved physical implementations in practice. [ABSTRACT FROM AUTHOR]

The celebrated minimax principle of Yao says that for any Boolean-valued function f with finite domain, there is a distribution µ over the domain of f such that computing f to error against inputs from µ is just as hard as computing f to error on worst-case inputs. Notably, however, the distribution µ depends on the target error level1: the hard distribution which is tight for bounded error might be trivial to solve to small bias, and the hard distribution which is tight for a small bias level might be far from tight for bounded error levels. In this work, we introduce a new type of minimax theorem which can provide a hard distribution µ that works for all bias levels at once. We show that this works for randomized query complexity, randomized communication complexity, some randomized circuit models, quantum query and communication complexities, approximate polynomial degree, and approximate logrank. We also prove an improved version of Impagliazzo's hardcore lemma. Our proofs rely on two innovations over the classical approach of using Von Neumann's minimax theorem or linear programming duality. First, we use Sion's minimax theorem to prove a minimax theorem for ratios of bilinear functions representing the cost and score of algorithms. Second, we introduce a new way to analyze low-bias randomized algorithms by viewing them as "forecasting algorithms" evaluated by a certain proper scoring rule. The expected score of the forecasting version of a randomized algorithm appears to be a more fine-grained way of analyzing the bias of the algorithm. We show that such expected scores have many elegant mathematical properties--for example, they can be amplified linearly instead of quadratically. We anticipate forecasting algorithms will find use in future work in which a fine-grained analysis of small-bias algorithms is required. [ABSTRACT FROM AUTHOR]

We use digital quantum computing to simulate the creation of particles in a dynamic spacetime. We consider a system consisting of a minimally coupled massive quantum scalar field in a spacetime undergoing homogeneous and isotropic expansion, transitioning from one stationary state to another through a brief inflationary period. We simulate two vibration modes, positive and negative for a given field momentum, by devising a quantum circuit that implements the time evolution. With this circuit, we study the number of particles created after the universe expands at a given rate, both by simulating the circuit and by actual experimental implementation on IBM quantum computers, consisting of hundreds of quantum gates. We find that state-of-the-art error mitigation techniques are useful to improve the estimation of the number of particles and the fidelity of the state. [ABSTRACT FROM AUTHOR]

Hybrid systems consisting of highly transparent channels of low-dimensional semiconductors between superconducting elements allow the formation of quantum electronic circuits. Therefore, they are among the novel material platforms that could pave the way for scalable quantum computation. To this aim, InAs two-dimensional electron gases are among the ideal semiconductor systems due to their vanishing Schottky barrier; however, their exploitation is limited by the unavailability of commercial lattice-matched substrates. We show that in situ growth of superconducting aluminum on two-dimensional electron gases forming in metamorphic near-surface InAs quantum wells can be performed by molecular beam epitaxy on GaAs substrates with state-of-the-art quality. Adaptation of the metamorphic growth protocol has allowed us to reach low-temperature electron mobilities up to 1.3 × 105 cm2/Vs in Si-doped InAs/In0.81Ga0.19As two-dimensional electron gases placed 10 nm from the surface with charge density up to 1 × 1012/cm2. Shubnikov-de Haas oscillations on Hall bar structures show well-developed quantum Hall plateaus, including the Zeeman split features. X-ray diffraction and cross-sectional transmission electron microscopy experiments demonstrate the coexistence of (011) and (111) crystal domains in the Al layers. The resistivity of 10-nm-thick Al films as a function of temperature was comparable to the best Al layers on GaAs, and a superconducting proximity effect was observed in a Josephson junction. [ABSTRACT FROM AUTHOR]

Currently, most quantum homomorphic encryption (QHE) schemes only allow a single evaluator (server) to accomplish computation tasks on encrypted data shared by the data owner (user). In addition, the quantum computing capability of the evaluator and the scope of quantum computation it can perform are usually somewhat limited, which significantly reduces the flexibility of the scheme in quantum network environments. In this paper, we propose a novel (t , n) -threshold QHE (TQHE) network scheme based on the Shamir secret sharing protocol, which allows k (t ≤ k ≤ n) evaluators to collaboratively perform evaluation computation operations on each qubit within the shared encrypted sequence. Moreover, each evaluator, while possessing the ability to perform all single-qubit unitary operations, is able to perform arbitrary single-qubit gate computation task assigned by the data owner. We give a specific (3, 5)-threshold example, illustrating the scheme's correctness and feasibility, and simulate it on IBM quantum computing cloud platform. Finally, it is shown that the scheme is secure by analyzing encryption/decryption private keys, ciphertext quantum state sequences during transmission, plaintext quantum state sequence, and the result after computations on the plaintext quantum state sequence. [ABSTRACT FROM AUTHOR]

This study explores the potential of employing algorithms like iSOMA, Differential Evolution, Particle Swarm Optimization, Grey Wolf Optimization, and Ant Colony Optimization for the design of quantum computing circuits. Utilizing the Qiskit environment, the research involved simulating a straightforward quantum circuit with variable parameters. To substantiate the effectiveness of these algorithms, three distinct experimental setups were conducted under varying conditions and degrees of freedom. The findings reveal that these algorithms are not only suitable for simulations but also excel in identifying solutions that conserve qubits. A comparative analysis of the methods was performed using the Friedman test, followed by the Nemenyi post-hoc test to evaluate their relative performance. [ABSTRACT FROM AUTHOR]

The multi-class classification of images is a pivotal challenge within the realm of image processing. As the volume of visual data continues to expand, there is a burgeoning interest in harnessing the unique capabilities of quantum computation to augment the efficiency of classification tasks. However, many existing methods for training quantum image multi-classifiers parallel classical machine learning techniques, where the requisite circuit measurements increase linearly with the volume of training data. This work introduces a novel approach for training a quantum image multi-classifier based on the quantum search algorithm. We have meticulously conducted rigorous experiments on a handwritten digit dataset, a classic benchmark in the field. The results have been meticulously compared with previous works, and the comparative analysis not only validates the efficiency of our proposed approach, requiring only O(N/b) measurements during training, but also highlights a significant quadratic speedup of the algorithm. [ABSTRACT FROM AUTHOR]

Nonadiabatic holonomic quantum computers serve as the physical platform for nonadiabatic holonomic quantum computation. As quantum computation has entered the noisy intermediate-scale era, building accurate intermediate-scale nonadiabatic holonomic quantum computers is clearly necessary. Given that measurements are the sole means of extracting information, they play an indispensable role in nonadiabatic holonomic quantum computers. Accordingly, developing methods to reduce measurement errors in nonadiabatic holonomic quantum computers is of great importance. However, while much attention has been given to the research on nonadiabatic holonomic gates, the research on reducing measurement errors in nonadiabatic holonomic quantum computers is severely lacking. In this study, we propose a measurement error reduction method tailored for intermediate-scale nonadiabatic holonomic quantum computers. The reason we say this is because our method can not only reduce the measurement errors in the computer but also be useful in mitigating errors originating from nonadiabatic holonomic gates. Given these features, our method significantly advances the construction of accurate intermediate-scale nonadiabatic holonomic quantum computers. [ABSTRACT FROM AUTHOR]

Connectivity between qubits plays an irreplaceable role in quantum computation. An urgent task of quantum computation based on atomic arrays is to generate effective coupling between two distant qubits, thereby enhancing connectivity. In this paper, we investigate the realization of two-qubit gates utilizing buffer-atomic configuration, where the non-coding atoms serve as quantum buses to connect the computational qubits. Geometric control is achieved through globally-shined laser pulses in the Rydberg blockade region. It is found that acceleration based on shortcut to adiabaticity can be realized by reshaping the original control waveforms. The proposed distant two-qubit gate demonstrates robustness against systematic errors and random noise. Further numerical simulations indicate that high-fidelity control is maintained even when considering next-nearest-neighbor coupling among the atoms. Thus, our proposal provides a fast and experimentally feasible method for realizing distant two-qubit gates in atomic arrays, which may contribute to improving the scalability of quantum computations. [ABSTRACT FROM AUTHOR]

The concept of quantum acceleration limit has been recently introduced for any unitary time evolution of quantum systems under arbitrary nonstationary Hamiltonians. While Alsing and Cafaro used the Robertson uncertainty relation in their derivation, employed the Robertson–Schrödinger uncertainty relation to find the upper bound on the temporal rate of change of the speed of quantum evolutions. In this paper, we provide a comparative analysis of these two alternative derivations for quantum systems specified by an arbitrary finite-dimensional projective Hilbert space. Furthermore, focusing on a geometric description of the quantum evolution of two-level quantum systems on a Bloch sphere under general time-dependent Hamiltonians, we find the most general conditions needed to attain the maximal upper bounds on the acceleration of the quantum evolution. In particular, these conditions are expressed explicitly in terms of two three-dimensional real vectors, the Bloch vector that corresponds to the evolving quantum state and the magnetic field vector that specifies the Hermitian Hamiltonian of the system. For pedagogical reasons, we illustrate our general findings for two-level quantum systems in explicit physical examples characterized by specific time-varying magnetic field configurations. Finally, we briefly comment on the extension of our considerations to higher-dimensional physical systems in both pure and mixed quantum states. [ABSTRACT FROM AUTHOR]

Major countries like the USA, European Union, UK, Japan, Canada, Australia, Singapore, and China have taken significant initiatives to develop quantum computation infrastructure. India has also taken several steps to join the quantum computation family. The Indian government has taken several initiatives to build the nation's infrastructure on quantum computation and participate in the global quantum landscape. The Indian government has created a roadmap in this direction. The significant steps are: firstly, noteworthy budget allocation (1.12 billion USD in 2020 and 734 million USD for the National Quantum Mission in 2023); secondly, 21 quantum hubs are being developed throughout the country; thirdly, 4 quantum research parks have been created and finally, Department of Science and Technology (DST) has initiated QuEST (Quantum Enabled Science and Technology) programme during 2017–18. The article also discusses other effective strategies and moves by the Indian government, like different ambitious national missions on quantum science and technology to create the country's ecosystem. In that direction, the article addresses the opportunities and challenges of quantum science and technology for India. However, the Indian government should encourage quantum computation research more for the country's development. Finally, the information provided here depicts an overall view of India's quantum computation landscape. [ABSTRACT FROM AUTHOR]

Quantum computers hold the potential to unlock new discoveries in complex quantum systems by enabling the simulation of physical systems that have heretofore been impossible to implement on classical computers due to intractability. A system of particular interest is that of dirty bosons, whose physics highlights the intriguing interplay of disorder and interactions in quantum systems, playing a central role in describing, for instance, ultracold gases in a random potential, doped quantum magnets, and amorphous superconductors. Here, we demonstrate how quantum computers can be used to elucidate the physics of dirty bosons in one and two dimensions. Specifically, we explore the disorder-induced delocalized-to-localized transition using adiabatic state preparation. In one dimension, the quantum circuits can be compressed to small enough depths for execution on currently available quantum computers. In two dimensions, the compression scheme is no longer applicable, thereby requiring the use of large-scale classical state vector simulations to emulate quantum computer performance. In addition, simulating interacting bosons via emulation of a noisy quantum computer allowed us to study the effect of quantum hardware noise on the physical properties of the simulated system. Our results suggest that scaling laws control how noise modifies observables versus its strength, the circuit depth, and the number of qubits. Moreover, we observe that noise impacts the delocalized and localized phases differently. A better understanding of how noise alters the observed properties of the simulated system is essential for leveraging near-term quantum devices for simulation of dirty bosons, and indeed for condensed matter systems in general.

Abstract We consider an atom-cavity system having long-range atomic interactions mediated by cavity modes. It has been shown that quantum simulations of spin models with this system can naturally be used to solve number partition problems. Here, we present encoding schemes for numerous nondeterministic polynomial-time complete (NP-complete) problems, encompassing the majority of Karp’s 21 NP-complete problems. We find a number of such computation problems can be encoded by the atom-cavity system at a linear cost of atom number. There are still certain problems that cannot be encoded by the atom-cavity as efficiently, such as quadratic unconstrained binary optimization (QUBO), and the Hamiltonian cycle. For these problems, we provide encoding schemes with a quadratic or quartic cost in the atom number. We expect this work to provide important guidance to search for the practical quantum advantage of the atom-cavity system in solving NP-complete problems. Moreover, the encoding schemes we develop here may also be adopted in other optical systems for solving NP-complete problems, where a similar form of Mattis-type spin glass Hamiltonian as in the atom-cavity system can be implemented.

We consider an atom-cavity system having long-range atomic interactions mediated by cavity modes. It has been shown that quantum simulations of spin models with this system can naturally be used to solve number partition problems. Here, we present encoding schemes for numerous nondeterministic polynomial-time complete (NP-complete) problems, encompassing the majority of Karp's 21 NP-complete problems. We find a number of such computation problems can be encoded by the atom-cavity system at a linear cost of atom number. There are still certain problems that cannot be encoded by the atom-cavity as efficiently, such as quadratic unconstrained binary optimization (QUBO), and the Hamiltonian cycle. For these problems, we provide encoding schemes with a quadratic or quartic cost in the atom number. We expect this work to provide important guidance to search for the practical quantum advantage of the atom-cavity system in solving NP-complete problems. Moreover, the encoding schemes we develop here may also be adopted in other optical systems for solving NP-complete problems, where a similar form of Mattis-type spin glass Hamiltonian as in the atom-cavity system can be implemented. [ABSTRACT FROM AUTHOR]

Using operator algebras, we extend the theory of quantum computation on a graph to a theory of computation on an arbitrary topological space. Quantum computation is usually implemented on finite discrete sets, and the purpose of this study is to extend this to theories on arbitrary sets. The conventional theory of quantum computers can be viewed as a simplified algebraic geometry theory in which the action of SU(2) is defined on each point of a discrete set. In this study, we extend this in general as a theory of quantum fibrations in which the action of the von Neumann algebra is defined on an arbitrary topological space. The quantum channel is then naturally extended as a net of von Neumann algebras. This allows for a more mathematically rigorous discussion of general theories, including physics and chemistry, which are defined on sets that are not necessarily discrete, from the perspective of quantum computer science. [ABSTRACT FROM AUTHOR]

We explore the use of fractional controlled-not gates in quantum thermodynamics. The Nth-root gate allows for a paced application of two-qubit operations. We apply it in quantum thermodynamic protocols for charging a quantum battery. Circuits for three (and two) qubits are analysed by considering the generated ergotropy and other measures of performance. We also perform an optimisation of initial system parameters, e.g.,the initial quantum coherence of one of the qubits strongly affects the efficiency of protocols and the system's performance as a battery. Finally, we briefly discuss the feasibility for an experimental realization. [ABSTRACT FROM AUTHOR]

The impact of Artificial Intelligence (AI) is rapidly expanding, revolutionizing both science and society. It is applied to practically all areas of life, science, and technology, including materials science, which continuously requires novel tools for effective materials characterization. One of the widely used techniques is scanning probe microscopy (SPM). SPM has fundamentally changed materials engineering, biology, and chemistry by providing tools for atomic‐precision surface mapping. Despite its many advantages, it also has some drawbacks, such as long scanning times or the possibility of damaging soft‐surface materials. In this paper, we focus on the potential for supporting SPM‐based measurements, with an emphasis on the application of AI‐based algorithms, especially Machine Learning‐based algorithms, as well as quantum computing (QC). It has been found that AI can be helpful in automating experimental processes in routine operations, algorithmically searching for optimal sample regions, and elucidating structure–property relationships. Thus, it contributes to increasing the efficiency and accuracy of optical nanoscopy scanning probes. Moreover, the combination of AI‐based algorithms and QC may have enormous potential to enhance the practical application of SPM. The limitations of the AI‐QC‐based approach were also discussed. Finally, we outline a research path for improving AI‐QC‐powered SPM. Research Highlights: Artificial intelligence and quantum computing as support for scanning probe microscopy.The analysis indicates a research gap in the field of scanning probe microscopy.The research aims to shed light into ai‐qc‐powered scanning probe microscopy. [ABSTRACT FROM AUTHOR]

In this paper we show how to measure in the setting of digital quantum simulations the reflection and transmission amplitudes of the one-dimensional scattering of a particle with a short-ranged potential. The main feature of the protocol is the coupling between the particle and an ancillary spin-1/2 degree of freedom. This allows us to reconstruct tomographically the scattering amplitudes, which are in general complex numbers, from the readout of one qubit. Applications of our results are discussed. [ABSTRACT FROM AUTHOR]

At the vanguard of quantum computation and quantum machine learning, the role of convolutional operations is pivotal, serving as the linchpin of image processing techniques. Currently, various quantum convolutional circuits have been proposed, but they are all based on non-ground state encoding. Quantum convolution methods based on ground state encoding, particularly NEQR, have not yet been studied. To address the aforementioned issues, a novel quantum convolutional circuit has been designed based on arithmetic operation modules and quantum amplitude estimation modules. This circuit performs convolution operations on NEQR encoded quantum images. Furthermore, considering the limitations of existing neighborhood pixel extraction methods in quantum image processing, this quantum convolutional circuit has been utilized to design a quantum neighborhood pixel extraction circuit. Neighborhood pixels from a specified pixel in NEQR encoded quantum images are accurately extracted by this circuit, providing a novel solution. Through comparative analysis, our research results show certain advantages in time and space complexity over existing technologies. [ABSTRACT FROM AUTHOR]

In the realm of statistical physics, the number of states in which a system can be realized with a given energy is a key concept that bridges the microscopic and macroscopic descriptions of physical systems. For quantum systems, many approaches rely on the solution of the Schrödinger equation. In this work, we demonstrate how the recently developed rodeo algorithm can be utilized to determine the number of states associated with all energy levels without any prior knowledge of the eigenstates. Quantum computers, with their innate ability to address the intricacies of quantum systems, make this approach particularly promising for the study of the thermodynamics of those systems. To illustrate the procedure's effectiveness, we apply it to compute the number of states of the 1D transverse field Ising model and, consequently, its specific heat, proving the reliability of the method presented here. [ABSTRACT FROM AUTHOR]

Hyper-parallel quantum computation offers irreplaceable advantages in quantum information processing (QIP). In this article, based on the scattering property of photons off emitters coupled to one-dimensional (1D) waveguides, we propose three heralded schemes for implementing hyper-controlled-not (hyper-CNOT) gates on two-photon systems. The four qubits of our hyper-CNOT gates are encoded on the spatial-mode and the polarization degrees of freedom (DOFs) of two-photon systems. In our schemes, the faulty scattering events between photons and quantum emitters caused by system imperfections can be detected and discarded. Besides, no auxiliary photons are needed during the process, reducing the operation time and resource consumption in QIP. We also discuss the success probabilities and fidelities of our schemes, concluding that our schemes may be feasible under current technology. [ABSTRACT FROM AUTHOR]

Geometrical methods in quantum information are very promising for both providing technical tools and intuition into difficult control or optimization problems. Moreover, they are of fundamental importance in connecting pure geometrical theories, like GR, to quantum mechanics, like in the AdS/CFT correspondence. In this paper, we first make a survey of the most important settings in which geometrical methods have proven useful to quantum information theory. Then we lay down a geometric theory of entanglement by a principle of action, discussing a simple example with two qubits and consequences for a quantum theory of space-time. [ABSTRACT FROM AUTHOR]

It is remarkable that Heisenberg's position-momentum uncertainty relation leads to the existence of a maximal acceleration for a physical particle in the context of a geometric reformulation of quantum mechanics. It is also known that the maximal acceleration of a quantum particle is related to the magnitude of the speed of transportation in projective Hilbert space. In this paper, inspired by the study of geometric aspects of quantum evolution by means of the notions of curvature and torsion, we derive an upper bound for the rate of change of the speed of transportation in an arbitrary finite-dimensional projective Hilbert space. The evolution of the physical system being in a pure quantum state is assumed to be governed by an arbitrary time-varying Hermitian Hamiltonian operator. Our derivation, in analogy to the inequalities obtained by L. D. Landau in the theory of fluctuations by means of general commutation relations of quantum-mechanical origin, relies upon a generalization of Heisenberg's uncertainty relation. We show that the acceleration squared of a quantum evolution in projective space is upper bounded by the variance of the temporal rate of change of the Hamiltonian operator. Moreover, focusing for illustrative purposes on the lower-dimensional case of a single spin qubit immersed in an arbitrarily time-varying magnetic field, we discuss the optimal geometric configuration of the magnetic field that yields maximal acceleration along with vanishing curvature and unit geodesic efficiency in projective Hilbert space. Finally, we comment on the consequences that our upper bound imposes on the limit at which one can perform fast manipulations of quantum systems to mitigate dissipative effects and/or obtain a target state in a shorter time. [ABSTRACT FROM AUTHOR]

Private set intersection (PSI) has important application value, however, current quantum PSI protocols are either unsuitable for multi-party scenarios or inefficient. Recently, Imran (arXiv:2303.17196v3, 2023) proposed two quantum secure multi-party greatest common divisor (GCD) protocols that can be used for PSI, but with the downside of information leakage and resource consumption. In this paper, we propose a novel quantum secure multi-party GCD protocol that has higher security and lower complexity. To hide privacy, each party randomly selects a coefficient within a range determined by his input integer, and with the assistance of a semi-honest third party TP, all parties secretly calculate the linear combination of their inputs under these coefficients. Once enough linear combinations are collected, TP calculates the GCD of these combinations, which is equal to the GCD of all input integers. To verify the honesty of participants, a quantum zero-knowledge proof sub-protocol is designed. Analysis shows that our GCD protocol is correct and has security against malicious attacks. Moreover, its complexity is polynomial level and lower than Imran's. Furthermore, we demonstrate the scalability of our GCD protocol in private set operations, such as private set intersection, private set intersection cardinality, private multi-set intersection, etc. [ABSTRACT FROM AUTHOR]

We introduce a class of circuits that solve a particular case of the Bernstein–Vazirani recursive problem for second-level recursion. This class of circuits allows for the implementation of the oracle using a number of T -gates that grows linearly with the number of qubits in the problem. We find an application of this scheme to quantum homomorphic encryption (QHE), which is an important cryptographic technology useful for delegated quantum computing, allowing a remote server to perform quantum computations on encrypted quantum data, so that the server cannot know anything about the client's data. Liang's QHE schemes are suitable for circuits with a polynomial number of gates T / T † . Thus, the simplified circuits we have constructed can be evaluated homomorphically in an efficient manner. [ABSTRACT FROM AUTHOR]

A strategy is developed for writing the time-dependent Schrödinger Equation (TDSE), and more generally the Dyson Series, as a convolution equation using recursive Fourier transforms, thereby decoupling the second-order integral from the first without using the time ordering operator. The energy distribution is calculated for a number of standard perturbation theory examples at first- and second-order. Possible applications include characterization of photonic spectra for bosonic sampling and four-wave mixing in quantum computation and Bardeen tunneling amplitude in quantum mechanics. [ABSTRACT FROM AUTHOR]

Quantum machine learning has made remarkable progress in many important tasks. However, the gate complexity of the initial state preparation is seldom considered in lots of quantum machine learning algorithms, making them non-end-to-end. Herein, we propose a quantum algorithm for the node embedding problem that maps a node graph’s topological structure to embedding vectors. The resulting quantum embedding state can be used as an input for other quantum machine learning algorithms. With O(log(N)) qubits to store the information of N nodes, our algorithm will not lose quantum advantage for the subsequent quantum information processing. Moreover, owing to the use of a parameterized quantum circuit with O(poly(log(N))) depth, the resulting state can serve as an efficient quantum database. In addition, we explored the measurement complexity of the quantum node embedding algorithm, which is the main issue in training parameters, and extended the algorithm to capture high-order neighborhood information between nodes. Finally, we experimentally demonstrated our algorithm on an nuclear magnetic resonance quantum processor to solve a graph model.

Designing efficient techniques to search over encrypted data space has always been an intriguing security challenge, although many solutions based on classical searching methods have been proposed. Grover’s algorithm, a quantum counterpart of searching algorithms, has proven to provide quadratic speedup over any classical search technique on an unsorted database. However, this algorithm is unable to search over encrypted data space. This study proposed an extension of Grover’s algorithm to enable search over encrypted dataspace, allowing clients with limited-capability quantum resources to delegate complex search operations to an untrusted server. The blindness of data in this protocol is achieved by encrypting qubits using Pauli’s rotation gates that maximally mix the outgoing states. The empirical estimation of the overhead of the computation due to the introduction of this technique has been analyzed. This estimate has been used for comparative analysis, showing the efficiency of the proposed protocol. A practical application of the proposed searchable encryption technique has been utilized to estimate the increase in resources needed to carry out a brute-force attack on AES encryption using secure Grover’s algorithm. Furthermore, an extensive experimental analysis of the effect of noise has been studied using four different noise models: amplitude damping, phase damping, depolarizing noise, and bit-flip noise. The investigation provided useful insight into the behavior of the proposed algorithm under noisy conditions and also estimated the tolerance thresholds of the proposed algorithm under different noise models. [ABSTRACT FROM AUTHOR]

Spin 1/2 quantum spin chains represent the prototypical model for coupled two-level systems. Consequently, they offer a fertile playground for both fundamental and technological applications ranging from the theory of thermalization to quantum computation. Recently, it has been shown that interesting phenomena are associated to the boundary conditions imposed on the quantum spin chains via the so-called topological frustration. In this work, we analyze the effects of such frustration on a few-spin system, with a particular focus on the strong even–odd effects induced in the ground-state energy. We then implement a topologically frustrated quantum spin chain on a quantum computer to show that our predictions are visible on current quantum hardware platforms. [ABSTRACT FROM AUTHOR]

Surface-state electrons floating on liquid Helium have been served as one of the great potential experimental platforms to implement quantum computation, wherein the qubits are usually encoded by either the lowest two levels of the vertical vibrations (i.e., Hydrogen-like atoms) or the electronic spins. Given the relevant operations require additional techniques, such as the corresponding millimeter-wave or magnetic field manipulations, here we investigate how to implement the scalable quantum computation with a trapped electron array by alternatively using the usual centimeter-wave manipulating techniques. This is because the eigenfrequency of the present qubit, encoded by the two lowest levels of the lateral vibration of the trapped electron, is limited in the centimeter-wave band. We show that, by biasing the electrodes properly and driving the coplanar waveguide transmission line resonator, the electrons can be individually trapped in a series of anharmonic potentials on liquid Helium. Therefore, the well-developed circuit quantum electrodynamics technique for the implementation of superconducting quantum computation can be conveniently utilized here in the present quantum computing platform (proposed firstly in Phys Rev Lett 105:040503, 2010, to implement the fundamental logic gates, typically such as the single-qubit rotations of the individually addressable trapped electrons, the switchable two-qubit manipulations between the electrons trapped in the distant traps, and also the high-fidelity readouts of the target qubits. The feasibility of the proposal is also discussed by numerical simulations. [ABSTRACT FROM AUTHOR]

Quantum computation is growing in significance and proving to be a powerful tool in meeting the high real-time computational demands of classical digital image processing. However, extensive research has been done on quantum image processing, mainly rooted in binary quantum systems. In this paper, we propose a new quantum ternary image circuit based on the analysis of the existing qutrit representation of quantum images. The proposed design utilizes ternary shift gates and ternary Muthukrishnan–Stroud gates, with the belief that this circuit can be used for ternary quantum image processing. This study makes a significant improvement compared to the existing counterpart in terms of quantum cost, the number of constant inputs, and garbage outputs, which are all essential parameters in quantum circuit design. [ABSTRACT FROM AUTHOR]

In this paper, we further verify the validity of the quantum partial adiabatic search algorithm which was initialized in the previous related works by revisiting its quantum circuit model. The main results got here are as follows. When considering implementing quantum partial adiabatic evolution on a quantum circuit, a correction is given for the time slice estimation for the first stage during this approximation in the previous related works, new evidence is provided for a time complexity cost O (N / M) of quantum partial adiabatic algorithm is impossible, and the correct time complexity O (N / M) of it is emphasized once more according to its circuit correspondence, in which N is the total number of elements in the search problem of which M of them are the marked ones. The findings exposed are hopeful for revisiting quantum partial adiabatic evolution and its connection with the quantum circuit model. [ABSTRACT FROM AUTHOR]

It is known that the Frenet–Serret apparatus of a space curve in three-dimensional Euclidean space determines the local geometry of curves. In particular, the Frenet–Serret apparatus specifies important geometric invariants, including the curvature and the torsion of a curve. It is also acknowledged in quantum information science that low complexity and high efficiency are essential features to achieve when cleverly manipulating quantum states that encode quantum information about a physical system. In this paper, we propose a geometric perspective on how to quantify the bending and the twisting of quantum curves traced by dynamically evolving state vectors. Specifically, we propose a quantum version of the Frenet–Serret apparatus for a quantum trajectory in projective Hilbert space traced by a parallel-transported pure quantum state evolving unitarily under a stationary Hamiltonian specifying the Schrödinger equation. Our proposed constant curvature coefficient is given by the magnitude squared of the covariant derivative of the tangent vector | T 〉 to the state vector | Ψ 〉 and represents a useful measure of the bending of the quantum curve. Our proposed constant torsion coefficient, instead, is defined in terms of the magnitude squared of the projection of the covariant derivative of the tangent vector | T 〉 , orthogonal to both | T 〉 and | Ψ 〉. The torsion coefficient provides a convenient measure of the twisting of the quantum curve. Remarkably, we show that our proposed curvature and torsion coefficients coincide with those existing in the literature, although introduced in a completely different manner. Interestingly, not only we establish that zero curvature corresponds to unit geodesic efficiency during the quantum transportation in projective Hilbert space, but we also find that the concepts of curvature and torsion help enlighten the statistical structure of quantum theory. Indeed, while the former concept can be essentially defined in terms of the concept of kurtosis, the positivity of the latter can be regarded as a restatement of the well-known Pearson inequality that involves both the concepts of kurtosis and skewness in mathematical statistics. Finally, not only do we present illustrative examples with nonzero curvature for single-qubit time-independent Hamiltonian evolutions for which it is impossible to generate torsion, but we also discuss physical applications extended to two-qubit stationary Hamiltonians that generate curves with both nonzero curvature and nonvanishing torsion traced by quantum states with different degrees of entanglement, ranging from separable states to maximally entangled Bell states. In the Appendix C, we examine the different curvature and torsion characteristics of the three qubit | GHZ 〉 and | W 〉 states under evolution by a quantum Heisenberg Hamiltonian. [ABSTRACT FROM AUTHOR]

In this paper, we present a geometric perspective on how to quantify the bending and the twisting of quantum curves traced by state vectors evolving under nonstationary Hamiltonians. Specifically, relying on the existing geometric viewpoint for stationary Hamiltonians, we discuss the generalization of our theoretical construct to time-dependent quantum-mechanical scenarios where both time-varying curvature and torsion coefficients play a key role. Specifically, we present a quantum version of the Frenet–Serret apparatus for a quantum trajectory in projective Hilbert space traced out by a parallel-transported pure quantum state evolving unitarily under a time-dependent Hamiltonian specifying the Schrödinger evolution equation. The time-varying curvature coefficient is specified by the magnitude squared of the covariant derivative of the tangent vector | T 〉 to the state vector | Ψ 〉 and measures the bending of the quantum curve. The time-varying torsion coefficient, instead, is given by the magnitude squared of the projection of the covariant derivative of the tangent vector | T 〉 to the state vector | Ψ 〉 , orthogonal to | T 〉 and | Ψ 〉 and, in addition, measures the twisting of the quantum curve. We find that the time-varying setting exhibits a richer structure from a statistical standpoint. For instance, unlike the time-independent configuration, we find that the notion of generalized variance enters nontrivially in the definition of the torsion of a curve traced out by a quantum state evolving under a nonstationary Hamiltonian. To physically illustrate the significance of our construct, we apply it to an exactly soluble time-dependent two-state Rabi problem specified by a sinusoidal oscillating time-dependent potential. In this context, we show that the analytical expressions for the curvature and torsion coefficients are completely described by only two real three-dimensional vectors, the Bloch vector that specifies the quantum system and the externally applied time-varying magnetic field. Although we show that the torsion is identically zero for an arbitrary time-dependent single-qubit Hamiltonian evolution, we study the temporal behavior of the curvature coefficient in different dynamical scenarios, including off-resonance and on-resonance regimes and, in addition, strong and weak driving configurations. While our formalism applies to pure quantum states in arbitrary dimensions, the analytic derivation of associated curvatures and orbit simulations can become quite involved as the dimension increases. Thus, finally we briefly comment on the possibility of applying our geometric formalism to higher-dimensional qudit systems that evolve unitarily under a general nonstationary Hamiltonian. [ABSTRACT FROM AUTHOR]

Lattice-based cryptosystems are one of the main post-quantum alternatives to asymmetric cryptography currently in use. Most attacks on these cryptosystems can be reduced to the shortest vector problem (SVP) in a lattice. Previously, the authors proposed a quantum oracle model from Grover's algorithm to implement a hybrid quantum-classical algorithm based on the GaussSieve algorithm and solving SVP. In this paper, a new model of a quantum oracle is proposed and analyzed. Two implementations of the new quantum oracle model are proposed and estimated. The complexity of implementing the new quantum oracle model to attack post-quantum lattice-based cryptosystems that are finalists of the NIST post-quantum cryptography competition is analyzed. Comparison of obtained results for new and existing models of quantum oracle is given. [ABSTRACT FROM AUTHOR]

These are exciting times for quantum physics as new quantum technologies are expected to soon transform computing at an unprecedented level. Simultaneously network science is flourishing proving an ideal mathematical and computational framework to capture the complexity of large interacting systems. Here we provide a comprehensive and timely review of the rising field of complex quantum networks. On one side, this subject is key to harness the potential of complex networks in order to provide design principles to boost and enhance quantum algorithms and quantum technologies. On the other side this subject can provide a new generation of quantum algorithms to infer significant complex network properties. The field features fundamental research questions as diverse as designing networks to shape Hamiltonians and their corresponding phase diagram, taming the complexity of many-body quantum systems with network theory, revealing how quantum physics and quantum algorithms can predict novel network properties and phase transitions, and studying the interplay between architecture, topology and performance in quantum communication networks. Our review covers all of these multifaceted aspects in a self-contained presentation aimed both at network-curious quantum physicists and at quantum-curious network theorists. We provide a framework that unifies the field of quantum complex networks along four main research lines: network-generalized, quantum-applied, quantum-generalized and quantum-enhanced. Finally we draw attention to the connections between these research lines, which can lead to new opportunities and new discoveries at the interface between quantum physics and network science. [ABSTRACT FROM AUTHOR]

The hidden subgroup problem (HSP) is a cornerstone problem in quantum computing, which captures many problems of interest and provides a standard framework algorithm for their study based on Fourier sampling, one class of techniques known to provide quantum advantage, and which succeeds for some groups but not others. The quantum hardness of the HSP problem for the dihedral group is a critical question for post-quantum cryptosystems based on learning with errors and also appears in subexponential algorithms for constructing isogenies between elliptic curves over a finite field. In this article, we give an updated overview of the dihedral hidden subgroup problem as approached by the “standard” quantum algorithm for HSP on finite groups, detailing the obstructions for strong Fourier sampling to succeed and summarizing other known approaches and results. In our treatment, we “contrast and compare” as much as possible the cyclic and dihedral cases, with a view to determining bounds for the success probability of a quantum algorithm that uses mm coset samples to solve the HSP on these groups. In the last sections, we prove a number of no-go results for the dihedral coset problem (DCP), motivated by a connection between DCP and cloning of quantum states. The proofs of these no-go results are then adapted to give nontrivial upper bounds on the success probability of a quantum algorithm that uses mm coset samples to solve DCP.