Related papers: Scalable Quantum State Preparation for Encoding Ge…

Highly entangled quantum states are an ingredient in numerous applications in quantum computing. However, preparing these highly entangled quantum states on currently available quantum computers at high fidelity is limited by ubiquitous…

This paper discusses how particle swarm optimization (PSO) can be used to generate quantum circuits to solve an instance of the MaxOne problem. It then analyzes previous studies on evolutionary algorithms for circuit synthesis. With a brief…

Quantum computers can be used for supervised learning by treating parametrised quantum circuits as models that map data inputs to predictions. While a lot of work has been done to investigate practical implications of this approach, many…

A new method for synthesizing Single-Bit Reconfigurable Passive Electromagnetic Skins (1RP-EMSs) featuring advanced beam shaping capabilities is proposed. By using single-bit unit cells, the multi-scale problem of controlling 1RP-EMSs is…

We employ a machine learning-enabled approach to quantum state engineering based on evolutionary algorithms. In particular, we focus on superconducting platforms and consider a network of qubits -- encoded in the states of artificial atoms…

We present a scheme for scalable quantum information processing (QIP) with atomic ensembles and flying photons. Using the Rydberg blockade, we encode the qubits in the collective atomic states, which could be manipulated fast and easily due…

Quantum cryptography remains a topic of enduring scientific and educational interest. Here, we present a clear and accessible framework for exploring the six-state quantum key distribution protocol, an enhanced three-basis extension of the…

We investigate the relation between the scaling of block entropies and the efficient simulability by Matrix Product States (MPS), and clarify the connection both for von Neumann and Renyi entropies (see Table I). Most notably, even states…

Impressive progress has been made in the past decade in the study of technological applications of varied types of quantum systems. With industry giants like IBM laying down their roadmap for scalable quantum devices with more than…

We investigate quantum algorithms derived from tensor networks to simulate the static and dynamic properties of quantum many-body systems. Using a sequentially prepared quantum circuit representation of a matrix product state (MPS) that we…

Over the last decade tensor network states (TNS) have emerged as a powerful tool for the study of quantum many body systems. The matrix product states (MPS) are one particular case of TNS and are used for the simulation of 1+1 dimensional…

We show that the model wave functions used to describe the fractional quantum Hall effect have exact representations as matrix product states (MPS). These MPS can be implemented numerically in the orbital basis of both finite and infinite…

Quantum machine learning for classical data is currently perceived to have a scalability problem due to (i) a bottleneck at the point of loading data into quantum states, (ii) the lack of clarity around good optimization strategies, and…

Cluster states, a special type of highly entangled states, are a universal resource for measurement-based quantum computation. Here, we propose an efficient one-step generation scheme for cluster states in semiconductor quantum dot…

Quantum error correction (QEC) is a way to protect quantum information against noise. It consists of encoding input information into entangled quantum states known as the code space. Furthermore, to classify if the encoded information is…

We present a scalable scheme for superconducting charge qubits with the assistance of one-dimensional superconducting transmission line resonator (STLR) playing the role of data bus. The coupling between qubit and data bus may be turned on…

Characters of irreducible representations are ubiquitous in group theory. However, computing characters of some groups such as the symmetric group $S_n$ is a challenging problem known to be $\#P$-hard in the worst case. Here we describe a…

We detail techniques to optimise high-level classical simulations of Shor's quantum factoring algorithm. Chief among these is to examine the entangling properties of the circuit and to effectively map it across the one-dimensional structure…

Characterizing large quantum systems with minimal assumptions is a central challenge in quantum information science. Self-testing provides the strongest form of certification by identifying the underlying quantum state solely from observed…

Reference arXiv:1904.03196 recently introduced an algorithm (QPS) for simulating parton showers with intermediate flavor states using polynomial resources on a digital quantum computer. We make use of a new quantum hardware capability…