Towards transistor-based quantum computing
- URL: http://arxiv.org/abs/2605.21045v1
- Date: Wed, 20 May 2026 11:25:17 GMT
- Title: Towards transistor-based quantum computing
- Abstract summary: We propose and study in depth a universal quantum computing architecture based on a quantum construction of transistors.<n>Our teleportation-based quantum transistors, called telesistors'', are ground states of systems with symmetry-protected topological order.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: In this work, we propose and study in depth a universal quantum computing architecture based on a quantum construction of transistors. Our teleportation-based quantum transistors, called ``telesistors'', are ground states of systems with symmetry-protected topological order, hence suppress certain noises and provide high-fidelity Clifford gates without the need for active error correction. This physical protection, quantified by the string order parameters, serves as a low-overhead foundation upon which conventional fault-tolerant encoding (e.g., with stabilizer codes) can be built to achieve universal quantum computation. This architecture shows rich connections with current known architectures, and some desirable merits especially compared with the qubit-based circuits regarding modularity, integration, and program storage. Our study shows that it is plausible to realize it with current technology in the near future.
Related papers
- Witnessing the architecture of quantum circuits [0.0]
determining whether a target unitary can be implemented within a prescribed quantum circuit architecture is a fundamental problem in quantum information.<n>Here we introduce a general framework to define quantum circuit architecture witnesses, which certify the incompatibility of a unitary transformation with a specified quantum circuit architecture.<n>The resulting witnesses provide practical and quantitative certificates of incompatibility, implying lower bounds on implementation resources such as the gate count or circuit depth.
arXiv Detail & Related papers (2026-08-13T12:35:27Z) - Quantum Homomorphic Encryption: Towards Practical and Private Computation on Untrusted Quantum Hardware [0.0]
We propose a universal quantum homomorphic encryption framework developed from the Quantum One-Time Pad scheme.<n>Our approach maintains information-theoretic security and supports a broad class of quantum operations on encrypted quantum states.<n>This work takes a step toward bridging the gap between theoretical quantum homomorphic encryption and practical realization on near-term quantum hardware.
arXiv Detail & Related papers (2026-04-21T09:20:08Z) - Experimental implementation of a discrete-time quantum walk on biological networks [0.0]
We introduce an algorithm that leverages symmetry-sector encoding and trades circuit depth for qubits, while integrating symmetry-respecting postselection as an effective noise-mitigation strategy.<n>We implement quantum walks on complex graphs containing up to 17 nodes and 20 edges -- the largest experiment on superconducting hardware to date.<n>We discuss the framework scalability in the pre-fault-tolerant era and its potential for studying larger biological networks.
arXiv Detail & Related papers (2026-02-27T14:42:37Z) - Quantum Sequential Circuits [0.0]
This work introduces and characterizes quantum sequential circuits (QSCs) as a hardware-oriented paradigm for quantum computing.<n>Unlike conventional qubit-based architectures, QSCs employ symmetry-protected topological junctions where quantum gates are encoded as Choi states via channel-state duality and activated through bulk measurements.
arXiv Detail & Related papers (2026-02-05T00:33:07Z) - Investigating Quantum Circuit Designs Using Neuro-Evolution [2.9631016562930537]
We propose an evolutionary approach to the automated design and training of quantum circuits.<n>The proposed method searches over gate types, qubit connectivity, parameterization, and circuit depth while respecting hardware and noise constraints.<n>Preliminary results demonstrate that circuits evolved on classification tasks are able to achieve over 90% accuracy.
arXiv Detail & Related papers (2026-02-03T18:57:39Z) - AQER: a scalable and efficient data loader for digital quantum computers [62.40228216126285]
We develop AQER, a scalable AQL method that constructs the loading circuit by systematically reducing entanglement in target states.<n>We conduct systematic experiments to evaluate the effectiveness of AQER, using synthetic datasets, classical image and language datasets, and a quantum many-body state datasets with up to 50 qubits.
arXiv Detail & Related papers (2026-02-02T14:39:42Z) - Quantum-Accelerated Wireless Communications: Concepts, Connections, and Implications [59.0413662882849]
Quantum computing is poised to redefine the algorithmic foundations of communication systems.<n>This article outlines the fundamentals of quantum computing in a style familiar to the communications society.<n>We highlight a mathematical harmony between quantum and wireless systems, which makes the topic more enticing to wireless researchers.
arXiv Detail & Related papers (2025-06-25T22:25:47Z) - VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [50.95799256262098]
Variational quantum circuits (VQCs) hold promise for quantum machine learning but face challenges in expressivity, trainability, and noise resilience.<n>We propose VQC-MLPNet, a hybrid architecture where a VQC generates the first-layer weights of a classical multilayer perceptron during training, while inference is performed entirely classically.
arXiv Detail & Related papers (2025-06-12T01:38:15Z) - Provably Robust Training of Quantum Circuit Classifiers Against Parameter Noise [49.97673761305336]
Noise remains a major obstacle to achieving reliable quantum algorithms.<n>We present a provably noise-resilient training theory and algorithm to enhance the robustness of parameterized quantum circuit classifiers.
arXiv Detail & Related papers (2025-05-24T02:51:34Z) - RH: An Architecture for Redesigning Quantum Circuits on Quantum Hardware Devices [6.959884576408311]
We present an architecture that enables the redesign of large-scale quantum circuits on quantum hardware.<n>By prepending a random quantum circuit module to the standard EQ-GAN framework, we extend its capability from quantum state learning to unitary transformation learning.
arXiv Detail & Related papers (2024-12-30T12:05:09Z) - Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
arXiv Detail & Related papers (2024-08-22T08:21:28Z) - A Quantum-Classical Collaborative Training Architecture Based on Quantum
State Fidelity [50.387179833629254]
We introduce a collaborative classical-quantum architecture called co-TenQu.
Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting.
It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
arXiv Detail & Related papers (2024-02-23T14:09:41Z) - Error mitigation and quantum-assisted simulation in the error corrected
regime [77.34726150561087]
A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations.
We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
arXiv Detail & Related papers (2021-03-12T20:58:41Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.