Related papers: Cost-aware Photonic Graph State Generation: A Grap…
We present photonic quantum computing architectures that can deal with both probabilistic (heralded) generation of single photons and probabilistic gates without making use of coherent switching. The only required dynamical element is the…
Deep generative models for graphs have exhibited promising performance in ever-increasing domains such as design of molecules (i.e, graph of atoms) and structure prediction of proteins (i.e., graph of amino acids). Existing work typically…
The experimental realization of increasingly complex quantum states underscores the pressing need for new methods of state learning and verification. In one such framework, quantum state tomography, the aim is to learn the full quantum…
Photonics is the platform of choice to build a modular, easy-to-network quantum computer operating at room temperature. However, no concrete architecture has been presented so far that exploits both the advantages of qubits encoded into…
We show how one can deterministically generate photonic matrix product states with high bond and physical dimensions with an atomic array if one has access to a Rydberg-blockade mechanism. We develop both a quantum gate and an optimal…
Understanding the computational overheads imposed by classical control systems on quantum computing platforms becomes critically important as these quantum machines grow in scale and complexity. In this work, we calculate the overheads…
Graph states are the main computational building blocks of measurement-based computation and a useful tool for error correction in the gate model architecture. The graph states form a class of quantum states which are eigenvectors for the…
The creation complexity of a quantum state is the minimum number of elementary gates required to create it from a basic initial state. The creation complexity of quantum states is closely related to the complexity of quantum circuits, which…
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…
We provide a graphical method to describe and analyze non-Gaussian quantum states using a hypergraph framework. These states are pivotal resources for quantum computing, communication, and metrology, but their characterization is hindered…
Probabilistic computing excels in approximating combinatorial problems and modelling uncertainty. However, using conventional deterministic hardware for probabilistic models is challenging: (pseudo) random number generation introduces…
To overcome the physical limitations of scaling monolithic quantum computers, distributed quantum computing (DQC) interconnects multiple smaller-scale quantum processing units (QPUs) to form a quantum network. However, this approach…
In this work, we compare two schemes for generating arbitrary qudit graph states using spin qudits in silicon. The first scheme proposes the creation of qudit linear graph states from a single emitter - a silicon spin qudit. By employing…
Quantum generative modeling is a growing area of interest for industry-relevant applications. With the field still in its infancy, there are many competing techniques. This work is an attempt to systematically compare a broad range of these…
Drug Discovery is a fundamental and ever-evolving field of research. The design of new candidate molecules requires large amounts of time and money, and computational methods are being increasingly employed to cut these costs. Machine…
We introduce a repeater scheme to efficiently distribute multipartite entangled states in a quantum network with optimal scaling. The scheme allows to generate graph states such as 2D and 3D cluster states of growing size or GHZ states over…
Random graph models are frequently used as a controllable and versatile data source for experimental campaigns in various research fields. Generating such data-sets at scale is a non-trivial task as it requires design decisions typically…
Quantum computing holds immense potential, yet its practical success depends on multiple factors, including advances in quantum circuit design. In this paper, we introduce a generative approach based on denoising diffusion models (DMs) to…
We propose a graph method for systematically searching for schemes that can generate multipartite entanglement in linear bosonic systems with heralding. While heralded entanglement generation offers more tolerable schemes for quantum tasks…
Non-destructive heralded entanglement with photons is a valuable resource for quantum information processing. However, they generally entail ancillary particles and modes that amplify the circuit intricacy. To address this challenge, a…