Most symmetric algorithms are still quantum safe, but typically you would need to double the key length, so if you are aiming for the equivalent of current 128 bit cryptographic strength in AES, you need to move up to 256 bit keys.
In the public key technology area: Factoring and Discrete Log are broken by Quantum algorithms, so other techniques are needed like Lattice-based methods (these are non classical but more recent like NTRU, and others LWE, and so on). Recently, an attempt to develop quantum algorithms against lattices was published briefly (but it had some flaw, and it is not clear it is correctable-- it is a reminder though that all we know about quantum resistance is that we do not know such algorithms that are efficient; any day such algorithms can be found).
For signature schemes, post-quant. method include the one-way hash based (variants of Merkle).
In symmetric key cryptography, searching a list in quantum is square-root(N) rather than n, and therefore the measure is to double the key length as was done to AES (starting with 128 already factored in quantum search) and so on.