The generation of a large amount of entanglement is a necessary condition for a quantum computer to achieve quantum advantage. In this paper, we propose a method to efficiently generate pseudo-random quantum states, for which the degree of multipartite entanglement is nearly maximal. We argue that the method is optimal, and use it to benchmark actual superconducting (IBM’s ibm_lagos) and ion trap (IonQ’s Harmony) quantum processors. Despite the fact that ibm_lagos has lower single-qubit and two-qubit error rates, the overall performance of Harmony is better thanks to its low error rate in state preparation and measurement and to the all-to-all connectivity of qubits. Our result highlights the relevance of the qubits network architecture to ...
Many quantum algorithms seek to output a specific bitstring solving the problem of interest-or a few...
With a combination of the quantum repeater and the cluster state approaches, we show that efficient ...
Quantum computing promises to offer substantial speed-ups over its classical counterpart for certain...
The generation of a large amount of entanglement is a necessary condition for a quantum computer to ...
Recently, various quantum computing and communication tasks have been implemented using IBM's superc...
We study the approximate state preparation problem on noisy intermediate-scale quantum (NISQ) comput...
We show how to efficiently generate pseudorandom states suitable for quantum information processing ...
The tantalizing promise of quantum computers is that certain computational tasks might be executed e...
© International Association for Cryptologic Research 2018. We propose the concept of pseudorandom qu...
We show the following: a randomly chosen pure state as a resource for measurement-based quantum comp...
We investigate the generation of quantum states and unitary operations that are ``random'' in certai...
Quantum Computing is an emerging technology that combines the principles of computer science and qua...
The successful implementation of algorithms on quantum processors relies on the accurate control of ...
Quantum computing (QC) aims to solve certain computational problems beyond the capabilities of even ...
Quantum compiling means fast, device-aware implementation of quantum algorithms (i.e. quantum circui...
Many quantum algorithms seek to output a specific bitstring solving the problem of interest-or a few...
With a combination of the quantum repeater and the cluster state approaches, we show that efficient ...
Quantum computing promises to offer substantial speed-ups over its classical counterpart for certain...
The generation of a large amount of entanglement is a necessary condition for a quantum computer to ...
Recently, various quantum computing and communication tasks have been implemented using IBM's superc...
We study the approximate state preparation problem on noisy intermediate-scale quantum (NISQ) comput...
We show how to efficiently generate pseudorandom states suitable for quantum information processing ...
The tantalizing promise of quantum computers is that certain computational tasks might be executed e...
© International Association for Cryptologic Research 2018. We propose the concept of pseudorandom qu...
We show the following: a randomly chosen pure state as a resource for measurement-based quantum comp...
We investigate the generation of quantum states and unitary operations that are ``random'' in certai...
Quantum Computing is an emerging technology that combines the principles of computer science and qua...
The successful implementation of algorithms on quantum processors relies on the accurate control of ...
Quantum computing (QC) aims to solve certain computational problems beyond the capabilities of even ...
Quantum compiling means fast, device-aware implementation of quantum algorithms (i.e. quantum circui...
Many quantum algorithms seek to output a specific bitstring solving the problem of interest-or a few...
With a combination of the quantum repeater and the cluster state approaches, we show that efficient ...
Quantum computing promises to offer substantial speed-ups over its classical counterpart for certain...