wayground logo

Free Printable Worksheets

NEW

Font size

S
M
L
XL
Worksheets

Project Engineer Fresher Quantum

Total questions: 40

Worksheet time: 20mins

Name
Class
Date
1.

Q1. What is the biggest limitation of today’s quantum machine learning models?

a)

Lack of efficient quantum compilers

b)

Quantum circuits are difficult to optimize

c)

Noise and decoherence in quantum hardware

d)

High power consumption

2.

2.What is the quantum equivalent of a classical NAND gate in a reversible form?

a)

Hadamard Gate

b)

Toffoli Gate

c)

Fredkin Gate

d)

Pauli-Z Gate

3.

3.Which quantum algorithm exponentially speeds up prime factorization?

a)

Grover’s Algorithm

b)

Shor’s Algorithm

c)

QAOA

d)

VQE

4.

4.Which gate introduces entanglement between two qubits?

a)

Hadamard Gate

b)

X Gate

c)

CNOT Gate

d)

Toffoli Gate

5.

5.What is the quantum equivalent of the classical NOT gate?

a)

Z Gate

b)

X Gate

c)

Y Gate

d)

Swap Gate

6.

6.Which quantum gate is used to create superposition?

a)

X Gate

b)

Hadamard Gate

c)

CNOT Gate

d)

Z Gate

7.

7.What happens to a qubit upon measurement?

a)

It remains in superposition

b)

It collapses to one of its basis states

c)

It entangles with another qubit

d)

It increases coherence

8.

8.What is a qubit in quantum mechanics?

a)

The quantum analog of a classical bit

b)

A particle in quantum field theory

c)

A quantum mechanical measurement

d)

A statistical ensemble of classical bits

9.

9.Which of the following quantum gates represents a bit-flip?

a)

H (Hadamard)

b)

X (Pauli-X)

c)

Z (Pauli-Z)

d)

S (Phase gate)

10.

10.The Bloch sphere is used to represent which of the following?

a)

Mixed states

b)

Pure qubit states

c)

Superpositions of classical bits

d)

Quantum measurements

11.

11.The uncertainty principle applies to which of the following pairs of observables?

a)

Position and momentum

b)

Energy and time

c)

Angular momentum and spin

d)

Both A and B

12.

12.In quantum mechanics, a pure state can be represented by a:

a)

Density matrix with trace less than 1

b)

State vector in a Hilbert space

c)

Complex scalar

d)

Classical probability distribution

13.

13.The Pauli matrices are examples of:

a)

Hermitian operators

b)

Unitary operators

c)

Anti-Hermitian operators

d)

None of the above

14.

14.In quantum measurement, the probability of an outcome is given by:

a)

The real part of the wavefunction

b)

The modulus squared of the wavefunction

c)

The phase of the wavefunction

d)

The expectation value of the wavefunction

15.

15.What represents a change of basis in a quantum system?

a)

A projection operator

b)

A unitary transformation

c)

A Hermitian transformation

d)

A probabilistic map

16.

16.The Deutsch-Jozsa algorithm is used to:

a)

Solve NP-complete problems

b)

Distinguish constant and balanced functions

c)

Factor large integers

d)

Find the period of a function

17.

17.What is the basic unit of a quantum gate?

a)

A reversible function

b)

A unitary matrix

c)

A Boolean function

d)

A classical XOR operation

18.

18.Grover's search algorithm provides a speedup for:

a)

Database searching

b)

Factoring integers

c)

Quantum simulation

d)

Error correction

19.

19.The quantum Fourier transform is a key step in which quantum algorithm?

a)

Grover's algorithm

b)

Deutsch-Jozsa algorithm

c)

Shor's algorithm

d)

Bernstein-Vazirani algorithm

20.

20.Which of the following codes is used for quantum error correction?

a)

Bit-flip code

b)

Phase-flip code

c)

Shor code

d)

All of the above

21.

21.In quantum computing, measurements can:

a)

Change the quantum state

b)

Leave the quantum state unchanged

c)

Always collapse the quantum state

d)

Only provide partial information about the quantum state

22.

22.Quantum entanglement refers to:

a)

Superposition of states

b)

Correlations between quantum systems that cannot be explained classically

c)

Independent behavior of qubits

d)

Collapse of the wavefunction

23.

23.Which of the following measures is used to quantify quantum entanglement?

a)

Shannon entropy

b)

Von Neumann entropy

c)

Mutual information

d)

Bell inequality

24.

24.What is quantum discord used to measure?

a)

Classical correlations between qubits

b)

The difference between classical and quantum correlations

c)

The energy of a quantum state

d)

The purity of a quantum state

25.

25.What is the principle of superposition in quantum mechanics?

a)

A state can be in multiple classical states simultaneously

b)

A system always remains in a single state

c)

Only particles with mass exhibit superposition

d)

The probability of a state is always 1

26.

26.A qubit can be represented mathematically as:

a)

A complex number

b)

A real number

c)

A two-dimensional vector

d)

A four-dimensional vector

27.

27.Which of the following describes a quantum gate?

a)

A probabilistic operator

b)

A classical logic gate

c)

A unitary matrix

d)

A random process

28.

28.The outcome of a quantum measurement is:

a)

Always deterministic

b)

Always probabilistic

c)

Always equal to the expectation value

d)

Always random

29.

29.Which of the following is a basic law of quantum mechanics?

a)

Newton's third law

b)

The Schrödinger equation

c)

Maxwell's equations

d)

The law of entropy

30.

30.Which of the following quantum gates is known as the square root of NOT?

a)

Hadamard gate

b)

T gate

c)

S gate

d)

√X gate

31.

31.The Pauli-X gate acts on a qubit similarly to which classical gate?

a)

XOR gate

b)

AND gate

c)

NOT gate

d)

OR gate

32.

32.Which of the following represents a mixed state in quantum mechanics?

a)

A superposition state

b)

A probabilistic mixture of pure states

c)

A state with definite position

d)

A state with definite energy

33.

33.The collapse of a wavefunction refers to:

a)

The loss of energy

b)

A quantum measurement process

c)

A quantum error correction process

d)

The creation of a qubit

34.

34.Which of the following is true about qubits compared to classical bits?

a)

Qubits cannot be in superposition

b)

Qubits can exist in a superposition of 0 and 1

c)

Qubits are restricted to two states at a time

d)

Qubits represent binary values exactly like classical bits

35.

35.Which of the following is a universal quantum gate?

a)

Toffoli gate

b)

CNOT gate

c)

Hadamard gate

d)

All of the above

36.

36.Quantum computers are faster than classical computers for certain tasks because

of:

a)

Quantum entanglement

b)

Quantum parallelism

c)

Quantum measurements

d)

Quantum dephasing

37.

37.Which of the following problems can be efficiently solved using Shor’s algorithm?

a)

Searching a large unsorted database

b)

Factoring large integers

c)

Solving linear equations

d)

Solving optimization problems

38.

38.Quantum gates are:

a)

Linear and unitary

b)

Linear and non-unitary

c)

Non-linear and unitary

d)

Non-linear and non-unitary

39.

39.The quantum Fourier transform (QFT) is:

a)

A classical Fourier transform

b)

A quantum version of the classical Fourier transform

c)

A measurement process

d)

A method for generating random numbers

40.

40.In quantum computing, the Hadamard gate creates:

a)

A superposition of 0 and 1

b)

An entangled state

c)

A measurement

d)

A phase flip