Quantum processing by remote quantum control

Qiang, Xiaogang; Zhou, Xiaoqi; Aungskunsiri, Kanin; Cable, Hugo; O’Brien, Jeremy L

doi:10.1088/2058-9565/aa78d6

Cited by 28 publications

(19 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Duality quantum algorithm was proposed in 2002 [ 71 ] for the first time, and it developed fast [ 72 , 73 , 74 , 75 ]. Because both the products of unitary operations and linear combinations of unitary (LCU) operations can be realized by duality quantum algorithm, it has a lot of applications to investigate novel quantum systems [ 16 , 17 , 18 , 19 , 20 , 21 , 76 , 77 , 78 , 79 , 80 ], e.g., systems of large-scale silicon quantum photonics, efficient quantum simulations of open quantum systems, quantum secure computing, passive quantum error correction, etc. Duality quantum algorithm has become one of the strongest tool in designing quantum algorithms [ 81 ].…”

Section: Duality Quantum Algorithmmentioning

confidence: 99%

Efficient Quantum Simulation of an Anti-P-Pseudo-Hermitian Two-Level System

Zheng

Tian

et al. 2020

Entropy

View full text Add to dashboard Cite

Besides Hermitian systems, quantum simulation has become a strong tool to investigate non-Hermitian systems, such as PT-symmetric, anti-PT-symmetric, and pseudo-Hermitian systems. In this work, we theoretically investigate quantum simulation of an anti-P-pseudo-Hermitian two-level system in different dimensional Hilbert spaces. In an arbitrary phase, we find that six dimensions are the minimum to construct the anti-P-pseudo-Hermitian two-level subsystem, and it has a higher success probability than using eight dimensions. We find that the dimensions can be reduced further to four or two when the system is in the anti-PT-symmetric or Hermitian phase, respectively. Both qubit-qudit hybrid and pure-qubit systems are able to realize the simulation, enabling experimental implementations in the near future.

show abstract

Section: Duality Quantum Algorithmmentioning

confidence: 99%

Efficient Quantum Simulation of an Anti-P-Pseudo-Hermitian Two-Level System

Zheng

Tian

et al. 2020

Entropy

View full text Add to dashboard Cite

show abstract

“…We combine this lookup approach with the dual-sequential-CMAC architecture for getting the most optimized design in terms of speed. The total memory, M L , required using this combination is derived in (22), assuming 32-bit floating point numbers are used for each real and imaginary component of the complex matrix and vector elements.…”

Section: Speed Optimization Using Lookupmentioning

confidence: 99%

“…An experimental realization of a quantum computing silicon chip was fabricated in the work of Qiang et al 18 In contrast to other realizations, this quantum chip does not use product of unitary operation architecture as proposed in the work of Benioff, 1 it employed the linear combinations of unitary (LCU) operations architecture, proposed in the work of Gui-Lu. 19 The LCU has found extensive applications in quantum algorithms recently, as reviewed in the work of Shao et al, 20 extending to quantum machine learning, 21 secure multiparty computing, 22 and passive error correction. 23 Despite having operational quantum hardware, there are critical problems and challenges 24 in these systems that need to be solved.…”

Section: Introductionmentioning

confidence: 99%

Scaling reconfigurable emulation of quantum algorithms at high precision and high throughput

El-Araby

Caliga

2019

Quantum Engineering

View full text Add to dashboard Cite

Summary The general approach for emulating quantum algorithms on classical platforms has been through representing them as gate‐based quantum circuits. However, direct implementation of quantum circuits significantly increases the hardware resource utilization and system latency of classical emulators. In this paper, we investigate multiple implementation models alternative to conventional emulation approaches, as feasible solutions to the scalability problem in classical emulation of quantum circuits. In the first model, the quantum circuit functionality is reduced to equivalent, arithmetic (multiply‐and‐accumulate) operations and combined with two computation methods, based on lookup and dynamic generation. In the second model, a kernel operation is extracted from the quantum circuit based on its functionality, and the kernel is iterated through all input quantum states. The proposed emulation models provide space and time optimizations, significantly reducing resource utilizations and latencies and improving scalability. We use these models to develop a highly scalable hardware emulator that is based on reconfigurable technology for efficient simulations of full quantum algorithms and circuits. Our hardware implementations support single precision floating point arithmetic for improved accuracy, and contain fully pipelined designs for high throughput. We investigate quantum algorithms such as quantum Fourier transform and quantum wavelet transform and explore different hardware architectures and optimizations. Experimental results and analysis are provided for the architectures in terms of resource consumption and emulation time. The experiments are carried out on a high‐performance reconfigurable computing system and the obtained results show that the proposed emulator is feasible for running and testing a variety of quantum algorithms.

show abstract

“…While unconditional security for QKD has been proven [19], there are impossibility results to achieve for the case of BC and OT [20][21][22]. Nevertheless, practical solutions for BC and OT were proposed under the assumption of physical limitations on the devices, such as noisy storage and bounded quantum memories [23][24][25][26][27].…”

Section: Introductionmentioning

confidence: 99%

Randomized Oblivious Transfer for Secure Multiparty Computation in the Quantum Setting

Costa¹,

Branco

Goulão

et al. 2021

Entropy

View full text Add to dashboard Cite

Secure computation is a powerful cryptographic tool that encompasses the evaluation of any multivariate function with arbitrary inputs from mutually distrusting parties. The oblivious transfer primitive serves is a basic building block for the general task of secure multi-party computation. Therefore, analyzing the security in the universal composability framework becomes mandatory when dealing with multi-party computation protocols composed of oblivious transfer subroutines. Furthermore, since the required number of oblivious transfer instances scales with the size of the circuits, oblivious transfer remains as a bottleneck for large-scale multi-party computation implementations. Techniques that allow one to extend a small number of oblivious transfers into a larger one in an efficient way make use of the oblivious transfer variant called randomized oblivious transfer. In this work, we present randomized versions of two known oblivious transfer protocols, one quantum and another post-quantum with ring learning with an error assumption. We then prove their security in the quantum universal composability framework, in a common reference string model.

show abstract

Quantum processing by remote quantum control

Cited by 28 publications

References 46 publications

Efficient Quantum Simulation of an Anti-P-Pseudo-Hermitian Two-Level System

Efficient Quantum Simulation of an Anti-P-Pseudo-Hermitian Two-Level System

Scaling reconfigurable emulation of quantum algorithms at high precision and high throughput

Randomized Oblivious Transfer for Secure Multiparty Computation in the Quantum Setting

Contact Info

Product

Resources

About