Abstract We propose a fault-tolerant implementation of the quantum Householder reflection, which is a key operation in various quantum algorithms, quantum-state engineering, generation of arbitrary unitaries, and entanglement characterization. We construct this operation using the modular approach of composite pulses and a relation between the Householder reflection and the quantum phase gate. The proposed implementation is highly insensitive to variations in the experimental parameters, which makes it suitable for high-fidelity quantum information processing.
Abstract We propose a fault-tolerant implementation of the quantum Householder reflection, which is a key operation in various quantum algorithms, quantum-state engineering, generation of arbitrary unitaries, and entanglement characterization. We construct this operation using the modular approach of composite pulses and a relation between the Householder reflection and the quantum phase gate. The proposed implementation is highly insensitive to variations in the experimental parameters, which makes it suitable for high-fidelity quantum information processing.
We present a method to construct high-fidelity quantum phase gates, which are insensitive to errors in various experimental parameters. The phase gates consist of a pair of two sequential broadband composite pulses, with a phase difference $\ensuremath{\pi}+\ensuremath{\alpha}/2$ between them, where $\ensuremath{\alpha}$ is the desired gate phase. By using composite pulses which compensate systematic errors in the pulse area, the frequency detuning, or both the area and the detuning, we thereby construct composite phase gates which compensate errors in the same parameters. Particularly interesting are phase gates which use the recently discovered universal composite pulses, which compensate systematic errors in any parameter of the driving field, which keep the evolution Hermitian (e.g., pulse amplitude and duration, pulse shape, frequency detuning, Stark shifts, residual frequency chirps, etc.).
Abstract I introduce time-reflection photonic quantum computing, an architecture in which qubits are encoded in pairs of counterpropagating photonic modes that evolve along dual temporal channels. By engineering gates that implement time reflections between these channels, the dynamics become intrinsically reversible, causing dominant error processes—dephasing, photon loss, and phase noise—to be continuously unwound and rephased without external feedback or active errorcorrection cycles. This builtin selfcorrection enables ultralowenergy quantum information processing at room temperature and substantially reduces hardware complexity compared with superconducting or trappedion platforms. My analytical modeling and numerical simulations show that timereflection circuits preserve coherence over large depths, maintain high fidelities in the presence of realistic noise, and support the implementation of a universal gate set using photonic resources. These results establish timereflection photonic architectures as a promising, energyefficient route toward scalable quantum information processing.
Quantum computing is a field that shows tremendous possibilities and promise. It can provide an exponential speedup compared to classical computers in many computational problems, including simulations of general quantum mechanical systems, pattern finding and solving linear systems. Quantum computations can be performed by making use of qubits and performing operations, called gates, on them. A physical realisation of a qubit will be faulty, and to combat the errors that will inadvertently but unavoidably occur, the use of a quantum error correction code (QECC) is needed. A QECC is able to correct static errors; errors that occur on the states. However, it can not correct errors that occur on and during the operations. To make the computer resilient to these errors, the implementation of the QECC has to be performed fault-tolerantly. A fault-tolerant implementation of a quantum operation is designed in such a way that errors that happen during the operation, through faulty gates, do not propagate to errors on the states that are not correctable any more by the QECC. Hence, error propagation is a key concept in fault-tolerance. Every element of a general quantum circuit needs to be designed fault-tolerant. One of the elements that will be needed in any realistic quantum computer architecture is the possibility of exchanging the states of two qubits, so that an arbitrary pair of qubits can be brought physically close, allowing the implementation of multi-qubit gates. Exchanging the states of two qubits can be performed by a fault-tolerant SWAP gate, that makes use of one ancilla qubit. In this thesis, a fault-tolerant SWAP operation is implemented on the IBM 5-qubit ‘Tenerife’ device. It is characterized as a quantum channel by performing quantum process tomography (QPT). The CPTP constraints of quantum channels in the framework of QPT are discussed and a method of obtaining a CPTP estimate of an initial QPT reconstruction is given. The error process of the fault-tolerant SWAP is analysed and subsequently compared to a normal implementation of the SWAP gate, on which tomography is performed as well. The main measure that is used in the comparison is the ratio r of multi-qubit errors (or correlated) to single-qubit (or uncorrelated) errors in the two implementations. SPAM errors are an important source of estimated infidelity. To filter these SPAM errors and obtain a better estimate of only the circuits, SPAM errors are approximated to be only measurement errors. The errors are characterized by performing tomography on an arbitrary short identity channel, and subsequently using this as an estimate of the measurement error map. This gives a method to estimate a representation of the circuit itself. We can report on an error ratio r of 0.170±0.0029 for the fault-tolerant SWAP operation and an error ratio r of 1.256 ± 0.0129 for the non-fault-tolerant SWAP operation. However, the total error in the fault-tolerant SWAP is much higher, resulting in a process fidelity Fp = 0.608 for the fault-tolerant implementation and Fp = 0.742 for the normal implementation. This is due to the larger number of gates in the fault-tolerant circuit. This research shows that a SWAP operation can be implemented fault-tolerantly, but that the error rates of the devices need to be reduced before their use becomes viable.
I introduce time-reflection photonic quantum computing, an architecture in which qubits are encoded in pairs of counter-propagating photonic modes that evolve along dual temporal channels. By engineering gates that implement time reflections between these channels, the dynamics become intrinsically reversible, causing dominant error processes—dephasing, photon loss, and phase noise—to be continuously unwound and rephased without external feedback or active error-correction cycles. This built-in self-correction enables ultra-low-energy quantum information processing at room temperature and substantially reduces hardware complexity compared with superconducting or trapped-ion platforms. My analytical modeling and numerical simulations show that time-reflection circuits preserve coherence over large depths, maintain high fidelities in the presence of realistic noise, and support the implementation of a universal gate set using photonic resources. These results establish time-reflection photonic architectures as a promising, energy-efficient route toward scalable quantum information processing.
This paper explores the representation of quantum computing in terms of unitary reflections (unitary transformations that leave invariant a hyperplane of a vector space). The symmetries of qubit systems are found to be supported by Euclidean real reflections (i.e., Coxeter groups) or by specific imprimitive reflection groups, introduced (but not named) in a recent paper [Planat M and Jorrand Ph 2008, {\it J Phys A: Math Theor} {\bf 41}, 182001]. The automorphisms of multiple qubit systems are found to relate to some Clifford operations once the corresponding group of reflections is identified. For a short list, one may point out the Coxeter systems of type B3 and G2 (for single qubits), D5 and A4 (for two qubits), E7 and E6 (for three qubits), the complex reflection groups G(2l,2,5) and groups No 9 and 31 in the Shephard-Todd list. The relevant fault tolerant subsets of the Clifford groups (the Bell groups) are generated by the Hadamard gate, the π/4 phase gate and an entangling (braid) gate [Kauffman L H and Lomonaco S J 2004 {\it New J. of Phys.} {\bf 6}, 134]. Links to the topological view of quantum computing, the lattice approach and the geometry of smooth cubic surfaces are discussed.