Pith. sign in

REVIEW 2 cited by

Universal quantum circuit for n-qubit quantum gate: A programmable quantum gate

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv quant-ph/0602174 v2 pith:NJBQU5OA submitted 2006-02-21 quant-ph

classification quant-ph
keywords quantumcircuitablebeencomputerdifferentgategiven
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Quantum computation has attracted much attention, among other things, due to its potentialities to solve classical NP problems in polynomial time. For this reason, there has been a growing interest to build a quantum computer. One of the basic steps is to implement the quantum circuit able to realize a given unitary operation. This task has been solved using decomposition of unitary matrices in simpler ones till reach quantum circuits having only single-qubits and CNOTs gates. Usually the goal is to find the minimal quantum circuit able to solve a given problem. In this paper we go in a different direction. We propose a general quantum circuit able to implement any specific quantum circuit by just setting correctly the parameters. In other words, we propose a programmable quantum circuit. This opens the possibility to construct a real quantum computer where several different quantum operations can be realized in the same hardware. The configuration is proposed and its optical implementation is discussed.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Learnable quantum spectral filters for hybrid graph neural networks

    quant-ph 2025-07 reject novelty 5.0 of 10

    A parameterized quantum Fourier circuit with graph-derived gate connections acts as a convolution plus pooling layer in a hybrid quantum-classical graph neural network, achieving benchmark accuracies comparable to som...

  2. Hamiltonian Expressibility for Ansatz Selection in Variational Quantum Algorithms

    quant-ph 2025-07 conditional novelty 4.0 of 10

    In small variational quantum eigensolver problems, high Hamiltonian expressibility helps for superposition-state problems while low expressibility helps for basis-state problems.

Pith tools