Related papers: Unifying gate-synthesis and magic state distillati…
The phenomenon of quantum entanglement marks one of the furthest departures from classical physics and is indispensable for quantum information processing. Despite its fundamental importance, the distribution of entanglement over long…
Characterising quantum processes is a key task in and constitutes a challenge for the development of quantum technologies, especially at the noisy intermediate scale of today's devices. One method for characterising processes is randomised…
We show how techniques from machine learning and optimization can be used to find circuits of photonic quantum computers that perform a desired transformation between input and output states. In the simplest case of a single input state,…
To achieve scalable universal quantum computing, we need to implement a universal set of logical gates fault-tolerantly, for which the main difficulty lies with non-Clifford gates. We demonstrate that several characteristic features of the…
Quantum key distribution promises information-theoretically secure communication, with data post-processing playing a vital role in extracting secure keys from raw data. While hardware advancements have significantly improved practical…
The development of a framework for quantifying "non-stabiliserness" of quantum operations is motivated by the magic state model of fault-tolerant quantum computation, and by the need to estimate classical simulation cost for noisy…
Large-scale quantum-correlated networks could transform technologies ranging from communications and cryptography to computation, metrology, and simulation of novel materials. Critical to achieving such quantum enhancements is distributing…
Assume that two distant parties, Alice and Bob, as well as an adversary, Eve, have access to (quantum) systems prepared jointly according to a tripartite state. In addition, Alice and Bob can use local operations and authenticated public…
Quantum computation provides great speedup over its classical counterpart for certain problems. One of the key challenges for quantum computation is to realize precise control of the quantum system in the presence of noise. Control of the…
One of the primary objectives in the field of quantum state learning is to develop algorithms that are time-efficient for learning states generated from quantum circuits. Earlier investigations have demonstrated time-efficient algorithms…
We use a random search technique to find quantum gate sequences that implement perfect quantum state preparation or unitary operator synthesis with arbitrary targets. This approach is based on the recent discovery that there is a large…
Encoding quantum information to protect it from errors is essential for performing large-scale quantum computations. Performing a universal set of quantum gates on encoded states demands a potentially large resource overhead and minimizing…
We tackle the problem of Clifford isometry compilation, i.e, how to synthesize a Clifford isometry into an executable quantum circuit. We propose a simple framework for synthesis that only exploits the elementary properties of the Clifford…
Fault-tolerant protocols enable large and precise quantum algorithms. Many such protocols rely on a feed-forward processing of data, enabled by a hybrid of quantum and classical logic. Representing the control structure of such programs can…
Rotation gates are widely used in various quantum algorithms. To implement fault-tolerant rotation gates, state distillation or gate synthesis is typically employed. However, the overhead of these schemes scales rapidly with increasing…
Although quantum computers have the potential to efficiently solve certain problems considered difficult by known classical approaches, the design of a quantum circuit remains computationally difficult. It is known that the optimal gate…
We employed the techniques from [Phys. Rev. A \textbf{70}, 052328 (2004)/arXiv:0406196] to analytically study two set of quantum circuits containing one $T$ gate/magic $|T\rangle = \frac{|0\rangle+\sqrt{i}|1\rangle}{\sqrt{2}}$ state. These…
Entanglement distillation is a procedure for extracting from one or more pairs of entangled qubits a smaller number of pairs with a higher degree of entanglement that is essential for many applications in quantum information science.…
We propose an approach to optimally synthesize quantum circuits from non-permutative quantum gates such as Controlled-Square-Root-of-Not (i.e. Controlled-V). Our approach reduces the synthesis problem to multiple-valued optimization and…
The Gottesman-Knill theorem asserts that a quantum circuit composed of Clifford gates can be efficiently simulated on a classical computer. Here we revisit this theorem and extend it to quantum circuits composed of Clifford and T gates,…