Passive quantum error correction of linear optics networks through error averaging

Marshman, Ryan J.; Lund, Austin P.; Rohde, Peter P.; Ralph, T. C.

doi:10.1103/physreva.97.022324

Cited by 14 publications

(13 citation statements)

References 14 publications

(27 reference statements)

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

“…For design space optimization and improving scalability, we propose integrating the dual-sequential-CMAC architecture with a dynamic approach, which involves generating the algorithm matrix values at runtime, storing only input vectors in memory. Therefore the total memory, M DG , using this method is significantly reduced, as shown in (23). The algorithm matrix U QFT , see (6), is generated as part of the architecture using dedicated hardware units as shown in Figure 4.…”

Section: Area Optimization Using Dynamic Generationmentioning

confidence: 99%

“…An experimental realization of a quantum computing silicon chip was fabricated in the work of Qiang et al In contrast to other realizations, this quantum chip does not use product of unitary operation architecture as proposed in the work of Benioff, it employed the linear combinations of unitary (LCU) operations architecture, proposed in the work of Gui‐Lu . The LCU has found extensive applications in quantum algorithms recently, as reviewed in the work of Shao et al, extending to quantum machine learning, secure multiparty computing, and passive error correction …”

Section: Introductionmentioning

confidence: 99%

“…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. One of the problems is decoherence, 25 which is the disruption of quantum operation due to interactions of the quantum particles with the outside environment.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

“…Marshman et al [19] have shown that, for boson-sampling, it is possible to detect the presence of random phase errors without leaving the paradigm and that the conditional state on detecting the error has a lower error than would otherwise be the case. This was done using a redundant encoding of the passive linear interferometer with a particular network chosen for encoding and decoding of input single photons.…”

Section: Introductionmentioning

confidence: 99%

A robust W-state encoding for linear quantum optics

Vijayan

Lund

Rohde

2020

Quantum

Self Cite

View full text Add to dashboard Cite

Error-detection and correction are necessary prerequisites for any scalable quantum computing architecture. Given the inevitability of unwanted physical noise in quantum systems and the propensity for errors to spread as computations proceed, computational outcomes can become substantially corrupted. This observation applies regardless of the choice of physical implementation. In the context of photonic quantum information processing, there has recently been much interest in passive linear optics quantum computing, which includes boson-sampling, as this model eliminates the highly-challenging requirements for feed-forward via fast, active control. That is, these systems are passive by definition. In usual scenarios, error detection and correction techniques are inherently active, making them incompatible with this model, arousing suspicion that physical error processes may be an insurmountable obstacle. Here we explore a photonic error-detection technique, based on W-state encoding of photonic qubits, which is entirely passive, based on post-selection, and compatible with these near-term photonic architectures of interest. We show that this W-state redundant encoding techniques enables the suppression of dephasing noise on photonic qubits via simple fan-out style operations, implemented by optical Fourier transform networks, which can be readily realised today. The protocol effectively maps dephasing noise into heralding failures, with zero failure probability in the ideal no-noise limit. We present our scheme in the context of a single photonic qubit passing through a noisy communication or quantum memory channel, which has not been generalised to the more general context of full quantum computation.

show abstract

Passive quantum error correction of linear optics networks through error averaging

Cited by 14 publications

References 14 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

A robust W-state encoding for linear quantum optics

Contact Info

Product

Resources

About