Related papers: A Constant Measurement Quantum Algorithm for Graph…
We introduce a class of mixed multiqubit states, that corresponds to a randomized version of graph states. Such states arise when a graph state is prepared with noisy or imperfect controlled-Z gates. We study the entanglement features of…
Simulating strongly correlated fermionic systems is notoriously hard on classical computers. An alternative approach, as proposed by Feynman, is to use a quantum computer. Here, we discuss quantum simulation of strongly correlated fermionic…
Graph states are versatile resources for quantum computation and quantum-enhanced measurement. Their generation illustrates a high level of control over entanglement. We report on the generation of continuous-variable graph states of atomic…
Graph codes play an important role in photonic quantum technologies as they provide significant protection against qubit loss, a dominant noise mechanism. Here, we develop methods to analyse and optimise measurement-based tolerance to qubit…
Graph structures are ubiquitous throughout the natural sciences. Here we consider graph-structured quantum data and describe how to carry out its quantum machine learning via quantum neural networks. In particular, we consider training data…
Graph states are multi-particle entangled states that correspond to mathematical graphs, where the vertices of the graph take the role of quantum spin systems and edges represent Ising interactions. They are many-body spin states of…
In this paper, we propose a new direction of research for the realization of the quantum controlled-not gate based on a technique called ``interaction-free measurement'', where qubits are two-level atoms (or ions) and information is…
Quantum computers provide a fundamentally new computing paradigm that promises to revolutionize our ability to solve broad classes of problems. Surprisingly, the basic mathematical structures of gate-based quantum computing, such as unitary…
We propose a scheme to implement quantum computation in decoherence-free subspace with superconducting devices inside a cavity by unconventional geometric manipulation. Universal single-qubit gates in encoded qubit can be achieved with…
An important family of span programs, st-connectivity span programs, have been used to design quantum algorithms in various contexts, including a number of graph problems and formula evaluation problems. The complexity of the resulting…
We propose a measurement-based FTQC (MB-FTQC) architecture for high-connectivity platforms such as trapped ions and neutral atoms. The key idea is to use verified logical ancillas combined with Knill's error-correcting teleportation,…
We propose a scheme to distribute graph states over quantum networks in the presence of noise in the channels and in the operations. The protocol can be implemented efficiently for large graph sates of arbitrary (complex) topology. We…
A common requirement of quantum simulations and algorithms is the preparation of complex states through sequences of 2-qubit gates. For a generic quantum state, the number of gates grows exponentially with the number of qubits, becoming…
Graph states, and the entanglement they posses, are central to modern quantum computing and communications architectures. Local complementation---the graph operation that links all local-Clifford equivalent graph states---allows us to…
The Graph Isomorphism problem has both theoretical and practical interest. In this paper we present an algorithm, called conauto-1.2, that efficiently tests whether two graphs are isomorphic, and finds an isomorphism if they are. This…
We present a scheme for rapidly entangling matter qubits in order to create graph states for one-way quantum computing. The qubits can be simple 3-level systems in separate cavities. Coupling involves only local fields and a static…
A clever choice and design of gate sets can reduce the depth of a quantum circuit, and can improve the quality of the solution one obtains from a quantum algorithm. This is especially important for near-term quantum computers that suffer…
Although qubits are the leading candidate for the basic elements in a quantum computer, there are also a range of reasons to consider using higher dimensional qudits or quantum continuous variables (QCVs). In this paper we use a general…
Quantum algorithms provide a promising framework in high-energy physics, in particular, for unraveling the causal configurations of multiloop Feynman diagrams by identifying Feynman propagators with qubits, a challenge analogous to querying…
An important application for near-term quantum computing lies in optimization tasks, with applications ranging from quantum chemistry and drug discovery to machine learning. In many settings --- most prominently in so-called parametrized or…